People in the Tomskaya region like magic formulas very much. You can see some of them below.
Imagine you are given a sequence of positive integer numbers p1, p2, ..., pn. Lets write down some magic formulas:
Here, "mod" means the operation of taking the residue after dividing.
The expression means applying the bitwise xor (excluding "OR") operation to integers x and y. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by "^", in Pascal — by "xor".
People in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence p, calculate the value of Q.
The first line of the input contains the only integer n (1 ≤ n ≤ 106). The next line contains n integers: p1, p2, ..., pn (0 ≤ pi ≤ 2·109).
The only line of output should contain a single integer — the value of Q.
3 1 2 3
3
分析:设 为公式1,
为公式2.
因为异或运算满足交换律,
所以公式2 = p1^p2^……^pn^(1%1)^(1%2)^……(1%n)^(2%1)%(2%2)^……^(2%n)^……^(n%1)^(n%2)^……^(n%n)
=p1^p2^……^pn^(1%1)^(2%1)^……(n%1)^(1%2)^(2%2)^……^(n%2)^……^(1%n)%(2%n)^……^(n%n)
又因为对于任何一个正整数k,(1~n) % k 只会有0~(k-1)这k种结果,所以(1%k)、(2%k)……(n%k)是有规律的,也就是(1%k)^(2%k)^……^(n%k)是有规律的。
例如当n=15,k=7时,(1%k)、(2%k)……(n%k)的结果如下表所示。
1 | 2 | 3 | 4 | 5 | 6 | 0 |
1 | 2 | 3 | 4 | 5 | 6 | 0 |
1 |
|
|
|
|
|
|
根据异或原则,a^a=0,0^a=a; 所以图中红色两行异或结果为0。所以(1%7)^(2%7)^……^(15%7)=1;
又如当n=25,k=7时。(1%7)、(2%7)……(25%7)的结果如下表。
1 | 2 | 3 | 4 | 5 | 6 | 0 |
1 | 2 | 3 | 4 | 5 | 6 | 0 |
1 | 2 | 3 | 4 | 5 | 6 | 0 |
1 | 2 | 3 | 4 |
|
|
|
#include<iostream>
using namespace std;
const int MAXN = (int)1e6 + 10;
int a[MAXN];
int main()
{
a[0] = 0;
for(int i = 1; i < MAXN; i++)
a[i] = a[i-1] ^ i;
int n, b;
while(cin >> n) {
int ans = 0;
for(int i = 1; i <= n; i++) {
cin >> b;
ans ^= b;
if((n/i)&1) //求1—>n 对i取余后的值(0->i-1)有多少整行
ans ^= a[i-1];
ans ^= a[n%i]; //计算不足一整行的
}
cout << ans << endl;
}
return 0;
}