题目描述
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 2004, 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.
样例输入
21 December 2012
5 January 2013
样例输出
Friday
Saturday
个人首次解决本题核心思想:即是计算总天数 (计算总天数分为年月日天数分别计算,计算年份和月份的天数区分是否闰年)
然后(总天数 % 7)求出阿拉伯数字 0 1 2 3 4 5 6 对应星期日 星期六..............思想简单但个人处理过程冗余复杂(本人水平所限后期)。
//星期转换
#include <cstdio>
#include <cstring>
struct Date
{
int year;
char month[20];
int day;
};
//年份天数
int jud_year(int year)
{
int y_day = 0;
//每四年一个闰年是错的
int before_y = year - 1; //当前年份的前一年
for(int i = 1; i <= before_y; i++)//i从公元1年算起
{
if((i % 4 == 0 && i % 100 != 0) || (i % 400 == 0))
{
//闰年
y_day += 366;
}
else //平年
y_day += 365;
}
return y_day;
}
//月份转换即将输入的月份转换为月份对应的阿拉伯数字
//不能使用switch,switch:表达式(int/ char) 不能是字符串
int sw_month(char month[])
{
int m = 0;
if(strcmp(month,"January") == 0)
{
m = 1;
}
else if(strcmp (month,"February") == 0)
{
m = 2;
}
else if(strcmp (month,"March") == 0)
{
m = 3;
}
else if(strcmp (month,"April") == 0)
{
m = 4;
}
else if(strcmp (month,"May") == 0)
{
m = 5;
}
else if(strcmp (month,"June") == 0)
{
m = 6;
}
else if(strcmp (month,"July") == 0)
{
m = 7;
}
else if(strcmp (month,"August") == 0)
{
m = 8;
}
else if(strcmp (month,"September") == 0)
{
m = 9;
}
else if(strcmp (month,"October") == 0)
{
m = 10;
}
else if(strcmp (month,"November") == 0)
{
m = 11;
}
else if(strcmp (month,"December") == 0)
{
m = 12;
}
return m;
}
//计算月份天数
int jud_month(int year,char month[20])
{
int m = sw_month(month);
int m_day;
if((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))
{
//闰年
switch(m)
{
case 1:
m_day = 0;
break;
case 2:
m_day = 31;
break;
case 3:
m_day = 60;
break;
case 4:
m_day = 91;
break;
case 5:
m_day = 121;
break;
case 6:
m_day = 152;
break;
case 7:
m_day = 182;
break;
case 8:
m_day = 213;
break;
case 9:
m_day = 244;
break;
case 10:
m_day = 274;
break;
case 11:
m_day = 305;
break;
case 12:
m_day = 335;
break;
}
}
else//平年
{
switch(m)
{
case 1:
m_day = 0;
break;
case 2:
m_day = 31;
break;
case 3:
m_day = 59;
break;
case 4:
m_day = 90;
break;
case 5:
m_day = 120;
break;
case 6:
m_day = 151;
break;
case 7:
m_day = 181;
break;
case 8:
m_day = 212;
break;
case 9:
m_day = 243;
break;
case 10:
m_day = 273;
break;
case 11:
m_day = 304;
break;
case 12:
m_day = 334;
break;
}
}
return m_day;
}
//阿拉伯数字转换为星期
char* swit_week(char s[], int weekD)
{
switch(weekD)
{
case 0:
strcpy(s,"Sunday");
break;
case 1:
strcpy(s,"Monday");
break;
case 2:
strcpy(s,"Tuesday");
break;
case 3:
strcpy(s,"Wednesday");
break;
case 4:
strcpy(s,"Thursday");
break;
case 5:
strcpy(s,"Friday");
break;
case 6:
strcpy(s,"Saturday");
break;
}
return s;
}
int main()
{
struct Date date;
while(scanf("%d %s %d", &date.day, date.month, &date.year)!=EOF)
{
int sum_day, y_day, m_day, day;
//分别计算年月日的天数
y_day = jud_year(date.year);
m_day = jud_month(date.year,date.month);
day = date.day;
//总的天数
sum_day = y_day + m_day + day;
int weekD = sum_day % 7; //转换为星期几阿拉伯数字表示其中0代表 Sunday
//阿拉伯数字转换为星期
char s[20];
strcpy(s,swit_week(s,weekD)); //字符串赋值使用不可用char s[20] s = "ancd"
printf("%s\n", s);
}
return 0;
}
//字符串比较不用“== ”用strcmp()
//char s[20] s = "ancd" 错误,使用strcpy()