A calendar is a system for measuring time, from hours and minutes, to months and days, and finally

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.

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.

输入格式
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

输出格式
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”.

样例输入
1730
1740
1750
1751
-1
样例输出
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 pyear[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)
{
   return((n%4==0&&n%100!=0)||(n%400==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;
}
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值