有两个日期。求两个日期之间的天数,如果两个日期是连续的,则规定它们之间的天数为两天。
···该题要考虑四个方面,同一年日期连续的,同一年正常情况的,不同年正常情况的,还有不同年(一个年末一个年初连续日期的情况)
#include <iostream>
#include<cstdio>
#include<math.h>
using namespace std;
int daytab[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}
};
bool IsLeapYear(int year){ //判断闰年还是平年
return (year%4==0&&year%100!=0)||(year%400==0);
}
int NumberOfYear(int year){ //年总天数
if(IsLeapYear){
return 366;
}
else{
return 365;
}
}
int calday(int year,int month,int day){ //根据日期计算是第几天
int number=0;
int row=IsLeapYear(year);
for(int j=0;j<month;j++)
{
number+=daytab[row][j];
}
number+=day;
return number;
}
int abs(int day,int day1){
if(day-day1>0)
return day-day1;
else
return day1-day;
}
int main(){
int year,month,day;
int year1,month1,day1;
int dif;
while(scanf("%d%d%d",&year,&month,&day)!=EOF){
scanf("%d%d%d",&year1,&month1,&day1);
if(year==year1) //年一样的情况
{
if((month==month1)&&(abs(day,day1)==1))
dif=2;
else
dif=(std::abs(calday(year1,month1,day1)-calday(year,month,day)+1));
}
else //年不一样的情况
{
if(year>year1)
{
dif=(std::abs(NumberOfYear(year1)-calday(year1,month1,day1)+calday(year,month,day)));
if(dif==1)
dif=2; //年末年初日期连续的情况
}
else if(year<year1){
dif=(std::abs(NumberOfYear(year)-calday(year,month,day)+calday(year1,month1,day1)));
if(dif==1)
dif=2;
}
}
cout<<dif<<endl;
dif=0;
}
return 0;
}
```![运行结果](https://img-blog.csdnimg.cn/direct/0c525ea8008a435fb6dc36f3aed59c42.png#pic_center)