day of week

最新推荐文章于 2023-02-08 17:23:36 发布

小白算法习题记录本

最新推荐文章于 2023-02-08 17:23:36 发布

阅读量180

点赞数

本文链接：https://blog.csdn.net/qq_43661234/article/details/104066212

版权

在这里插入图片描述
```c

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int IsLeapYear(int year)
{
if(year%40&&year%100!=0||year%4000) return 1;
else return 0;
}

int main()
{
int D[2][13]={
{0,31,59,90,120,151,181,212,243,273,304,334,365},
{0,31,60,91,121,152,182,213,244,274,305,335,366}
};

char week[7][20]={"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
char month[13][20]={"","January","February","March","April","May","June","July","August","September",
                "October","November","December"};
                
int y,m,d,days,tag; char m1[20];
while(scanf("%d%s%d",&d,m1,&y)!=EOF)
{
    for(m=1;m<=12;m++) 
		if(strcmp(m1,month[m])==0)
			break;
    
   // printf("month=%d\n", m); 
    days=0;
    
    for(int i=1;i<y;i++)//计算从0001年年初到y-1年年末 的总天数
    {
        if(IsLeapYear(i)) tag=1;
        else tag=0;
        
        if(tag==1) days+=366;
        else days+=365;
    }
    
    //开始计算第y年所经历的总天数 
    if(IsLeapYear(y)) tag=1;
    else tag=0;
    
    if(m>1) days+=D[tag][m-1]; 
    days+=d;
    
    printf("%s\n", week[days%7]);
   // printf("days=%d\n", days);
}
return 0;

}