有两个日期,求两个日期之间的天数,如果两个日期是连续的我们规定他们之间的天数为两天
输入描述:
有多组数据,每组数据有两行,分别表示两个日期,形式为YYYYMMDD
输出描述:
每组数据输出一行,即日期差值
示例1
输入
20110412
20110422
输出
11
#include <iostream>
using namespace std;
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}};
int isyear(int n)
{
if(n%400==0||n%100!=0&&n%4==0)//判断闰年
return 1;
return 0;
}
int main(){
int m,n;
cin>>n>>m;
int temp ;
if(n>m)
{
temp = n;
n = m;
m = temp;
}
int y1 = n/10000,d1 = n%100,m1 = (n%10000)/100;
int y2 = m/10000,d2 = m%100,m2 = (m%10000)/100;
int a = 1;
while(y1<y2||d1<d2||m1<m2)
{
d1++;
if(d1 == month[m1][isyear(y1)]+1)//每天增加,月底进入下个月
{
m1++;
d1 = 1;
}
if(m1 == 13)
{
y1++;
m1 = 1;
}
a++;
}
cout << a;
return 0;
}
拓展:求day of week
输入
There is one single line contains the day number d, month name M and year number y(1000≤y≤3000). The month name is the corresponding English name starting from the capital letter.
输出
Output a single line with the English name of the day of week corresponding to the date, starting from the capital letter. All other letters must be in lower case.
样例输入
21 December 2012
5 January 2013
样例输出
Friday
Saturday
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
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}};
int isleap(int n)
{
if(n%4==0&&n%100!=0||n%400==0)
return 1;
else
return 0;
}
struct today
{
int d;//day
int y;//year
int m;//month
};
int remonth(char *c)
{
if(strcmp(c,"January")==0)
return 1;
if(strcmp(c,"February")==0)
return 2;
if(strcmp(c,"March")==0)
return 3;
if(strcmp(c,"April")==0)
return 4;
if(strcmp(c,"May")==0)
return 5;
if(strcmp(c,"June")==0)
return 6;
if(strcmp(c,"July")==0)
return 7;
if(strcmp(c,"August")==0)
return 8;
if(strcmp(c,"September")==0)
return 9;
if(strcmp(c,"October")==0)
return 10;
if(strcmp(c,"November")==0)
return 11;
if(strcmp(c,"December")==0)
return 12;
return -1;
}
int reday(today p,today q)
{
int cou=0;
while(p.y<q.y||p.d<q.d||p.m<q.m){
p.d++;
if(p.d==month[p.m][isleap(p.y)]+1)
{
p.d=1;
p.m++;
}
if(p.m==13)
{
p.m=1;
p.y++;
}
cou++;
}
return cou;
}
int main(){
int d;
today p,q;
p.d=1;p.m=3;p.y=2020;
int key =1;
char c[20];
while(scanf("%d",&d)!=EOF){
q.d=d;
cin>>c>>q.y;
q.m=remonth(c);
int day;
if(q.y>2020||q.y==2020&&q.m>3||q.y==2020&&q.m==3&&q.d>1)
{day = reday(p,q);key=1;}
else
{day = reday(q,p);key=0;}
day%=7;
if(key)
switch (day)
{
case 0:cout<<"Sunday"<<endl;break;
case 1:cout<<"Monday"<<endl;break;
case 2:cout<<"Tuesday"<<endl;break;
case 3:cout<<"Wednesday"<<endl;break;
case 4:cout<<"Thursday"<<endl;break;
case 5:cout<<"Friday"<<endl;break;
case 6:cout<<"Saturday"<<endl;break;
}
else
switch (day)
{
case 0:cout<<"Sunday"<<endl;break;
case 6:cout<<"Monday"<<endl;break;
case 5:cout<<"Tuesday"<<endl;break;
case 4:cout<<"Wednesday"<<endl;break;
case 3:cout<<"Thursday"<<endl;break;
case 2:cout<<"Friday"<<endl;break;
case 1:cout<<"Saturday"<<endl;break;
}
}
return 0;
}