1162: 6003 星期几？

最新推荐文章于 2024-07-12 18:02:43 发布

Thoudam

最新推荐文章于 2024-07-12 18:02:43 发布

阅读量25

点赞数

文章标签：算法 c++

本文链接：https://blog.csdn.net/Thoudam/article/details/130564970

版权

#include <iostream>
#include <string>
using namespace std;

int month[] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };//month[1]是一月
int month_leap[] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };
int monthSum[] = { 0,31,59,90,120,151,181,212,243,273,304,334,365 };//monthSum[2]是包括二月之前的所有日子之和
int monthSum_leap[] = { 0,31,60,91,121,152,182,213,244,274,305,335,366 };
string week1[] = { "Saturday","Sunday","Monday","Tuesday","Wednesday","Thursday","Friday" };
string week2[] = { "Saturday","Friday","Thursday","Wednesday","Tuesday","Monday","Sunday" };

bool isleap(int year)
{
    if (year % 400 == 0)return true;
    if (year % 100 == 0)return false;
    if (year % 4 == 0)return true;
    return false;
}
int calDays(int year1, int month1, int day1, int year2, int month2, int day2,int& flag)
{
    flag = 0;
    //使得 2 > 1
    int ans = 0;
    if (year1 > year2 || (year1 == year2 && month1 > month2) || (year1 == year2 && month1 == month2 && day1 > day2))
    {
        //swap();
        int tempY = year1;
        int tempM = month1;
        int tempD = day1;
        year1 = year2;
        month1 = month2;
        day1 = day2;
        year2 = tempY;
        month2 = tempM;
        day2 = tempD;
        flag = 1;
    }

    //对year 进行ans+;  2019 05 15   2020 02 11  
    for (int i = year1 + 1;i < year2;i++)
    {
        if (isleap(i))
        {
            ans += 366;
        }
        else ans += 365;
    }

    //对year1 year2 month day 计算ans;
    //2 23   5 12
    if (year1 != year2)
    {
        if (isleap(year1))
        {
            ans += (366 - monthSum_leap[month1 - 1] - day1);
        }
        else
        {
            ans += (365 - monthSum[month1 - 1] - day1);
        }
        if (isleap(year2))
        {
            ans += (monthSum_leap[month2 - 1] + day2);
        }
        else
        {
            ans += (monthSum[month2 - 1] + day2);
        }
    }
    else
    {
        if (month1 != month2)
        {
            if (isleap(year1))
            {
                for (int i = month1 + 1;i < month2;i++)
                {
                    ans += month_leap[i];
                }
                ans += month_leap[month1] - day1 + day2;
            }
            else
            {
                for (int i = month1 + 1;i < month2;i++)
                {
                    ans += month[i];
                }
                ans += month[month1] - day1 + day2;
            }
        }
        else
        {
            ans += day2 - day1;
        }
    }
    return ans;
}

void _6003_()
{
    int year, month, day;
    while (scanf("%d%d%d", &year, &month, &day) != EOF)
    {
        if (year <= 0 || year >= 10000 || month < 1 || month > 12 || day < 1 || day > 31)cout << "illegal" << endl;
        else
        {
            int flag = 0;
            int count = calDays(2007, 11, 17, year, month, day, flag);
            int ans = count % 7;
            if (!flag)
            {
                cout << week1[ans] << endl;
            }
            else
            {
                cout << week2[ans] << endl;
            }
        }
    }
}

int main()
{
    _6003_();
    return 0;
}