cf424c 亦或交换律模循环节亦或前缀和

最新推荐文章于 2024-04-27 21:43:35 发布

c_cl

最新推荐文章于 2024-04-27 21:43:35 发布

阅读量391

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/c_czl/article/details/76659789

版权

数学专栏收录该内容

58 篇文章 0 订阅

订阅专栏

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 p₁, p₂, ...,p_n. Lets write down some magic formulas:

$\text{[math]}$ $\text{[math]}$

Here, "mod" means the operation of taking the residue after dividing.

The expression $\text{[math]}$ means applying the bitwisexor (excluding "OR") operation to integersx 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 sequencep, calculate the value of Q.

Input

The first line of the input contains the only integer n (1 ≤ n ≤ 10⁶). The next line containsn integers: p₁, p₂, ..., p_n (0 ≤ p_i ≤ 2·10⁹).

Output

The only line of output should contain a single integer — the value of Q.

Sample test(s)

Input

3
1 2 3

Output

1--n mod 1--n

#include<iostream>

#include<cstdio>

#include<cmath>

#include<algorithm>

#include<cstring>

#include<queue>
using namespace std;
long long esum[1000005];
int main()

{

   int n;

   while(~scanf("%d",&n))

   {

       long long ans=0;

       for(int i=0;i<n;i++)
       {
           long long tp;
           scanf("%lld",&tp);
           ans^=tp;
       }
       esum[0]=0;
       esum[1]=1;

       for(int i=2;i<=n;i++)
       {
           esum[i]=i^esum[i-1];
       }
       for(int i=2;i<=n;i++)
       {
           int num=n/i;

           int res=n%i;

           if(num%2==1)

            ans^=esum[i-1];

           ans^=esum[res];
       }
       printf("%lld\n",ans);

   }

}