CF 862 C. Mahmoud and Ehab and the xor【异或】

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Mahmoud and Ehab are on the third stage of their adventures now. As you know, Dr. Evil likes sets. This time he won’t show them any set from his large collection, but will ask them to create a new set to replenish his beautiful collection of sets.

Dr. Evil has his favorite evil integer x. He asks Mahmoud and Ehab to find a set of n distinct non-negative integers such the bitwise-xor sum of the integers in it is exactly x. Dr. Evil doesn’t like big numbers, so any number in the set shouldn’t be greater than 106.

Input
The only line contains two integers n and x (1 ≤ n ≤ 105, 0 ≤ x ≤ 105) — the number of elements in the set and the desired bitwise-xor, respectively.

Output
If there is no such set, print “NO” (without quotes).

Otherwise, on the first line print “YES” (without quotes) and on the second line print n distinct integers, denoting the elements in the set is any order. If there are multiple solutions you can print any of them.

Examples
input
5 5
output
YES
1 2 4 5 7
input
3 6
output
YES
1 2 5
Note
You can read more about the bitwise-xor operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR

For the first sample .

For the second sample .

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int pw1 = (1 << 17);
const int pw2 = (1 << 18);
int main()
{
    int n, x;
    cin >> n >> x;
    if (n == 1)
    {
        cout << "Yes" << endl << x << endl;
    }
    else if (n == 2 && x == 0)
    {
        cout << "NO" << endl;
    }
    else if (n == 2)
    {
        cout << "YES" << endl << "0 " << x << endl;
    }
    else
    {
        int i;
        int ans = 0;
        cout << "YES" << endl;
        for (int i = 1; i <= n - 3; i++)
        {
            cout << i << " ";
            ans ^= i;
        }
        if (ans == x)
            cout << pw1 + pw2 << " " << pw1 << " " << pw2 << endl;
        else
            cout << pw1 << " " << ((pw1^x) ^ ans) << " 0" << endl;
    }
    return 0;
}