属于日期类问题:
网址
http://t.cn/E9YZLbi
描述
We now use the Gregorian style of dating in Russia. The leap years are years with number divisible by 4 but not divisible by 100, or divisible by 400. For example, years 2004, 2180 and 2400 are leap. Years 2005, 2181 and 2300 are not leap. Your task is to write a program which will compute the day of week corresponding to a given date in the nearest past or in the future using today’s agreement about dating.
输入描述:
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. Month and Week name in Input/Output: January, February, March, April, May, June, July, August, September, October, November, December Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday
题目大意
编写一个程序,计算给定的日期是星期几
思路
公元1年的第一天是星期一,计算输入的日子到星期一有几天,然后取余7就可以。
#include<iostream>
#include<stdio.h>
#include <cstring>
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}
};
string month[12]
{
"January","February","March","April","May","June","July","August",
"September","October","November","December"
};
string week[7]
{
"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"
};
bool isLeapYear(int year)
{
return (year%4==0&&year%100!=0||year%400==0);
}
int main()
{
int year,mon,day,m,sum;
string M;
while(cin>>day>>M>>year)
{
for(int i = 0;i < 12 ;i++)
{
if(M==month[i])
{
m=i+1;
break;
}
}
int number = 0;
for(int i=1;i<year;i++)
{
number += isLeapYear(i)?366:365;//总把i写成year
number%=7;
}
for(int i=1;i<m;i++)
{
int row = isLeapYear(year);
number+=daytab[row][i];
}
number+=day;
int x = number%7;
cout<<week[x]<<endl;
}
}