|
?
MZL's xor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 310 Accepted Submission(s): 225
Problem Description MZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (
Ai
+
Aj
)(
1≤i,j≤n
)
The xor of an array B is defined as
B1
xor
B2
...xor
Bn
Input Multiple test cases, the first line contains an integer T(no more than 20), indicating the number of cases.
Each test case contains four integers:
n
,
m
,
z
,
l
A1=0
,
Ai=(Ai?1?m+z)
mod
l
1≤m,z,l≤5?105
,
n=5?105
Output For every test.print the answer.
Sample Input
2
3 5 5 7
6 8 8 9
Sample Output
14
16
题意：求所有a[i]+a[j] 异或值，因为a[i]+a[j] 和a[j]+a[i] 会异或掉 所以只需考虑a[i]+a[i]
?
?
代码：
?
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
?
?
?
?
|