111qqz的小窝

老年咸鱼冲锋!

2015多校 #5 1002 MZL’s xor

MZL’s xor

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1509    Accepted Submission(s): 619

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)(1i,jn)
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=(Ai1m+z) mod l
1m,z,l5105,n=5105
 

 

Output
For every test.print the answer.
 

 

Sample Input
2
3 5 5 7
6 8 8 9
 

 

Sample Output
14
16
 
水题
两个相等的数异或为0
先用它给的公式算出 a[1..n]来
然后 答案就是(2倍的a[i] )的异或。。。

 

说点什么

您将是第一位评论人!

提醒
wpDiscuz
粤ICP备18103363