← 返回题目

题库练习 Sum of XOR Functions

← 上一题下一题 →

A16194 | $Sum of XOR Functions$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given an array $a$ of length $n$ consisting of non-negative integers. You have to calculate the value of $\sum_{l=1}^{n} \sum_{r=l}^{n} f(l, r) \cdot (r - l + 1)$ , where $f(l, r)$ is $a_l \oplus a_{l+1} \oplus \dots \oplus a_{r-1} \oplus a_r$ (the character $\oplus$ denotes bitwise XOR). Since the answer can be very large, print it modulo $998244353$ .

输入格式

The first line contains one integer $n$ ( $1 \le n \le 3 \cdot 10^5$ ) — the length of the array $a$ . The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $0 \le a_i \le 10^9)$ .

输出格式

Print the one integer — the value of $\sum_{l=1}^{n} \sum_{r=l}^{n} f(l, r) \cdot (r - l + 1)$ , taken modulo $998244353$ .

输入输出样例

输入 #1

3
1 3 2

输出 #1

输入 #2

4
39 68 31 80

输出 #2

输入 #3

7
313539461 779847196 221612534 488613315 633203958 394620685 761188160

输出 #3

257421502

C++ 编辑器

输入

输出