CF 862 C. Mahmoud and Ehab and the xor【异或】
来源:互联网 发布:accorpus数据库 编辑:程序博客网 时间:2024/06/16 12:51
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;}
- CF 862 C. Mahmoud and Ehab and the xor【异或】
- CF 862C Mahmoud and Ehab and the xor 构造
- CF C. Mahmoud and Ehab and the xor
- cf 862C Mahmoud and Ehab and the xor 思维+构造
- Codeforces 862C. Mahmoud and Ehab and the xor
- Codeforces 862C Mahmoud and Ehab and the xor
- codeforce 862C Mahmoud and Ehab and the xor(构造)
- Codeforces Round #435 (Div. 2)C. Mahmoud and Ehab and the xor(异或的性质)
- 862C C. Mahmoud and Ehab and the xor XOR操作/构造
- 862C C. Mahmoud and Ehab and the xor XOR操作/构造
- Mahmoud and Ehab and the xor CodeForces
- Mahmoud and Ehab and the xor CodeForces
- Codeforces Round #435 (Div. 2)-Mahmoud and Ehab and the xor(异或)
- Codeforces Round #435 (Div. 2)-异或规律&思维-Mahmoud and Ehab and the xor
- Codeforces 862 C. Mahmoud and Ehab and the xor (技巧)
- CF 862A. Mahmoud and Ehab and the MEX
- Codeforces Round #435 (Div. 2) C. Mahmoud and Ehab and the xor(xor运算应用)
- Codeforces862C. Mahmoud and Ehab and the xor 【构造】
- Java-反射(学习笔记)
- CF 863.B Mahmoud and Ehab and the bipartiteness【DFS】
- [bzoj2709][Violet 1]迷宫花园(二分+spfa)
- CSS基础(三)--清除浮动的影响
- bzoj 1830: [AHOI2008]Y型项链 贪心
- CF 862 C. Mahmoud and Ehab and the xor【异或】
- 静态成员变量和静态成员函数在C++类中的作用
- LeetCode上面一道算法题目:79. Word Search
- 数据库
- centos7.3+ mysql5.6 + mysqludf安装
- BZOJ4345: [POI2016]Korale
- jenkins的安装配置,插件配置,安装插件,配置maven,jdk路径,配置安装插件,项目配置,自动构建配置
- [tyvj1313]烽火传递(单调队列dp)
- Android Studio 超级简单的打包生成apk