zoukankan      html  css  js  c++  java
  • Coderfroces 862 C. Mahmoud and Ehab and the xor

    C. Mahmoud and Ehab and the xor

    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 .

    n个不同元素的异或值为x,只有一种情况下为NO,n=2,x=0;剩下的都可以找到。

    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <vector>
    #include <queue>
    #include <stack>
    #include <cstdlib>
    #include <iomanip>
    #include <cmath>
    #include <cassert>
    #include <ctime>
    #include <map>
    #include <set>
    using namespace std;
    #pragma comment(linker, "/STACK:1024000000,1024000000")
    #define lowbit(x) (x&(-x))
    #define max(x,y) (x>=y?x:y)
    #define min(x,y) (x<=y?x:y)
    #define MAX 100000000000000000
    #define MOD 1000000007
    #define pi acos(-1.0)
    #define ei exp(1)
    #define PI 3.141592653589793238462
    #define ios() ios::sync_with_stdio(true)
    #define INF 1044266558
    #define mem(a) (memset(a,0,sizeof(a)))
    typedef long long ll;
    int n,x;
    int main()
    {
        scanf("%d%d",&n,&x);
        if(n==1) return 0*printf("YES
    %d
    ",x);
        else if(n==2 && x==0) return 0*printf("NO
    ");
        else if(n==2 && x)return 0*printf("YES 
    0 %d
    ",x);
        printf("YES
    ");
        for(int i=1;i<=n-3;i++)
        {
            printf("%d ",i);
            x^=i;
        }
        printf("%d %d %d
    ",1<<18,1<<19,(1<<18)^(1<<19)^x);
    }
  • 相关阅读:
    linux配置PHP环境!!(云服务器架设)
    JQ上传预览+存数据库
    AJAX做增删改查详细!
    JS解析XML
    UEditor编辑器的使用
    php注释规范
    phpexcel导出数据表格
    简单分析JavaScript中的面向对象
    制作smarty模版缓存文件
    求二叉树中节点的最大距离
  • 原文地址:https://www.cnblogs.com/shinianhuanniyijuhaojiubujian/p/7565579.html
Copyright © 2011-2022 走看看