zoukankan      html  css  js  c++  java
  • POJ 2080:Calendar

    Calendar
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 12546   Accepted: 4547

    Description

    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

    1730
    1740
    1750
    1751
    -1

    Sample Output

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

    你  离  开  了  ,  我  的  世  界  里  只  剩  下  雨  。  。  。

    #include <stdio.h>
    #include<string.h>
    #include<math.h>
    char week[7][10]= {"Saturday","Sunday","Monday","Tuesday","Wednesday","Thursday","Friday"};
    int year[2]= {365,366};
    int month[2][12]= {31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31};
    int type(int m)
    {
        if(m%4!=0||(m%100==0&&m%400!=0))
            return 0;
        else return 1;
    }
    int main()
    {
        int days,dayofweek;
        int i=0,j=0;
        while(scanf("%d",&days)!=EOF&&days!=-1)
        {
            dayofweek=days%7;
            for(i=2000; days>=year[type(i)]; i++)
                days-=year[type(i)];
            for(j=0; days>=month[type(i)][j]; j++)
                days-=month[type(i)][j];
            printf("%d-%02d-%02d %s
    ",i,j+1,days+1,week[dayofweek]);
        }
        return 0;
    }


  • 相关阅读:
    东北育才 第1天
    东北育才 第0天
    BZOJ 3894 文理分科
    BZOJ 1001 [BeiJing2006]狼抓兔子
    POJ 2785 4 Values whose Sum is 0(暴力枚举的优化策略)
    UVA 1605 Building for UN(思维)
    统计频率(map映照容器的使用)
    POJ 1007 DNA Sorting(sort函数的使用)
    POJ 1002 487-3279(map映照容器的使用)
    BFS算法(——模板习题与总结)
  • 原文地址:https://www.cnblogs.com/im0qianqian/p/5989586.html
Copyright © 2011-2022 走看看