链接:http://acm.hdu.edu.cn/showproblem.php?pid=5344
MZL's xor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 715 Accepted Submission(s): 461
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
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
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
Source
刚开始被这题给唬住了,所有的(Ai+Aj),那得多少种组合啊,后来zx发现因为任何i!=j的时候a=(Ai+Aj)总有另一组b=(Aj+Ai)与它相等,而a xor b又必然是为0的,所以这道题就是求(A1*2)^(A2*2)...^(An*2)。
代码如下:
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
ll ch[500000+10];
int main()
{
int T;
int n,m,z,l;
while(~scanf("%d",&T)) {
while(T--) {
scanf("%d%d%d%d",&n,&m,&z,&l);
ch[1]=0;
for(int i=2;i<=n;i++) {
ch[i]=(ch[i-1]*m+z)%l;
}
int ans=0;
for(int i=1;i<=n;i++) {
ans=ans^(ch[i]*2);
}
printf("%d\n",ans);
}
}
return 0;
}