HDU 1079 简单博弈

判断下一步能否到达必胜态，如果可以当前状态就是必败态，否则当前状态记为必胜态

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 using namespace std;
 bool p[][][];
 int month[] = { ,  ,  ,  ,  ,  ,  ,  ,  ,  ,  ,  , };

 struct Date{
     int y , m , d;
     Date(int y= , int m= , int d=):y(y),m(m),d(d){}
 };

 bool run(int y)
 {
     return y% ==  || (y% ==  && y% != );
 }

 bool ok(int y , int m , int d)
 {
     if(run(y)) month[]=;
     bool flag;
     if(d > month[m]) flag = false;
     else flag = true;
     month[] = ;
     return flag;
 }

 Date getLastDay(int y , int m , int d)
 {
     Date tmp;
     tmp.y = y , tmp.m = m , tmp.d =d;
     if(run(y)) month[]=;
     if(d == ){
         if(m == ){
             tmp.y--;
             tmp.d= , tmp.m =;
         }else{
             tmp.m--;
             tmp.d = month[tmp.m];
         }
     }
     else tmp.d--;
     month[] = ;
     return tmp;
 }

 Date get_next_month(int y , int m , int d)
 {
     Date tmp;
     tmp.y = y , tmp.m = m , tmp.d =d;
     if(m == ) tmp.m= , tmp.y+=;
     else tmp.m+=;
     return tmp;
 }

 void init()
 {
     memset(p ,  , sizeof(p));
     p[][][] = true;
     Date cur = Date( ,  , );
     while(){
         Date la = getLastDay(cur.y , cur.m , cur.d);

         Date next_month = get_next_month(la.y , la.m , la.d);
         bool p1 = p[cur.y-][cur.m][cur.d];
         bool p2 = false;

         if(ok(next_month.y , next_month.m , next_month.d))
             p2 = p[next_month.y-][next_month.m][next_month.d];
         if(p1 || p2) p[la.y-][la.m][la.d] = false;
         else p[la.y-][la.m][la.d] = true;

         cur.y = la.y , cur.m = la.m , cur.d = la.d;
         if(cur.y ==  && cur.m ==  && cur.d == ) break;
     }
 }

 int main()
 {
   //  freopen("a.in" , "r" , stdin);
     int T;
     scanf("%d" , &T);
     init();

     while(T--)
     {
         int y , m ,d;
         scanf("%d%d%d" , &y , &m , &d);

         if(p[y-][m][d]) puts("NO");
         else puts("YES");
     }
     return ;
 }