题解 | #日期差值#

#include<stdlib.h>
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<string.h>
#include<math.h>
#include<vector>
using namespace std;
typedef long long LL;
const int MAXN=1e5+10;
map<string,int>xudong;
int tianshu[2][13]={
    {0,31,28,31,30,31,30,31,31,30,31,30,31},
    {0,31,29,31,30,31,30,31,31,30,31,30,31}};
int isrun(int year){
    if((year%4==0&&year%100!=0)||year%400==0)return 1;
    else return 0;
}

int main(){
    char s1[9],s2[9];
    int y1,m1,d1,y2,m2,d2;
    while(cin>>s1>>s2){
        sscanf(s1,"%4d%2d%2d",&y1,&m1,&d1);
        sscanf(s2,"%4d%2d%2d",&y2,&m2,&d2);
        LL sum1=0,sum2=0;
        for(int i=0;i<y1;i++){
            if(isrun(i))sum1+=366;
            else sum1+=365;
        }
        for(int i=1;i<m1;i++){
            sum1+=tianshu[isrun(y1)][i];
        }
        sum1+=d1;
        for(int i=0;i<y2;i++){
            if(isrun(i))sum2+=366;
            else sum2+=365;
        }
        for(int i=1;i<m2;i++){
            sum2+=tianshu[isrun(y2)][i];
        }
        sum2+=d2;
        cout<<abs(sum1-sum2)+1<<endl;

    }
    return 0;
}