MZL's xor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1518 Accepted Submission(s): 911
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
题意:给你一个长度为n的序列,求所有任意两个元素的和(a[i]+a[j]) 1<=i,j<=n 的总异或值。
思路:由异或值的性质,a^a=0。而任选两个元素a,b,总有一个你要选的b,a(即两者交换位置)(a+b)^(b+a)=0。因此答案就是
a[2]*2^...^a[n]*2。(因为a[1]=0)
代码:
#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pii pair<ll,ll>
using namespace std;
inline ll read()
{
register ll c=getchar(),fg=1,sum=0;
while(c<='9'&&c>='0'){sum=sum*10+c-'0';c=getchar();}
return fg*sum;
}
ll n,m,z,l,ans;
int main()
{
ll T;
T=read();
while(T--)
{
ans=0;
n=read();m=read();
z=read();l=read();
ll a=0;
for(int i=1;i<n;i++)
{
a=(a*m+z)%l;
ans=ans^(2*a);
}
printf("%lld\n",ans);
}
return 0;
}