HDU 2176 (Nim博弈 先手取胜方案) 取(m堆)石子游戏

切切水题，放松心情:-D

 #include <cstdio>

 const int maxn =  + ;
 int a[maxn];

 int main()
 {
     //freopen("in.txt", "r", stdin);

     int m;
     while(scanf("%d", &m) ==  && m)
     {
         int s = ;
         for(int i = ; i < m; i++) { scanf("%d", &a[i]); s ^= a[i]; }
         if(!s) { puts("No"); continue; }
         puts("Yes");
         int k = -;
         int t = s;
         while(s) { s >>= ; k++; }
         for(int i = ; i < m; i++) if(a[i] & ( << k)) printf("%d %d\n", a[i], a[i] ^ t);
     }

     return ;
 }

代码君