Bessie asked her friend what day of the week she was born on. She knew that she was born on 2003 May 25, but didn't know what day it was. Write a program to help. Note that no cow was born earlier than the year 1800.
Facts to know:
* January 1, 1900 was on a Monday.
* Lengths of months:
Jan 31 May 31 Sep 30 Feb 28 or 29 Jun 30 Oct 31 Mar 31 Jul 31 Nov 30 Apr 30 Aug 31 Dec 31
* Every year evenly divisible by 4 is a leap year (1992 = 4*498 so 1992 will be a leap year, but the year 1990 is not a leap year).
* The rule above does not hold for century years. Century years divisible by 400 are leap years, all other are not. Thus, the century years 1700, 1800, 1900 and 2100 are not leap years, but 2000 is a leap year. Input
* Line 1: Three space-separated integers that represent respectively the year, month (range 1..12), and day of a date.
* Line 1: A single word that is the day of the week of the specified date (from the lower-case list: monday, tuesday, wednesday, thursday, friday, saturday, sunday).
2003 5 25
sunday
很简单的一个题,把已知的星期几日期,到 要求的日期的天数,之间的天数加起来。然后%7就可以。 很快求写出来了,一直WA,最后才发现范围不是从1900年开始,而是从1800年开始的,浪费的时间很伤心。
#if 0
#include<iostream>
using namespace std;
int sumd;
int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool ok(int x)
{
if((x%4==0&&x%100!=0)||(x%400==0))
return 1;
else
return 0;
}
int main()
{
int y,m,d;
while(cin>>y>>m>>d && y+m+d)
{
sumd=0;
for(int i=1800; i<y; i++)
{
if(ok(i))
{
sumd+=366;
}
else
{
sumd+=365;
}
if(sumd>=7)
{
sumd%=7;
}
}
for(int i=1; i<m; i++)
{
if(i==2)
{
if(ok(y))
{
sumd+=29;
}
else
{
sumd+=28;
}
}
else
{
sumd+=a[i];
}
if(sumd>=7)
{
sumd%=7;
}
}
sumd+=d;
if(sumd>=7)
{
sumd%=7;
}
if(sumd==6)
{
cout<<"monday"<<endl;
}
else
if(sumd==0)
{
cout<<"tuesday"<<endl;
}
else
if(sumd==1)
{
cout<<"wednesday"<<endl;
}
else
if(sumd==2)
{
cout<<"thursday"<<endl;
}
else
if(sumd==3)
{
cout<<"friday"<<endl;
}
else
if(sumd==4)
{
cout<<"saturday"<<endl;
}
else
if(sumd==5)
{
cout<<"sunday"<<endl;
}
}
}
#endif