HDUOJ-----取(m堆)石子游戏

 1 #include<iostream>
 2 #include<vector>
 3 #include<cstdio>
 4 using namespace std;
 5 int main()
 6 {
 7     int n,m,i,x;
 8     vector<int>arr;
 9     while(scanf("%d",&n),n)
10     {
11          arr.clear();
12        for(x=i=0; i<n; i++)
13        {
14            scanf("%d",&m);
15            x^=m;
16            arr.push_back(m);
17        }
18        if(x)
19        {
20           printf("Yes\n");
21          for(i=0;i<n;i++)
22          {
23              int temp=x^arr[i];
24           if(temp<arr[i])
25               printf("%d %d\n",arr[i],temp);
26          }
27        }
28        else
29            printf("NO\n");
30     }
31     return 0;
32 }