算法笔记3.4B： Day of Week_gregorian style of dating in russia-CSDN博客

本文链接：https://blog.csdn.net/jinghaize/article/details/114537274

本文介绍如何编写一个程序，根据Gregorian历法计算给定日期（包括公元1000至3000年）最近的过去或未来的星期几。涉及闰年判断和日期累加计算。

摘要生成于 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 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

代码

#include<cstdio>
#include<cstring>

int month[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}};         //分别存入闰年平年两种情况

char yue[13][20] = {" ","January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};

char week[8][20] = {" ", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"};

int isleap(int year){
    return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
}

int main(){
    int day, year;
    char m[20];     //存储测试日期的月份
    int total;      //累加总天数
    int j;
    int ans;        //记录输入的日期对应星期中的第几天
    while(scanf("%d %s %d", &day, m, &year) != EOF){
        total = 0;
        for(int i = 1; i <= year - 1; i++){         //分成两个部分，第一先将前面年份的天数累加
            total += 365 + isleap(i);
        }
        for(int k = 1; k <= 12; k++){               
            if(strcmp(yue[k], m) == 0){
                j = k;
                break;
            }
        }
        for(int m = 1; m < j  ; m++){               //第二将当年的月份的天数加上
            total += month[m][isleap(year)];
        }
        total += day;
        ans = total % 7;
        if(ans == 0)			//整除则为周日 
			printf("%s\n", week[7]); 
        else
			printf("%s\n", week[ans]);
    }
    return 0;
}