CF665E.Beautiful Subarrays

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

One day, ZS the Coder wrote down an array of integers $a$ with elements $a_{1},a_{2},...,a_{n}$ .

A subarray of the array $a$ is a sequence $a_{l},a_{l+1},...,a_{r}$ for some integers $(l,r)$ such that $1<=l<=r<=n$ . ZS the Coder thinks that a subarray of $a$ is beautiful if the bitwise xor of all the elements in the subarray is at least $k$ .

Help ZS the Coder find the number of beautiful subarrays of $a$ !

输入格式

The first line contains two integers $n$ and $k$ ( $1<=n<=10^{6},1<=k<=10^{9}$ ) — the number of elements in the array $a$ and the value of the parameter $k$ .

The second line contains $n$ integers $a_{i}$ ( $0<=a_{i}<=10^{9}$ ) — the elements of the array $a$ .

输出格式

Print the only integer $c$ — the number of beautiful subarrays of the array $a$ .

输入输出样例

输入#1
```
3 1
1 2 3
```
输出#1
```
5
```
输入#2
```
3 2
1 2 3
```
输出#2
```
3
```
输入#3
```
3 3
1 2 3
```
输出#3
```
2
```

首页