HDU 1079-Calendar Game

Calendar Game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4724    Accepted Submission(s): 2879

题目链接：点击打开链接

Problem Description

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 
 


Sample Output
YES 
NO 
NO 

题意：

题意是说Adam和 Eve玩日历游戏，在1990年的1月1号到2001年的11月4号之间随机出一个日期，两人轮流移动日期，要求只能往此日期的下一天移动或者下个月的这一天移动（如果下个月没有这一天，则不能移动）如果谁先移动到2001年的11月4号，谁就获胜。

分析：

题意很简单，一看就知道是博弈，博弈论题目可以用寻找必败状态的方法解决。本题为找规律类型的博弈，根据奇偶性的变化找到规律，特殊情况特殊考虑，看了大神的推理，总结出本题的规律是，月与天的和为偶数的天状态为必胜，为奇数的天状态为必败。特殊情况为09.30和11.30，这两天的状态也为必胜。

#include <iostream>
#include<stdio.h>
#include<cmath>
using namespace std;

int main()
{
    int year,mouth,day,n;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d %d %d",&year,&mouth,&day);
        if((mouth+day)%2==0||(mouth==9&&day==30)||(mouth==11&&day==30))
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}