CF1174D.Ehab and the Expected XOR Problem

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Given two integers $n$ and $x$ , construct an array that satisfies the following conditions:

for any element $a_i$ in the array, $1 \le a_i<2^n$ ;
there is no non-empty subsegment with bitwise XOR equal to $0$ or $x$ ,
its length $l$ should be maximized.

A sequence $b$ is a subsegment of a sequence $a$ if $b$ can be obtained from $a$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

输入格式

The only line contains two integers $n$ and $x$ ( $1 \le n \le 18$ , $1 \le x<2^{18}$ ).

输出格式

The first line should contain the length of the array $l$ .

If $l$ is positive, the second line should contain $l$ space-separated integers $a_1$ , $a_2$ , $\dots$ , $a_l$ ( $1 \le a_i < 2^n$ ) — the elements of the array $a$ .

If there are multiple solutions, print any of them.

输入输出样例

输入#1
```
3 5
```
输出#1
```
3
6 1 3
```
输入#2
```
2 4
```
输出#2
```
3
1 3 1 
```
输入#3
```
1 1
```
输出#3
```
0
```

说明/提示

In the first example, the bitwise XOR of the subsegments are $\{6,7,4,1,2,3\}$ .

首页