【莫队算法】[CodeForces - 617E/Round #340]XOR and Favorite Number
题目分析:求异或的前缀和后用莫队算法即可。#include
#include
#include
#defineMAXN100000
#defineMAXM100000
#defineMAXK1000000
usingnamespacestd;
intblock[MAXN+10],n,m,a[MAXN+10],k,cnt[MAXK*2+10],sum[MAXN+10];
longlongans[MA