【九度】题目1043：Day of Week

最新推荐文章于 2020-09-26 17:51:41 发布

原创最新推荐文章于 2020-09-26 17:51:41 发布 · 772 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个程序，用于计算给定日期对应的星期几。程序使用格里高利历规则，考虑闰年因素，接收特定格式的日期输入，并输出对应的星期名称。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：7370

解决：2572

题目描述：

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.

样例输入：

9 October 2001
14 October 2001

样例输出：

Tuesday
Sunday

// ConsoleApplication5.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <string.h>
#define ISYEAR(x)  x%100!=0&&x%4==0|| x%400==0?1:0
int dayOfMonth[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,
};

struct Date  
{int Day;  
int Month;  
int Year;  
void nextDay(){  
    Day++;  
    if (Day>dayOfMonth[Month][ISYEAR(Year)])  
    {  
        Day=1;Month++;  
    if(Month>12){  
        Month=1;  
        Year++;  
    }  
    }  
}  
};

int buf[3001][13][32];
char monthname[13][20]={
	"",
	"January",
	"February",
	"March",
	"April",
	"May",
	"June",
	"July",
	"August",
	"September",
	"October",
	"November",
	"December"
};
char week[7][20]={
	"Sunday",
	"Monday",
	"Tuesday",
	"Wednesdy",
	"Thursday",
	"Friday",
	"Saturday"
};

int _tmain()
{
	Date tmp;
	int cnt=0;
	tmp.Day=1;
	tmp.Month=1;
	tmp.Year=0;
	while (tmp.Year!=3001)
	{
		buf[tmp.Year][tmp.Month][tmp.Day]=cnt;
	     tmp.nextDay();
	     cnt++;
	}//将所有日期的与原点的差值保存在三维数组里。这里是哈希的思想。
	int y,m,d;
	char s[20];
	while (scanf("%d %s %d",&d,s,&y)!=EOF)
	{
		for(m=1;m<=12;m++) {
	if(strcmp(s,monthname[m])==0){
		break;} //名称与下标的转换 strcmp
	}
	int days=buf[y][m][d]-buf[2017][1][7];
	days+=6;//选定某一天的日期，计算两者之差，加上该天的星期下标，星期天为0，再对7取余。
	puts(week[(days%7+7)%7]);//有可能为负数，这种形式保证为正数。
	}
	return 0;
}