Calendar Game
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2174 Accepted Submission(s): 1238
A player wins the game when he/she exactly reaches the date of November 4, 2001. If a player moves to a date after November 4, 2001, he/she looses the game.
Write a program that decides whether, given an initial date, Adam, the first mover, has a winning strategy.
For this game, you need to identify leap years, where February has 29 days. In the Gregorian calendar, leap years occur in years exactly divisible by four. So, 1993, 1994, and 1995 are not leap years, while 1992 and 1996 are leap years. Additionally, the years ending with 00 are leap years only if they are divisible by 400. So, 1700, 1800, 1900, 2100, and 2200 are not leap years, while 1600, 2000, and 2400 are leap years.
3 2001 11 3 2001 11 2 2001 10 3
YES NO NO
/* 分析:
设S为输点 Y为赢点
S Y
11 4 11 3
11 2 11 1
10 31 10 30
10 5 10 4
10 1 9 30* 9月30日后只能是10月1日因为没有9月31日
9 29* 9月29日可以到10月29日
9 28 9 27*
9 2 9 1
8 31 8 30
8 1 7 31
7 2 7 1
6 30*
6 29 6 28
6 1 5 31
5 30 5 29
5 2 5 1
4 30*
4 29 4 28
4 3 4 2
4 1 3 31
3 30 3 29
3 2 3 1
2 29* 2 28*
2 27 2 26
2 1 1 31
1 2 1 1
12 31 12 30
12 29 12 28
12 1 11 30
11 29*
11 28 11 27
11 2 11 1
如此分析可得到一个周年的循环,这个周期与年份无关。为什么呢?因为闰年的2 28是一个必胜点 2 29是一个必败点。
观察所有必胜点发现其月与日之和基本为偶数,仅有两个例外。例外的分别是11 30与9 30.这样就可以AC题了!*/
#include <iostream>
using namespace std;
int main()
{
int t,year,month,day;
cin>>t;
while(t--)
{
cin>>year>>month>>day;
if((month+day)%2==0||(day==30&&(month==11||month==9)))
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 1;
}