Day of Week

最新推荐文章于 2023-03-21 18:59:29 发布

原创最新推荐文章于 2023-03-21 18:59:29 发布 · 111 阅读

0 ·

CC 4.0 BY-SA版权

算法笔记同时被 2 个专栏收录

13 篇文章

订阅专栏

日期处理

2 篇文章

订阅专栏

在这里插入图片描述

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const double pi=acos(-1.0);
const double eps=1e-8;
const int maxn=100005;
int days[2][13]= {{0,31,28,31,30,31,30,31,31,30,31,30,31},{0,31,29,31,30,31,30,31,31,30,31,30,31}};
char q[13][13]={"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
bool check(int y)
{
    if(y%400==0||y%100!=0&&y%4==0)
    {
        return 1;
    }
    return 0;
}
int get_sum(int y,int m,int d)
{
    int ans=0;
    if(check(y))
    {
        for(int i=1; i<m; i++)
        {
            ans+=days[1][i];
        }
    }
    else
    {
        for(int i=1; i<m; i++)
        {
            ans+=days[0][i];
        }
    }
    ans+=d;
    return ans;
}
int main()
{
    int x,y;
     int d2,y2,m2;
     while(~scanf("%d",&d2))
     {
          string s;

     cin>>s;
     cin>>y2;
     if(s=="January") m2=1;
     else if(s=="February") m2=2;
     else if(s=="March") m2=3;
     else if(s=="April") m2=4;
     else if(s=="May") m2=5;
     else if(s=="June") m2=6;
     else if(s=="July") m2=7;
     else if(s=="August") m2=8;
     else if(s=="September") m2=9;
     else if(s=="October") m2=10;
     else if(s=="November") m2=11;
     else if(s=="December") m2=12;
//    printf("%04d %02d %02d\n",y2,m2,d2);
       int  y1=1;
        int  m1=1;
        int  d1=1;

        int sum1=get_sum(y1,m1,d1);
        int sum2=get_sum(y2,m2,d2);
        int ans=0;
        if(y1==y2)
        {
            ans=abs(sum1-sum2)+1;
        }
        else
        {
            if(y2<y1)
            {
                if(check(y2))
                {
                    ans+=366-sum2+1;
                    y2++;
                }
                else
                {
                    ans+=365-sum2+1;
                    y2++;
                }
                while(y1!=y2)
                {
                    if(check(y2))
                    {
                        ans+=366;
                    }
                    else ans+=365;
                    y2++;

                }
                ans+=sum1;
            }
            else
            {
                if(check(y1))
                {
                    ans+=366-sum1+1;
                    y1++;
                }
                else
                {
                    ans+=365-sum1+1;
                    y1++;
                }
                while(y1!=y2)
                {
                    if(check(y1))
                    {
                        ans+=366;
                    }
                    else ans+=365;
                    y1++;

                }
                ans+=sum2;
            }
        }
        if(ans%7==0)
        {
            printf("Sunday\n");
        }
        else printf("%s\n", q[ans%7 -1]);
     }

    return 0;
}