Code_KK的博客

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 In

#include #define LL long long using namespace std; int main() { LL n,m; cin>>n>>m; int num = 0; for(int i=1;i<=64;i++) { for(int j=0;j<i-1;j++) { LL t