HDU 1079 Calendar Game Game

Calendar Game Time limit:5000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 3121 Accepted Submission (s): 1830


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, and 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's simple:from a current date, a player in his/her turn can move either to the NE XT Calendar date or the same day of the next month. When the next month does not has the same day, the player moves is only to the next calendar date. For example, from December, 1924, your can move either to December, 1924, the next calendar date, or January 19, 1925 , the same day of the next month. From January-2001, however, you can move only to February 1, 2001, because February, 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 This decides whether, given an initial date, Adam, the first mover, have a winning strategy.

For the This game, you need to identify leap years, where February have. In the Gregorian calendar, leap years occur in years exactly divisible by four. So, 1993, 1994, and 1995 is not a leap years, while 1992 and 1996 is leap years. Additionally, the years ending with XX is leap years only if they is divisible by 400. So, 1700, 1800, 1900, 2100, and 2200 is not a leap years, while, and 2400 is leap years.

Input the input consists of T test cases. The number of test cases (T) is given on the first line of the input. Each test case was 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 is 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 had 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
Source Asia 2001, Taejon (South Korea)

Push backwards from the terminating state

#include <iostream> #include <cstring> #include <algorithm> #include <cstdio> using namespace
Std
int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int dp[110][13][33];
    void init () {int yy=2001,mm=11,dd=3;
    for (int i = 1;i <= 31;i++) dp[2001-1900][12][i]=1;
    for (int i = 5;i <= 31;i++) dp[2001-1900][11][i]=1;
    int be = dp[2001-1900][11][4] = 0;
    int ans;
    int yy1,mm1,dd1,up;
        while (yy>=1900) {ans = is;
        YY1=YY,MM1=MM+1,DD1=DD;
        if (mm1==13) {yy1++,mm1=1; } if (mm1==2&& (yy1%400==0| | (yy1%100!=0&&yy1%4==0)))
        up=29;
        else up = month[mm1];
        if (up>=dd1) ans = ans&dp[yy1-1900][mm1][dd1];
        be = dp[yy-1900][mm][dd] = ans^1;
        dd--;
            if (dd = = 0) {mm--;
            if (mm==0) {yy--, mm=12;
            } DD = month[mm]; if (yy%400==0| | (yy%100!=0&&yy%4==0))
        dd=29; }}} intMain () {init ();
    int t;
    scanf ("%d", &t);
        while (t--) {int yy,dd,mm;
        scanf ("%d%d%d", &AMP;YY,&AMP;MM,&AMP;DD);
        if (dp[yy-1900][mm][dd] = = 1) printf ("yes\n");
    else printf ("no\n");

} return 0; }