1.题目
2.代码展示
#include <iostream>
using namespace std;
int mon[12] = {0,31,59,90,120,151,181,212,243,273,304,334};
int Add(int y, int m, int d)
{
int num = y * 365 + y/4 - y / 100 + y / 400;
num += mon[m-1];
if(m > 2 && (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0)))
num += 1;
num += d;
return num;
}
int main()
{
int y1, m1, d1;
scanf("%4d%2d%2d", &y1, &m1, &d1);
int n1 = Add(y1, m1, d1);
int y2, m2, d2;
scanf("%4d%2d%2d", &y2, &m2, &d2);
int n2 = Add(y2, m2, d2);
cout << abs(n1 - n2) + 1 << endl;
return 0;
}