Codeup墓地 Contest100000578 问题 B:Day of Week

本文介绍了一个程序,用于计算给定日期(1000年至3000年范围内)在最近过去的某一天或未来某一天对应的星期几。程序使用了基姆拉尔森公式,能够处理闰年计算,特别指出2004年、2180年和2400年是闰年,而2005年、2181年和2300年不是。输入包括天数、月份名称和年份,输出为对应日期的星期名称。

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

题目描述

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.

样例输入

21 December 2012
5 January 2013

样例输出

Friday
Saturday

代码

首先要夸一夸基姆拉尔森公式,然后继续夸一夸基姆拉尔森公式

#include<cstdio>
#include<cstring>
//W= (d+2*m+3*(m+1)/5+y+y/4-y/100+y/400) mod 7
char Month[12][10]={"January","February","March","April","May","June","July","August","September","October","November","December"};
char Week[7][10]={"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
int main(){
	int year,month,day,w;
	char str_month[10];
	while(scanf("%d %s %d",&day,str_month,&year)!=EOF){
		for(int i=0;i<12;++i){
			if(!strcmp(Month[i],str_month)){
				month=i+1;
				break;
			}
		}//18 February 2019
		if(month==1||month==2){
			month+=12;
			--year;
		}
		w=(day+2*month+3*(month+1)/5+year+year/4-year/100+year/400)%7;
		printf("%s\n",Week[w]);
	}
	return 0;
}

在这里插入图片描述

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值