Calendar

Calendar

时间: 1ms        内存:64M

描述:

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't be after the year 9999.

输出:

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

提示:

参考答案(内存最优[752]):

#include <stdio.h>   
int ly(int m)   
{   
    if(m%400==0||(m%4==0 && m%100!=0))   
        return 1;   
    else  
        return 0;   
}   
  
int main()   
{   
    int N,I,i,j,week;   
    int year[2]={365,366};   
    int month[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}};   
    scanf("%d",&N);   
    while(N!=-1)   
    {   
        week=(N+6)%7;   
        I=2000;   
        j=ly(I);   
        N += 1;   
        while(N>year[j])   
        {   
            N -= year[j];   
            I++;   
            j=ly(I);   
        }   
           
        for(i=1;i<13;i++)   
        {   
            if(month[j][i]>=N)   
            {   
                N-=month[j][i-1];   
                break;   
            }   
        }   
        printf("%d-",I);   
        if(i<10)   
            printf("0%d-",i);   
        else  
            printf("%d-",i);   
        if(N<10)   
            printf("0%d",N);   
        else  
            printf("%d",N); 
        switch (week)   
        {   
        case 0:printf(" Sunday\n");break;   
        case 1:printf(" Monday\n");break;   
        case 2:printf(" Tuesday\n");break;   
        case 3:printf(" Wednesday\n");break;   
        case 4:printf(" Thursday\n");break;   
        case 5:printf(" Friday\n");break;   
        case 6:printf(" Saturday\n");break;   
        }   
        scanf("%d",&N);  
    }    
    return 0;   
}

参考答案(时间最优[0]):

#include <stdio.h>   
int ly(int m)   
{   
    if(m%400==0||(m%4==0 && m%100!=0))   
        return 1;   
    else  
        return 0;   
}   
  
int main()   
{   
    int N,I,i,j,week;   
    int year[2]={365,366};   
    int month[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}};   
    scanf("%d",&N);   
    while(N!=-1)   
    {   
        week=(N+6)%7;   
        I=2000;   
        j=ly(I);   
        N += 1;   
        while(N>year[j])   
        {   
            N -= year[j];   
            I++;   
            j=ly(I);   
        }   
           
        for(i=1;i<13;i++)   
        {   
            if(month[j][i]>=N)   
            {   
                N-=month[j][i-1];   
                break;   
            }   
        }   
        printf("%d-",I);   
        if(i<10)   
            printf("0%d-",i);   
        else  
            printf("%d-",i);   
        if(N<10)   
            printf("0%d",N);   
        else  
            printf("%d",N); 
        switch (week)   
        {   
        case 0:printf(" Sunday\n");break;   
        case 1:printf(" Monday\n");break;   
        case 2:printf(" Tuesday\n");break;   
        case 3:printf(" Wednesday\n");break;   
        case 4:printf(" Thursday\n");break;   
        case 5:printf(" Friday\n");break;   
        case 6:printf(" Saturday\n");break;   
        }   
        scanf("%d",&N);  
    }    
    return 0;   
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注