POJ2080_Calendar(模拟)

2019-04-14 15:49发布

Calendar Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 11007   Accepted: 4068 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 Source


解题报告 本来就是水题,模拟模拟就过了,谁知懂判断闰年错误。。。 #include #include #include #include using namespace std; int is_(int x) { if(x%400==0||x%100!=0&&x%4==0)return 1; return 0; } char w[][10]= {"Saturday","Sunday","Monday","Tuesday","Wednesday","Thursday","Friday"}; int main() { int i,n; int sum=0; while(cin>>n) { if(n==-1)break; int monday[]= {0,31,28,31,30,31,30,31,31,30,31,30,31}; sum=0; int year,mon,day; for(i=2000; ; i++) { if(sum+(is_(i)?366:365)>=n) break; else sum+=is_(i)?366:365; } year=i; monday[2]+=is_(year)?1:0; for(i=1; i<=12; i++) { if(sum+monday[i]>=n) break; else sum+=monday[i]; } mon=i; day=n-sum+1; if(day>monday[mon]) { day=1; mon++; if(mon>12) { mon=1; year++; } } cout<=10?"":"0")<=10?"":"0")<