題目鏈接：
http://acm.nyist.net/JudgeOnline/problem.php?pid=738
描述
Adam and Eve enter this year’s ACM International Collegiate Programming Contest. Last night, they played the Calendar Game, in celebration of this contest. This game consists of the dates from January 1, 1900 to November 4, 2001, the contest day. The game starts by randomly choosing a date from this interval. Then, the players, Adam and Eve, make moves in their turn with Adam moving first: Adam, Eve, Adam, Eve, etc. There is only one rule for moves and it is simple: from a current date, a player in his/her turn can move either to the next calendar date or the same day of the next month. When the next month does not have the same day, the player moves only to the next calendar date. For example, from December 19, 1924, you can move either to December 20, 1924, the next calendar date, or January 19, 1925, the same day of the next month. From January 31 2001, however, you can move only to February 1, 2001, because February 31, 2001 is invalid.
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.
輸入
The input consists of T test cases. The number of test cases (T) is given in the first line of the input. Each test case is written in a line and corresponds to an initial date. The three integers in a line, YYYY MM DD, represent the date of the DD-th day of MM-th month in the year of YYYY. Remember that initial dates are randomly chosen from the interval between January 1, 1900 and November 4, 2001.
輸出
Print exactly one line for each test case. The line should contain the answer “YES” or “NO” to the question of whether Adam has a winning strategy against Eve. Since we have T test cases, your program should output totally T lines of “YES” or “NO”.
樣例輸入
| 3 2001 11 3 2001 11 2 2001 10 3 |
樣例輸出
| YES NO NO |
算法思想：
這道題是一道博弈論的題目，關鍵是如何找到規律，從題目中可以看到，能改變的只能是月份加1或者日期加1，考慮到日期和月份兩者之和的變化只能是從奇數變爲偶數或者偶數變爲奇數，但有兩個日期是特殊的，9月30號和11月30號，因爲它們和可以從奇數變爲奇數，9月30號（39）–>10月1號（11），11月30號（41）–>12月1號（13），故先手要贏就必須從和爲偶數或者這兩個日期中開始，這樣後手選擇的只有和爲奇數的了，故後手不可能選擇到2001 12 04.
但是這道題備NYOJ放在搜索裏，目測深度搜索應該也可以解決，遍歷所有的情況而已，但可能超時。
源代碼
#include <iostream>
using namespace std;
int main()
{
int yy, mm, dd, T;
cin >> T;
while (T--)
{
cin >> yy >> mm >> dd;
if ((mm + dd) % 2 == 0 || (mm == 9 && dd == 30) || (mm == 11 && dd == 30))
{
cout << "YES" << endl;
}
else
cout << "NO" << endl;
}
return 0;
}