ZOJ 1024 Calendar Game

博弈题，奇偶交替。一般情况只要我们先手（month+day）是偶数的话我们就赢了。当然这只一般情况，上面说了是奇偶交替，但是特殊情况的话比如4-30，6-30，9-30，11-30，非闰年的2-28这五种特殊情况并不是奇偶交替的。所以我们要简单分析一下这些情况。4-30，6-30和2-28这两种情况加一天是5-1，7-1和3-1，加一个月是5-30，7-30和3-28，所以呢？当我们先手是这两天或者轮到我们是这两天时为了赢我们当然是选择加一个月啊，刚好这两天是偶数情况，自然不用考虑单独判断了。剩下就是9-30，11-30，加一天是10-1和12-1是奇数，加一个月是10-30和12-30同样为了赢我们也当然是选择加奇数，在偶数情况获胜，在奇数情况自然就是输了。但这两种情况不是偶数，所以我们应该单独判断。

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. 

Input

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. 

Output

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". 

Sample Input 

3 
2001 11 3 
2001 11 2 
2001 10 3 

Output for the Sample Input

YES 
NO 
NO

#include<stdio.h>
int main()
{
  int n,year,month,day;
  scanf("%d",&n);
  while(n--)
  {
      scanf("%d%d%d",&year,&month,&day);
      if(month==9&&day==30||month==11&&day==30||(month+day)%2==0)   //9-30，11-30，偶数判断，上面写的非常清楚
          printf("YES\n");
      else
          printf("NO\n");
  }
  return 0;
}