参考了算法笔记的程序,时间超限 有空再看看能不能更快。
#include<cstdio>
//#include<cmath>
int month[13][2]={
(0,0),(31,31),(28,29),(31,31),(30,30),(31,31),(30,30),(31,31),(31,31),(30,30),(31,31),(30,30),(31,31)
};
bool isL(int x){
return (x%4==0&&x%100!=0)||(x%400==0);
}
int main(void){
int time1,y1,m1,d1;
int time2,y2,m2,d2;
while(scanf("%d %d",&time1,&time2)!=EOF){
if(time1>time2){
int temp=time1;
time1=time2;
time2=temp;
}
y1=time1/10000,m1=time1/100%100;d1=time1%100;
y2=time2/10000,m2=time2/100%100;d2=time2%100;
int ans=1;
while(y1<y2||m1<m2||d1<d2){
d1++;
if(d1==month[m1][isL(y1)]+1){
d1=1;
m1++;
}
if(m1==13){
y1++;
m1=1;
}
ans++;
}
printf("%d\n",ans);
}
return 0;
}