Calendar POJ - 2080

最新推荐文章于 2024-04-26 19:03:27 发布

Focus5679

最新推荐文章于 2024-04-26 19:03:27 发布

阅读量166

点赞数

分类专栏：未分类

本文链接：https://blog.csdn.net/qq_40758751/article/details/80290890

版权

未分类专栏收录该内容

56 篇文章 0 订阅

订阅专栏

Calendar

POJ - 2080

A calendar is a system for measuring time, from hours and minutes, to months and days, and finally to years and centuries. The terms of hour, day, month, year and century are all units of time measurements of a calender system.
According to the Gregorian calendar, which is the civil calendar in use today, years evenly divisible by 4 are leap years, with the exception of centurial years that are not evenly divisible by 400. Therefore, the years 1700, 1800, 1900 and 2100 are not leap years, but 1600, 2000, and 2400 are leap years.
Given the number of days that have elapsed since January 1, 2000 A.D, your mission is to find the date and the day of the week.

Input

The input consists of lines each containing a positive integer, which is the number of days that have elapsed since January 1, 2000 A.D. The last line contains an integer −1, which should not be processed.
You may assume that the resulting date won’t be after the year 9999.

Output

For each test case, output one line containing the date and the day of the week in the format of "YYYY-MM-DD DayOfWeek", where "DayOfWeek" must be one of "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday" and "Saturday".

Sample Input

Sample Output

2004-09-26 Sunday
2004-10-06 Wednesday
2004-10-16 Saturday
2004-10-17 Sunday

题解：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
int year[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
int ryear[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
char d[7][10] = { "Friday" , "Saturday" , "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday" };
bool judge(int n)
{
    if(n%100==0)
    {
        if(n%400==0)
            return 1;
        return 0;
    }
    else
    {
        if(n%4==0)
            return 1;
        return 0;
    }
}
int main()
{
    int t;
    while(~scanf("%d", &t) && t != -1)
    {
        t++;
        int day = t%7;
        int c = 2000;
        int cnt = 0;
        while(t>366)
        {
            if(judge(c))
            {
                t-=366;
                c++;
                cnt++;
            }
            else
            {
                t-=365;
                c++;
                cnt++;
            }
        }
        if(judge(c))
        {
            int i;
            for(i = 0; t > ryear[i]; i++)
            {
                t-=ryear[i];
            }
            printf("%d-%02d-%02d %s\n", 2000+cnt, i+1, t, d[day]);
        }
        else
        {
            if(t>365)
            {
                t-=365;
                cnt++;
            }
            int i;
            for(i = 0; t > year[i]; i++)
            {
                t-=year[i];
            }
            printf("%d-%02d-%02d %s\n", 2000+cnt, i+1, t, d[day]);
        }

    }


    return 0;
}