BZOJ1228 [SDOI2009]E&D

蒟蒻不会= =

话说写题解的巨巨也只会打表233

反正先A掉再说

 /**************************************************************
     Problem: 1228
     User: rausen
     Language: C++
     Result: Accepted
     Time:184 ms
     Memory:804 kb
 ****************************************************************/

 #include <cstdio>

 using namespace std;

 int n, SG;

 inline int read() {
     int x = ;
     char ch = getchar();
     while (ch < '' || '' < ch)
         ch = getchar();
     while ('' <= ch && ch <= '') {
         x = x *  + ch - '';
         ch = getchar();
     }
     return x;
 }

 inline int work(int x, int y) {
     int t =  << , i, res = ;
     for (i = ; i; --i, t >>= )
         if (x <= t && y <= t) res = i;
         else {
             x -= x > t ? t : ;
             y -= y > t ? t : ;
         }
     return x ==  && y ==  ?  : res;
 }

 int main() {
     int T = read(), i, x, y;
     while (T--) {
         n = read(), SG = ;
         for (i = , n >>= ; i <= n; ++i) {
             x = read(), y = read();
             SG ^= work(x, y);
         }
         if (SG) puts("YES");
         else puts("NO");
     }
     return ;
 }