问题描述
已知2011年11月11日是星期五，问YYYY年MM月DD日是星期几？注意考虑闰年的情况。尤其是逢百年不闰，逢400年闰的情况。
输入格式
输入只有一行
YYYY MM DD
输出格式
输出只有一行
W
数据规模和约定
1599 <= YYYY <= 2999
1 <= MM <= 12
1 <= DD <= 31，且确保测试样例中YYYY年MM月DD日是一个合理日期
1 <= W <= 7，分别代表周一到周日
样例输入
2011 11 11
样例输出
5
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 |
#include <iostream> using namespace std; int isleapyear(int year); int days(int year, int month, int day); int distance(int year, int month, int day); int main() { int year, month, day; cin >> year >> month >> day; int distance1 = distance(year, month, day); if (year >= 2012) { switch(distance1) { case 0: cout << 6; break; case 1: cout << 7; break; case 2: cout << 1; break; case 3: cout << 2; break; case 4: cout << 3; break; case 5: cout << 4; break; case 6: cout << 5; break; } } else { switch(distance1) { case 0: cout << 6; break; case 1: cout << 5; break; case 2: cout << 4; break; case 3: cout << 3; break; case 4: cout << 2; break; case 5: cout << 1; break; case 6: cout << 7; break; } } return 0; } int isleapyear(int year) { if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0) return 1; else return 0; } int days(int year, int month, int day) { int sum = 0; if (month <= 2) { if (month == 1) sum = day; else sum = 31 + day; } else { switch(month) { case 3: sum = 59 + day; break; case 4: sum = 90 + day; break; case 5: sum = 120 + day; break; case 6: sum = 151 + day; break; case 7: sum = 181 + day; break; case 8: sum = 212 + day; break; case 9: sum = 243 + day; break; case 10: sum = 273 + day; break; case 11: sum = 304 + day; break; case 12: sum = 334 + day; break; } if(isleapyear(year) == 1) { sum = sum + 1; } } return sum; } int distance(int year, int month, int day) { int count = 0; int distance1 = 0; if(year >=2012) { distance1 = 365 * (year - 2012) + days(year, month, day); for (int i = 2012; i < year; i++) { if(isleapyear(i) == 1) count++; } distance1 = distance1 + count; } else { distance1 = 365 * (2011 - year) + 365 - days(year, month, day); if (isleapyear(year) == 1) distance1 = distance1 + 1; for (int i = year + 1; i <= 2011; i++) { if(isleapyear(i) == 1) count++; } distance1 = distance1 + count; } distance1 = distance1 % 7; return distance1; } |
❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼
❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼
❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版
