Hdu 2176 取(m堆)石子游戏

#include <iostream>
#include <vector>
#include <cstdio>

using namespace std;

int main()
{
    vector <int> stone;
    vector <int> :: iterator it;
    int n;
    int i;
    int allXor,oneXor;
    int in;
    while( scanf("%d",&n)!=EOF && n )
    {
        stone.clear();
        allXor = 0;   // initial
        for( i=0;i<n;i++ )
        {
            scanf("%d", &in);
            stone.push_back(in);
            allXor ^= in;
        }

        if( allXor )   // judge
        {
            printf("Yes\n");
            for( it=stone.begin();it!=stone.end();it++ )
            {
                oneXor = allXor ^ *it;
                /*for( i=0;i<*it;i++ )
                {
                    if( (oneXor^i) == 0 )
                    {
                        printf("%d %d\n", *it,i);
                        break;
                    }
                }*/   // time limit exceeded
                if( oneXor < *it )
                {
                    printf("%d %d\n", *it, oneXor);
                }
            }
        }
        else
        {
            printf("No\n");
        }
    }
    return 0;
}