B - Calendar POJ - 2080 （历法）

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

正牌东风

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

阅读量335

点赞数

分类专栏：历法算法小结文章标签：历法

本文链接：https://blog.csdn.net/clz16251102113/article/details/83315454

版权

算法小结同时被 2 个专栏收录

67 篇文章 0 订阅

订阅专栏

历法

2 篇文章 0 订阅

订阅专栏

B - 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

给定一个正整数n,求从January 1, 2000 公元，开始经过n天的具体年份，月份，日，和星期数，例如n=1,时，输出

2000-01-02 Sunday.

#include<cstdio>
#include<stack>
#include<set>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<iostream>
#include<cmath>
using namespace std;
#define inf 0x3f3f3f3f
typedef long long ll;
const int N=110;
const int nmax = 60200;
const double esp = 1e-9;
const double PI=3.1415926;
char a[7][13]={"Saturday","Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday" };
int judge(int y){
if((y%4==0&&y%100!=0)||y%400==0)
      return 366;
return 365;
}
int num_month(int ans,int mon){
if(mon==2){
      return ans==366?29:28;
}
if(mon==2||mon==4||mon==6||mon==9||mon==11)
      return 30;
return 31;
}
int main()
{
    int n,y,m,w;
    while(scanf("%d",&n)!=EOF){
      if(n==-1)
            break;
      int sum=0,ans;
      w=n%7;
      for(int i=2000;i<10000;i++){
            ans=judge(i);
            if(sum+ans<=n){
                  sum+=ans;
                  continue;
            }
            else{
                 y=i;
                 n-=sum-1;  //此时的n为该年的第n天
                 m=1;
                 int num=num_month(ans,m);
                 while(n>num){
                  n-=num;
                  m++;
                  num=num_month(ans,m);
                 }
                 break;
            }
      }
      printf("%d-%02d-%02d %s\n",y,m,n,a[w]);
    }
    return 0;
}