Blame for structured data/programming data/Information_technology/response_log.csv

submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume
1127381325438087168,a9433ab49fa612cb99c8f0cfd63fd66b26abb2e010bf50a05985cfff5bd5053d,2019-05-12 09:13:48,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include<bits/stdc++.h>\r\n#define ll long long\r\nusing namespace std;\r\n\r\nint main(){\r\n    int n;\r\n    cin >> n;\r\n    int ans=0;\r\n    while(n){\r\n        ans++;\r\n        n>>=1;\r\n    }\r\n    cout<<ans<<endl;\r\n    return 0;\r\n}\r\n,ACCEPTED,14,648
1127381718041718784,37585eca3da6b283afa247f08bd0230d7b706a069e6d158a7f5431abac7b4b44,2019-05-12 09:15:22,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <bits/stdc++.h>\r\nusing namespace std;\r\nint a[100];\r\nint main()\r\n{\r\n    int n,ans=0;\r\n    cin>>n;\r\n    while(n){\r\n        ans++;\r\n        n/=2;\r\n    }\r\n    cout<<ans;\r\n    return 0;\r\n}\r\n",ACCEPTED,12,728
1127382185526259712,d3d395d8e4bdd94c3755da1f31f31c570a61cee7352b9eb3b616f5ad7033d2ba,2019-05-12 09:17:13,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint main()\r\n{\r\n\tlong long n;\r\n\tcin>>n;\r\n\tint ji = 0;\r\n\twhile(n)\r\n\t{\r\n\t\tji++;\r\n\t\tn/=2;\r\n\t}\r\n\tprintf(\""%d\"",ji);\r\n\treturn 0;\r\n} ",ACCEPTED,15,512
1127382352769937408,1ca566e2913c6507ed4344fa677619bff7adea5b638b759f777cf0310b6d772a,2019-05-12 09:17:53,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<stdio.h>\r\nint main()\r\n{\r\n\tlong long int n,num=0;\r\n\tscanf(\""%lld\"",&n);\r\n\t\r\ndo{\r\n\tnum++;\r\n\tn=n>>1;\r\n\t}while(n)\t;\r\n\tprintf(\""%lld\\n\"",num);\r\n\t\r\n\treturn 0;\r\n } ",ACCEPTED,7,628
1127382415130849280,9c67db2991034b7dc63ae87e2678a8da3dd8147ee9ca6b63a457828f3055ff5b,2019-05-12 09:18:08,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint main()\r\n{\r\n    long x,i;\r\n    cin>>x;\r\n    for( i=0;x!=0;i++)\r\n    {\r\n        x/=2;\r\n    }\r\n    cout<<i<<endl;\r\n}\r\n",ACCEPTED,11,512
1127382511302045696,de5139527048cee407f2c4b781f0a010eec18e20e4b5ea1566982b7736319274,2019-05-12 09:18:31,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <iostream>\r\n#include <algorithm>\r\n#include <set>\r\n#include <vector>\r\n#include <map>\r\n#include <stack>\r\n#include <string>\r\n#include <cstring>\r\n#include <queue>\r\n \r\n\r\n\r\n\r\n#define fre freopen(\""D:\\\\code\\\\cin.txt\"", \""r\"", stdin)\r\n\r\n\r\n\r\nusing namespace std;\r\n\r\n\r\npriority_queue<int> pq;\r\n\r\n\r\n\r\nint main(){\r\n//\tfre;\r\n\tlong long n, ans = 0;\r\n\tcin>> n;\r\n\twhile(n){\r\n\t\tn = n / 2;\r\n\t\tans++;\r\n\t}\r\n\tcout<< ans<< endl;\r\n\t\r\n\treturn 0;\r\n}\r\n",ACCEPTED,19,760
1127382603618676736,8ba586620994c1404118462b1badfb1594f65765b19ad2ace447269b71553946,2019-05-12 09:18:53,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include<iostream>\r\nusing namespace std;\r\nint main()\r\n{\r\n\tint n;\r\n\tcin>>n;\r\n\tint ans=0;\r\n\twhile(n!=0)\r\n\t{\r\n\t\tn/=2;\r\n\t\tans++;\r\n\t}\r\n\tcout<<ans<<endl;\r\n\treturn 0;\r\n},ACCEPTED,14,756
1127383200421998592,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 09:21:15,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n#define MAX 10000\r\nint num[MAX];\r\n\r\n\r\nint main()\r\n{\r\n    long long n,i=0;\r\n    scanf(\""%lld\"",&n);\r\n    while(n)\r\n    {\r\n        n>>=1;\r\n        i++;\r\n    }\r\n    cout<<i<<endl;\r\n    return 0;\r\n}\r\n",ACCEPTED,17,384
1127383317891870720,66f4054c1bcfef8a1db99d5d6b9fe39ef48d8e259825c84ee1663760e98ae472,2019-05-12 09:21:43,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint ans;\r\n\r\nvoid solve(int n){\r\n    while(n){\r\n        n /= 2;\r\n        ans++;\r\n    }\r\n\r\n}\r\nint main()\r\n{\r\n    int n;\r\n    scanf(\""%d\"", &n);\r\n    solve(n);\r\n    printf(\""%d\\n\"", ans);\r\n    return 0;\r\n}\r\n",ACCEPTED,15,504
1127383320941129728,db72cc2d20f82713b850b2a4f58b32d38cade8070b18371530c9d819cd20e7e0,2019-05-12 09:21:44,C++,0.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\nusing namespace std;\r\nint main(){\r\n\t//freopen(\""input.txt\"",\""r\"",stdin);\r\n\t//freopen(\""out.txt\"",\""w\"",stdout);\r\n\tint n;\r\n\tscanf(\""%d\"",&n);\r\n\tint tmp=1;\r\n\tint co=0;\r\n\twhile((tmp<<=1)<=n){\r\n\t\t//cout<<tmp<<\"" \"";\r\n\t\tco++;\r\n\t}\r\n\tprintf(\""%d\\n\"",co+1);\r\n\treturn 0;\r\n}\r\n ",TIME_LIMIT_EXCEEDED,0,0
1127383518664814592,2e1ae774448c7cbb694103b08792d72151180d1fe7b1e8ac970c84862c2f2c98,2019-05-12 09:22:31,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include<bits/stdc++.h>\r\nusing namespace std;\r\nint  n;\r\nint main()\r\n{\r\n\tcin>>n;\r\n\tint cnt=0;\r\n\twhile(n>0)\r\n\t{\r\n\t\tn/=2;\r\n\t\tcnt++;\r\n\t\tif(n==0) break;\r\n\t}\r\n\tcout<<cnt<<endl;\r\n\treturn 0;\r\n},ACCEPTED,14,508
1127383613183455232,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 09:22:53,Java,20.0,1127197494777061376,1125965660827262976,976506807128301568,import java.util.*;\r\npublic class Main {\r\n\tpublic static void main(String [] args){\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint n = input.nextInt();\r\n\t\tString result = Integer.toBinaryString(n);\r\n\t\tSystem.out.println(result.length());\r\n\t}\r\n}\r\n,ACCEPTED,570,27020
1127383769723269120,27815222c523253035889d3967c037074fc7c2392aad2f4d68ce6a49054c3c9e,2019-05-12 09:23:31,C++,0.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\n\r\n\r\n\r\nint main()\r\n{\r\n    int num;\r\n    cin>>num;\r\n    int ans=0;\r\n    for(int i=1;i<20;i++)\r\n    {\r\n\r\n        if(pow(2,i)-1>=num)\r\n        {\r\n\r\n            ans=i;\r\n            break;\r\n        }\r\n    }\r\n    cout<<ans<<endl;\r\n\r\n    return 0;\r\n}",WRONG_ANSWER,2,384
1127383844327354368,c4249ccf7d0ae4ce1aabf6f6b7adcb919b8202351ddad46f0300f727f06480dd,2019-05-12 09:23:48,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<stdio.h>\r\n#include<math.h>\r\nint n,ans=0;\r\n\r\nint main(){\r\n   scanf(\""%d\"",&n);\r\n   while(ceil(n)!=0){\r\n    n=n/2.0;\r\n    ans++;\r\n   }\r\n   printf(\""%d\\n\"",ans);\r\n    return 0;\r\n}\r\n",ACCEPTED,9,376
1127384045234515968,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 09:24:36,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <iostream>\r\n#include <cstdio>\r\n\r\nusing namespace std;\r\n\r\nint main(){\r\n\tint n;\r\n\tscanf(\""%d\"", &n);\r\n\tint ans=0;\r\n\twhile(n){\r\n\t\t++ans;\r\n\t\tn/=2;\r\n\t}\r\n\tprintf(\""%d\\n\"",ans);\r\n} ",ACCEPTED,12,764
1127384313703526400,49989a4e38586e52e86d0f817b82634bc81ab8b8149f9c3651ba471978bdf6e9,2019-05-12 09:25:40,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint main(){\r\n    int n;\r\n    scanf(\""%d\"",&n);\r\n    int sum=0;\r\n    while (n){\r\n        n>>=1;\r\n        sum++;\r\n    }\r\n    printf(\""%d\"",sum);\r\n    return 0;\r\n}\r\n",ACCEPTED,11,508
1127384402719240192,66f4054c1bcfef8a1db99d5d6b9fe39ef48d8e259825c84ee1663760e98ae472,2019-05-12 09:26:02,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint n, q, ans, a[1000005];\r\n\r\nint main()\r\n{\r\n    scanf(\""%d%d\"", &n, &q);\r\n    for(int i = 1;i <= n; ++i) scanf(\""%d\"", &a[i]);\r\n    while(q--){\r\n        ans = 0;\r\n        int l, r;\r\n        scanf(\""%d%d\"", &l, &r);\r\n        for(int i = l ;i <= r; ++i) ans ^= a[i];\r\n        printf(\""%d\\n\"", ans);\r\n    }\r\n    return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,549,10812
1127384428673593344,27815222c523253035889d3967c037074fc7c2392aad2f4d68ce6a49054c3c9e,2019-05-12 09:26:08,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<cmath>\r\nusing namespace std;\r\n\r\n\r\n\r\n\r\nint main()\r\n{\r\n    int num;\r\n    cin>>num;\r\n    int ans=0;\r\n    for(int i=1;i<35;i++)\r\n    {\r\n\r\n        if(pow(2,i)-1>=num)\r\n        {\r\n\r\n            ans=i;\r\n            break;\r\n        }\r\n    }\r\n    cout<<ans<<endl;\r\n\r\n    return 0;\r\n}\r\n",ACCEPTED,11,768
1127384549561823232,760a54321c9b044091db2f03fe4ef1c436dc52786fd07fce69ef0039e4ccf89d,2019-05-12 09:26:37,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"\r\n#include <iostream>\r\n#include <cmath>\r\n#include <cstdio>\r\nusing namespace std;\r\n#define sf(x) scanf(\""%d\"",&(x))\r\n#define fre freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin)\r\nint main(){\r\n\tint n;\r\n\tlong long t=1;\r\n\tsf(n);\r\n\t//cout<<n<<endl;\r\n\tint i;\r\n\tfor(i=1;i<=33;i++){\r\n\t\tt*=2;\r\n\t\tif((t-1)>=n)break;\r\n\t}\r\n\tcout<<i;\r\n\treturn 0;\r\n} ",ACCEPTED,17,500
1127384551264710656,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 09:26:37,C++,0.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\nusing namespace std;\r\n\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n;\r\n\tcin>>n;\r\n\tif(n==1)\r\n\t\tcout<<1<<endl;\r\n\telse{\r\n\t\tfor(int i=1;i<n;i++){\r\n\t\t\tif((1<<i)>=n){\r\n\t\t\t\tcout<<i<<endl;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n} ",TIME_LIMIT_EXCEEDED,0,0
1127384658391429120,5be1ea2fa56a2a415c4684b1d82c2cfbbc9ed554a0319b565278f2e2ef54c0bd,2019-05-12 09:27:03,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <bits/stdc++.h>\r\nconst int maxn = 0x3f3f3f3f;\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n   // freopen(\""in.txt\"", \""r\"", stdin);\r\n\r\n    int n;\r\n    cin >> n;\r\n    long long count = 0;\r\n    // cout << n << endl;\r\n    while(n)\r\n    {\r\n        count++;\r\n        n = (n >> 1);\r\n        // cout << n << endl;\r\n    }\r\n    cout << count <<endl;\r\n}\r\n",ACCEPTED,14,744
1127384843809026048,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 09:27:47,C++,0.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\nusing namespace std;\r\n\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n;\r\n\tcin>>n;\r\n\tfor(int i=1;i<10000000;i++){\r\n\t\tif((1<<i)>=n){\r\n\t\t\tcout<<i<<endl;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n} ",WRONG_ANSWER,18,348
1127385495457067008,42f17ffa1f72526ed7daa3e88d6f4fecdc67729447a6106c37ce3df2d48db904,2019-05-12 09:30:22,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\nusing namespace std;\r\nint main(){\r\n    long long n;\r\n    while(~scanf(\""%lld\"",&n)){\r\n        int r=1;\r\n        long long MAX=2;\r\n        while(MAX-1<n){\r\n            r++;\r\n            MAX*=2;\r\n        }\r\n        cout<<r<<endl;\r\n    }\r\n    return 0;\r\n}",ACCEPTED,16,752
1127385656749027328,b6d0f8125e48362cbc9d2a2a1e8a41093badcbe9414a9993055ff30167479278,2019-05-12 09:31:01,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<cstdio>\r\n#include<climits>\r\n#define LL long long\r\nusing namespace std;\r\nconst int maxn=2e5+7;\r\nconst int INF=1e9+7;\r\nint N;\r\nint main()\r\n{\r\n    scanf(\""%d\"",&N);\r\n    int ans=0;\r\n    while(N)\r\n    {\r\n        N/=2;\r\n        ans++;\r\n    }\r\n    printf(\""%d\"",ans);\r\n    return 0;\r\n}\r\n",ACCEPTED,18,484
1127385698809507840,5815a2f766bf69d88350a22c389c096970be3d02e533db608557739c4a357cef,2019-05-12 09:31:11,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include<iostream>\r\nusing namespace std;\r\nint n;\r\nint main(){\r\n\tcin>>n;\r\n\tint ans=0;\r\n\twhile(n>0){\r\n\t\tn/=2;\r\n\t\tans++;\r\n\t}\r\n\tcout<<ans<<endl;\r\n\treturn 0;\r\n},ACCEPTED,14,512
1127385702957674496,9c67db2991034b7dc63ae87e2678a8da3dd8147ee9ca6b63a457828f3055ff5b,2019-05-12 09:31:12,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n#include<stdio.h>\r\nusing namespace std;\r\nint a[1000002]={0} ;\r\nint main()\r\n{\r\n   int  n,q,q1,q2;\r\n   cin>>n>>q;\r\n   for(int i=1;i<=n;i++)\r\n   {\r\n       scanf(\""%d\"",&a[i]);\r\n       a[i]^=a[i-1];\r\n   }\r\n   while(q--)\r\n   {\r\n       scanf(\""%d %d\"",&q1,&q2);\r\n       long x=a[q1-1]^a[q2];\r\n       printf(\""%d\\n\"",x);\r\n   }\r\n}\r\n",ACCEPTED,498,10824
1127386045514870784,50732ce5653eeab9688efbe3dac184b142f0fd90eac47128099a03515d517d06,2019-05-12 09:32:33,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include <iostream>\r\n#include <cstring>\r\n#include <string>\r\n#include <algorithm>\r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n\tlong long n;\r\n\tcin >> n;\r\n\tint w = 0;\r\n\twhile (n != 0)\r\n\t{\r\n\t\tn /= 2;\r\n\t\tw++;\r\n\t}\r\n\tcout << w << endl;\r\n\treturn 0;\r\n} ,ACCEPTED,14,756
1127386500089344000,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 09:34:22,C++,0.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\nusing namespace std;\r\n\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n;\r\n\tcin>>n;\r\n\tfor(int i=1;i<10000000;i++){\r\n\t\tif(((1<<i)-1)>=n){\r\n\t\t\tcout<<i<<endl;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n} ",WRONG_ANSWER,12,380
1127386839429509120,f675ec631d87348266c124f9c9644c1c9413195cb2686f48383823bf2f2a62b3,2019-05-12 09:35:43,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<stdio.h>\r\nint main()\r\n{\r\n\tint n;\r\n\tscanf(\""%d\"",&n);\r\n\tint count=0;\r\n\twhile(n)\r\n\t{\r\n\t\tn /= 2;\r\n\t\tcount++;\r\n\t}\r\n\tprintf(\""%d\"",count);\r\n\treturn 0;\r\n} ",ACCEPTED,10,256
1127387555137155072,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 09:38:33,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint main(){\r\n\tint n,z=0;\r\n\tcin>>n;\r\n\twhile(n>0){\r\n\t\tn=n/2;\r\n\t\tz++;\r\n\t}\r\n\tcout<<z;\r\n\treturn 0;\r\n}",ACCEPTED,13,384
1127387697613467648,52242367a66f65576c135b60fb8d48f86a8742fdd3c55414d401df3af013789d,2019-05-12 09:39:07,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\nint fun(long long n){\r\n    int cnt=0;\r\n    while(n!=0){\r\n        n/=2;\r\n        cnt++;\r\n    }\r\n    return cnt;\r\n}\r\n\r\nint main(){\r\n    long long n;\r\n    cin>>n;\r\n    cout<<fun(n);\r\n    return 0;\r\n},ACCEPTED,14,496
1127387747957698560,4122b8a8cc7415b2d5ef2738372c612850d5707ab1ffb371f3ff60425fe6838d,2019-05-12 09:39:19,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint main(){\r\n\tint i,j,n,l,s=0;\r\n\tcin>>n;\r\n\twhile(n!=0){\r\n\t\tn=n>>1;\ts++;\r\n\t}\r\n\tcout<<s;\r\n}",ACCEPTED,15,724
1127388141324693504,f82a2971d09c42067faf0ede8a4b560bc66eb8858d9880a503ded107fd4609c7,2019-05-12 09:40:53,Java,20.0,1127197494777061376,1125965660827262976,976506807128301568,"\r\nimport java.io.File;\r\nimport java.io.FileNotFoundException;\r\nimport java.math.BigInteger;\r\nimport java.util.Scanner;\r\n\r\n\r\npublic class Main {\r\n\tstatic Scanner in = new Scanner(System.in);\r\n\tstatic int n;\r\n\tstatic String s;\r\n\r\n\tpublic static void main(String[] args) throws FileNotFoundException {\r\n\t\t//Scanner in = new Scanner(new File(\""src/qlm/5.txt\""));\r\n\t\ts=in.next();\r\n\t\tBigInteger a=new BigInteger(s);\r\n\t\tSystem.out.println(a.toString(2).length());\r\n\r\n\t}\r\n}\r\n",ACCEPTED,503,27972
1127388260967215104,50732ce5653eeab9688efbe3dac184b142f0fd90eac47128099a03515d517d06,2019-05-12 09:41:21,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstring>\r\n#include <string>\r\n#include <algorithm>\r\n#include <fstream>\r\n\r\nusing namespace std;\r\nconst int maxn = 10e6 + 4;\r\nlong long num[maxn]; \r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\r\n\t\r\n\tcin >> n >> q;\r\n\tfor (int i = 1; i <= n; i++)\r\n\t{\r\n\t\tcin >> num[i];\r\n\t}\r\n\t\r\n\twhile (q--)\r\n\t{\r\n\t\tint l, r;\r\n\t\tcin >> l >> r;\r\n\t\tint ans = num[l];\r\n\t\tfor (int i = l + 1; i <= r; i++)\r\n\t\t{\r\n\t\t\tans = (ans ^ num[i]);\r\n\t\t}\r\n\t\tcout << ans << endl;\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,705,8536
1127388284094607360,b6d0f8125e48362cbc9d2a2a1e8a41093badcbe9414a9993055ff30167479278,2019-05-12 09:41:27,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<cstdio>\r\n#include<climits>\r\n#define LL long long\r\nusing namespace std;\r\nconst int maxn=1e6+7;\r\nconst int INF=1e9+7;\r\nint N,Q,a[maxn],t[4*maxn];\r\nvoid build(int rt,int l,int r)\r\n{\r\n    if(l==r)\r\n    {\r\n        t[rt]=a[l];\r\n        return;\r\n    }\r\n    int mid=(l+r)>>1;\r\n    build(rt<<1,l,mid);\r\n    build(rt<<1|1,mid+1,r);\r\n    t[rt]=t[rt<<1]^t[rt<<1|1];\r\n}\r\nint query(int rt,int l,int r,int ql,int qr)\r\n{\r\n    if(ql<=l&&r<=qr)\r\n        return t[rt];\r\n    if(r<ql||l>qr)\r\n        return 0;\r\n    int mid=(l+r)>>1;\r\n    int L=query(rt<<1,l,mid,ql,qr);\r\n    int R=query(rt<<1|1,mid+1,r,ql,qr);\r\n    if(L==0)\r\n        return R;\r\n    else if(R==0)\r\n        return L;\r\n    else\r\n        return L^R;\r\n}\r\nint main()\r\n{\r\n    scanf(\""%d %d\"",&N,&Q);\r\n    for(int i=1;i<=N;i++)\r\n        scanf(\""%d\"",&a[i]);\r\n    build(1,1,N);\r\n    while(Q--)\r\n    {\r\n        int a,b;\r\n        scanf(\""%d %d\"",&a,&b);\r\n        printf(\""%d\\n\"",query(1,1,N,a,b));\r\n    }\r\n    return 0;\r\n}",ACCEPTED,541,15872
1127389534303383552,56ad04e7aea44f55046251a22019aea68dc6128fbf3e538b3f0f9b3d129a555f,2019-05-12 09:46:25,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <cstdio>\r\n\r\nint main()\r\n{\r\n\tint n, a = 0;\r\n\tscanf(\""%d\"", &n);\r\n\twhile(n != 0)\r\n\t{\r\n\t\tn /= 2;\r\n\t\ta++;\r\n\t}\r\n\tprintf(\""%d\\n\"", a);\r\n\treturn 0;\r\n}",ACCEPTED,8,256
1127389626653569024,f675ec631d87348266c124f9c9644c1c9413195cb2686f48383823bf2f2a62b3,2019-05-12 09:46:47,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nint a[1000005];\r\nint main()\r\n{\r\n\tint n,q;\r\n\tscanf(\""%d%d\"",&n,&q);\r\n\tfor(int i=1;i<=n;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\tint l,r;\r\n\t\tscanf(\""%d%d\"",&l,&r);\r\n\t\tint res=a[l];\r\n\t\tfor(int i=l+1;i<=r;i++)\r\n\t\t{\r\n\t\t\tres=res^a[i];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"",res);\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,498,10624
1127389637609091072,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 09:46:50,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<math.h>\r\nusing namespace std;\r\n\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n;\r\n\tcin>>n;\r\n\tfor(int i=1;i<100000;i++){\r\n\t\tif((pow(2,i)>n)){\r\n\t\t\tcout<<i<<endl;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n} ",ACCEPTED,11,512
1127389693527552000,226991b0eca63f1f924f3dbc616800e382f3150455ca17105d8db4d773db68cf,2019-05-12 09:47:03,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <bits/stdc++.h>\r\n\r\nusing namespace std;\r\n#define fre freopen(\""in.txt\"",\""r\"",stdin)\r\ntypedef long long LL;\r\nint main(){\r\n\t//fre;\r\n\tLL x,ans=0;\r\n\tscanf(\""%lld\"",&x);\r\n\twhile(x){\r\n\t\tans++;\r\n\t\tx>>=1;\r\n\t}\r\n\tprintf(\""%lld\"",ans);\r\n\treturn 0;\r\n} ",ACCEPTED,15,512
1127390296521666560,a9433ab49fa612cb99c8f0cfd63fd66b26abb2e010bf50a05985cfff5bd5053d,2019-05-12 09:49:27,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n#define ll long long\r\nusing namespace std;\r\nint n,q;\r\nint a[1000005];\r\nint main(){\r\n    scanf(\""%d%d\"",&n,&q);\r\n    for(int i=1;i<=n;i++){\r\n        scanf(\""%d\"",&a[i]);\r\n    }\r\n    int l,r;\r\n    int ans;\r\n    while(q--){\r\n        ans=0;\r\n        scanf(\""%d%d\"",&l,&r);\r\n        for(int i=l;i<=r;i++){\r\n            ans^=a[i];\r\n        }\r\n        printf(\""%d\\n\"",ans);\r\n    }\r\n\r\n}\r\n",TIME_LIMIT_EXCEEDED,477,10908
1127390991060660224,760a54321c9b044091db2f03fe4ef1c436dc52786fd07fce69ef0039e4ccf89d,2019-05-12 09:52:12,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include <iostream>\r\n#include <cstdio>\r\nusing namespace std;\r\n#define sf(x) scanf(\""%d\"",&(x))\r\n#define fre freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin)\r\nconst int maxn=1e6+5;\r\nint yh[maxn<<2];\r\nvoid getyh(int i){\r\n\tyh[i]=yh[i<<1]^yh[i<<1|1];\r\n} \r\nvoid build(int i,int l,int r,int L ,int R){\r\n\tif(l==r){\r\n\t\tscanf(\""%d\"",&yh[i]);\r\n\t\treturn;\r\n\t}\r\n\t\r\n\tint m=l+(r-l)/2;\r\n\tif(L<=m)build(i<<1,l,m,L,R);\r\n\tif(R>m)build(i<<1|1,m+1,r,L,R);\r\n\tgetyh(i);\r\n} \r\nint query(int i,int l,int r,int L,int R){\r\n\tif(L<=l&&r<=R)return yh[i];\r\n\tif(l>R||r<L)return 0;\r\n\tint ans=0;\r\n\tint m=l+(r-l)/2;\r\n\tif(L<=m)ans=ans^(query(i<<1,l,m,L,R));\r\n\tif(R>m)ans=ans^(query(i<<1|1,m+1,r,L,R));\r\n\treturn ans;\r\n}\r\nint main(){\r\n\tint n,q;sf(n);sf(q);\r\n\tbuild(1,1,n,1,n);\r\n\tint ql,qr;\r\n\twhile(q--){\r\n\t\tsf(ql);sf(qr);\r\n\t\t cout<<query(1,1,n,ql,qr)<<endl;\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,198,10824
1127391142940602368,49989a4e38586e52e86d0f817b82634bc81ab8b8149f9c3651ba471978bdf6e9,2019-05-12 09:52:49,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint main(){\r\n    int n,q;\r\n    scanf(\""%d %d\"",&n,&q);\r\n    int num[100005][3]={0};\r\n    int sum=0;\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%d\"",&num[i][0]);\r\n        if(i==0){\r\n            num[i][1]=num[i][0];\r\n        }\r\n        else {\r\n            num[i][1]=num[i][0]^num[i-1][1];\r\n        }\r\n    }\r\n    //for(int i=0;i<n;i++)printf(\""%d \"",num[i][1]);printf(\""\\n\"");\r\n    for(int i=0;i<q;i++){\r\n        int l,r;\r\n        scanf(\""%d %d\"",&l,&r);\r\n        if(l==1)printf(\""%d\\n\"",num[r-1][1]);\r\n        else\r\n        printf(\""%d\\n\"",num[r-1][1]^num[l-2][1]);\r\n    }\r\n    return 0;\r\n}\r\n",SEGMENTATION_FAULT,29,1628
1127391568255610880,49989a4e38586e52e86d0f817b82634bc81ab8b8149f9c3651ba471978bdf6e9,2019-05-12 09:54:30,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint main(){\r\n    long long int n,q;\r\n    scanf(\""%lld %lld\"",&n,&q);\r\n    long long int num[100005][2]={0};\r\n    long long int sum=0;\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&num[i][0]);\r\n        if(i==0){\r\n            num[i][1]=num[i][0];\r\n        }\r\n        else {\r\n            num[i][1]=num[i][0]^num[i-1][1];\r\n        }\r\n    }\r\n    //for(int i=0;i<n;i++)printf(\""%d \"",num[i][1]);printf(\""\\n\"");\r\n    for(int i=0;i<q;i++){\r\n        int l,r;\r\n        scanf(\""%d %d\"",&l,&r);\r\n        if(l==1)printf(\""%lld\\n\"",num[r-1][1]);\r\n        else\r\n        printf(\""%lld\\n\"",num[r-1][1]^num[l-2][1]);\r\n    }\r\n    return 0;\r\n}\r\n",SEGMENTATION_FAULT,27,2152
1127391831385272320,bbe121ac19634caeeed4004e3a1abe8278fc8f0d7e35d125336e63e024e91fe2,2019-05-12 09:55:33,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,#include <iostream>\r\n#include<cstdio>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint n;\r\nint main()\r\n{\r\n  cin>>n;\r\n  int k=0;\r\n  while(n>0){\r\n    n/=2;\r\n    k++;\r\n  }\r\n  cout<<k<<endl;\r\n    return 0;\r\n}\r\n,ACCEPTED,20,384
1127391977661624320,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 09:56:08,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\nint jiecheng(int n){\r\n\tint i = 1;\r\n\tfor(int k = 0;k<n;k++){\r\n\t\ti = i*2;\r\n\t}\r\n\treturn i;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint n;\r\n\t//int count = 0;\r\n\tcin>>n;\r\n\tint res = 0;\r\n\tint temp = n/2;\r\n\tfor(int i = 0;i<n;i++){\r\n\t\tif(jiecheng(i)>temp){\r\n\t\t\tres = i+1;\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\tcout<<res;\r\n\treturn 0;\r\n}",ACCEPTED,14,768
1127392759916097536,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 09:59:14,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <iostream>\r\nusing namespace std; \r\nlong long N;\r\nlong long ans=0;\r\n\r\nint main(int argc, char** argv) {\r\n\tcin>>N;\r\n\twhile(N/2!=0)\r\n\t{\r\n\t\tN=N/2;\r\n\t\tans=ans+1;\r\n\t}\r\n\tcout<<ans+1;\r\n\treturn 0;\r\n}",ACCEPTED,14,384
1127392849116360704,de5139527048cee407f2c4b781f0a010eec18e20e4b5ea1566982b7736319274,2019-05-12 09:59:35,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <algorithm>\r\n#include <set>\r\n#include <vector>\r\n#include <map>\r\n#include <stack>\r\n#include <string>\r\n#include <cstring>\r\n#include <queue>\r\n \r\n\r\n\r\n\r\n#define fre freopen(\""D:\\\\code\\\\cin.txt\"", \""r\"", stdin)\r\n\r\n\r\n\r\nusing namespace std;\r\n\r\n\r\npriority_queue<int> pq;\r\n\r\n\r\nstruct node{\r\n\tint l, r, yor;\r\n};\r\n\r\nnode tree[4 * 1000005];\r\nint a[1000005];\r\n\r\nint gcd(int a, int b){\r\n\twhile(a){\r\n\t\tint c = b % a;\r\n\t\tb = a, a = c;\r\n\t}\r\n\treturn b;\r\n}\r\n\r\nint build(int rt, int l, int r){\r\n\ttree[rt].l = l, tree[rt].r = r;\r\n\tif(l == r){\r\n//\t\tcout<< a[l]<< endl;\r\n\t\treturn tree[rt].yor = a[l];\r\n\t}\r\n\tint mid = (l + r) / 2;\r\n\tint x = build(rt * 2, l, mid);\r\n\tint y = build(rt * 2 + 1, mid + 1, r);\r\n\treturn tree[rt].yor = x ^ y;\r\n}\r\n\r\nint qurry(int rt, int l, int r){\r\n\tif(l > tree[rt].r || r < tree[rt].l)\r\n\t\treturn -1;\r\n\tif(l <= tree[rt].l && r >= tree[rt].r)\r\n\t\treturn tree[rt].yor;\r\n\tint x = qurry(rt * 2, l, r);\r\n\tint y = qurry(rt * 2 + 1, l, r);\r\n\tif(x > -1 && y > -1)\r\n\t\treturn x ^ y;\r\n\telse if(x > -1 && y < 0)\r\n\t\treturn x;\r\n\telse if(x < 0 && y > -1)\r\n\t\treturn y;\r\n\telse\r\n\t\treturn -1;\r\n\t\r\n}\r\n\r\n\r\nint main(){\r\n//\tfre;\r\n//\tint p = 55, o = 447, w = p ^ o;\r\n//\tcout<< w<< endl;\r\n\tint n, q;\r\n\tcin>> n>> q;\r\n\t\r\n\tfor(int i = 1; i <= n; i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tbuild(1, 1, n);\r\n\t\r\n\tint l, r;\r\n\t\r\n\tfor(int i = 0; i < q; i++){\r\n\t\tscanf(\""%d %d\"", &l, &r);\r\n\t\tprintf(\""%d\\n\"", qurry(1, l, r));\r\n\t}\r\n\treturn 0;\r\n}\r\n",ACCEPTED,596,29300
1127392952568868864,db72cc2d20f82713b850b2a4f58b32d38cade8070b18371530c9d819cd20e7e0,2019-05-12 10:00:00,C++,0.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\n#include<cmath>\r\nusing namespace std;\r\nint main(){\r\n\t//freopen(\""input.txt\"",\""r\"",stdin);\r\n\t//freopen(\""out.txt\"",\""w\"",stdout);\r\n\tint n;\r\n\tscanf(\""%d\"",&n);\r\n\tint tmp=1;\r\n\tint r=2;\r\n\tint co=0;\r\n\tint pre=1;\r\n  for(int i=0;(1<<i)<=n;i++){\r\n  \tif(tmp==n){\r\n  \t\t//cout<<\""awew\""<<endl;\r\n  \t    int s =pow(2,i);\r\n  \t\tprintf(\""%d\\n\"",s);\r\n  \t\tbreak;\r\n  \t}\r\n  \t//cout<<i<<\"" ii \"";\r\n  \t//cout<<tmp<<\"" tmp \"";\r\n\tif(tmp>n){\r\n\t\t//cout<<\""tets\""<<endl;\r\n  \t\tint co1= pow(2,i-1)-1;\r\n  \t\ttmp=tmp/pre;\r\n  \t\t//cout<<tmp<<\"" aa\""<<endl;\r\n  \t\twhile((tmp<<=1)<=n){\r\n\t\t//cout<<tmp<<\"" \"";\r\n\t\t   co++;\r\n\t\t  // cout<<co<<\"" \""<<endl;\r\n\t     }\r\n\t   printf(\""%d\\n\"",co+1+co1);\r\n\t   break;\r\n  \t}\r\n  \ttmp*=r;\r\n  \tpre=r;\r\n  \tr*=r;\r\n  }\r\n\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,0,0
1127392953852325888,5be1ea2fa56a2a415c4684b1d82c2cfbbc9ed554a0319b565278f2e2ef54c0bd,2019-05-12 10:00:00,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <bits/stdc++.h>\r\n#define fei(a, b) for(int i = a; i <= b; i++)\r\nconst int maxm = 0x3f3f3f3f;\r\nconst int maxn = 1e6 + 5;\r\nusing namespace std;\r\nint n, q;\r\n\r\nint arr[maxn];\r\nint arr2[maxn];\r\n\r\nint main()\r\n{\r\n    // freopen(\""in.txt\"", \""r\"", stdin);\r\n    cin >> n >> q;\r\n    arr2[0] = 0;\r\n    fei(1, n)\r\n    {\r\n        cin >> arr[i];\r\n        arr2[i] = arr[i] ^ arr2[i - 1];\r\n       // cout << arr2[i] << endl;\r\n    }\r\n\r\n    while(q--)\r\n    {\r\n        int l, r;\r\n        cin >> l >> r;\r\n        cout << (arr2[l - 1] ^ arr2[r]) << endl;;\r\n    }\r\n    return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,663,8316
1127393653835526144,226991b0eca63f1f924f3dbc616800e382f3150455ca17105d8db4d773db68cf,2019-05-12 10:02:47,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <bits/stdc++.h>\r\n\r\nusing namespace std;\r\n#define fre freopen(\""in.txt\"",\""r\"",stdin)\r\ntypedef long long LL;\r\nconst int MAXN = 1000005;\r\nLL n,q;\r\nLL a[MAXN];\r\nLL seg_tree[MAXN*4];\r\nvoid build(int k,int left,int right){\r\n\tif(left==right){\r\n\t\tseg_tree[k] = a[left];\r\n\t\treturn;\r\n\t}\r\n\tLL mid = (left+right)>>1;\r\n\tbuild(k<<1,left,mid);\r\n\tbuild(k<<1|1,mid+1,right);\r\n\tseg_tree[k] = (seg_tree[k<<1]^seg_tree[k<<1|1]);\r\n}\r\nLL find(int k,int left ,int right ,int st,int ed){\r\n\tif(st>right||ed<left) return 0;\r\n\tif(st<=left&&ed>=right) return seg_tree[k];\r\n\tLL mid = (left+right)>>1;\r\n\treturn (find(k<<1,left,mid,st,ed)^find(k<<1|1,mid+1,right,st,ed));\r\n}\r\nint main(){\r\n\t//fre;\r\n\tscanf(\""%lld%lld\"",&n,&q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%lld\"",&a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=0;i<q;i++){\r\n\t\tint a,b;\r\n\t\tscanf(\""%d%d\"",&a,&b);\r\n\t\tprintf(\""%lld\\n\"",find(1,1,n,a,b));\r\n\t}\r\n\treturn 0;\r\n} ",ACCEPTED,560,27136
1127394233555447808,49989a4e38586e52e86d0f817b82634bc81ab8b8149f9c3651ba471978bdf6e9,2019-05-12 10:05:05,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nlong long int num[100005][2]={0};\r\n\r\nint main(){\r\n    long long int n,q;\r\n    scanf(\""%lld %lld\"",&n,&q);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&num[i][0]);\r\n        if(i==0){\r\n            num[i][1]=num[i][0];\r\n        }\r\n        else {\r\n            num[i][1]=num[i][0]^num[i-1][1];\r\n        }\r\n    }\r\n    //for(int i=0;i<n;i++)printf(\""%d \"",num[i][1]);printf(\""\\n\"");\r\n    for(int i=0;i<q;i++){\r\n        int l,r;\r\n        scanf(\""%d %d\"",&l,&r);\r\n        if(l==1)printf(\""%lld\\n\"",num[r-1][1]);\r\n        else\r\n        printf(\""%lld\\n\"",num[r-1][1]^num[l-2][1]);\r\n    }\r\n    return 0;\r\n}\r\n",SEGMENTATION_FAULT,33,2044
1127394795994836992,49989a4e38586e52e86d0f817b82634bc81ab8b8149f9c3651ba471978bdf6e9,2019-05-12 10:07:20,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nlong long int num[1000005][2]={0};\r\nint main(){\r\n    int n,q;\r\n    int l,r;\r\n    scanf(\""%d %d\"",&n,&q);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&num[i][0]);\r\n        if(i==0){\r\n            num[i][1]=num[i][0];\r\n        }\r\n        else {\r\n            num[i][1]=num[i][0]^num[i-1][1];\r\n        }\r\n    }\r\n    for(int i=0;i<q;i++){\r\n        scanf(\""%d %d\"",&l,&r);\r\n        if(l==1) printf(\""%lld\\n\"",num[r-1][1]);\r\n        else     printf(\""%lld\\n\"",num[r-1][1]^num[l-2][1]);\r\n    }\r\n    return 0;\r\n}\r\n",ACCEPTED,509,16340
1127395145539743744,37585eca3da6b283afa247f08bd0230d7b706a069e6d158a7f5431abac7b4b44,2019-05-12 10:08:43,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <bits/stdc++.h>\r\nusing namespace std;\r\nint a[1000005],sum[1000005];\r\n#define low(x) (x)&(-x)\r\n\r\nint main(){\r\n    int n,m,cnt=0,l,r;\r\n    scanf(\""%d%d\"",&n,&m);\r\n    for(int i=1;i<=n;i++){\r\n        scanf(\""%d\"",&a[i]);\r\n    }\r\n    for(int i=1;i<=m;i++){\r\n        cnt^=a[i];\r\n        sum[i]=cnt;\r\n    }\r\n    while(m--){\r\n        scanf(\""%d%d\"",&l,&r);\r\n        printf(\""%d\\n\"",sum[r]^sum[l-1]);\r\n    }\r\n    return 0;\r\n}\r\n",WRONG_ANSWER,171,6112
1127395506774175744,a8304374cc0597beb49c111c0a0edf280ede9a8b59deefa3465817462e5e86e0,2019-05-12 10:10:09,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\nusing namespace std;\r\nint main()\r\n{\r\n\tint n,count=0;\r\n\tcin>>n;\r\n\twhile(n)\r\n\t{\r\n\t\tcount+=1;\r\n\t\tn/=2;\r\n\t}\r\n\tcout<<count;\r\n\treturn 0;\r\n}",ACCEPTED,10,384
1127395616723660800,8ba586620994c1404118462b1badfb1594f65765b19ad2ace447269b71553946,2019-05-12 10:10:35,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\n#include<map>\r\nusing namespace std;\r\nint a[1000005];\r\nint tree[5000005];\r\nvoid build(int r,int a[],int s,int e)\r\n{\r\n\tif(s==e)\r\n\ttree[r]=a[s];\r\n\telse\r\n\t{\r\n\t\tint mid=(s+e)/2;\r\n\t\tbuild(2*r+1,a,s,mid);\r\n\t\tbuild(2*r+2,a,mid+1,e);\r\n\t\ttree[r]=tree[2*r+1]^tree[2*r+2];\r\n\t}\r\n}\r\nint query(int r,int s,int e,int qs,int qe)\r\n{\r\n\tif(s>qe||e<qs)\r\n\treturn 0;\r\n\tif(s>=qs&&e<=qe)\r\n\treturn tree[r];\r\n\tint mid=(s+e)/2;\r\n\tint left=query(2*r+1,s,mid,qs,qe);\r\n\tint right=query(2*r+2,mid+1,e,qs,qe);\r\n\treturn (left^right);\r\n}\r\nint main()\r\n{\r\n\tint n,q;\r\n\tcin>>n>>q;\r\n\tfor(int i=0;i<n;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\t}\r\n\tbuild(0,a,0,n-1);\r\n\twhile(q--)\r\n\t{\r\n\t\tint qs,qe;\r\n\t\tscanf(\""%d%d\"",&qs,&qe);\r\n\t\tint ans=query(0,0,n-1,qs-1,qe-1);\r\n\t\tprintf(\""%d\\n\"",ans);\r\n\t}\r\n\treturn 0;\r\n } ",ACCEPTED,565,15860
1127396609339256832,56ad04e7aea44f55046251a22019aea68dc6128fbf3e538b3f0f9b3d129a555f,2019-05-12 10:14:32,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <cstdio>\r\n\r\nint num[1100000], sum[1100000];\r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\tsum[0] = 0;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor(int i = 1; i <= n; i++)\r\n\t{\r\n\t\tscanf(\""%d\"", &num[i]);\r\n\t\tsum[i] = num[i] ^ sum[i - 1];\r\n\t}\r\n\tfor(int i = 0; i < q; i++)\r\n\t{\r\n\t\tint a, b;\r\n\t\tscanf(\""%d%d\"", &a, &b);\r\n\t\tprintf(\""%d\\n\"", sum[b] ^ sum[a - 1]);\r\n\t}\r\n\treturn 0;\r\n}\r\n",ACCEPTED,518,12692
1127396829791875072,37585eca3da6b283afa247f08bd0230d7b706a069e6d158a7f5431abac7b4b44,2019-05-12 10:15:24,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <bits/stdc++.h>\r\nusing namespace std;\r\nint a[1000005],sum[1000005];\r\n#define low(x) (x)&(-x)\r\n\r\nint main(){\r\n    int n,m,cnt=0,l,r;\r\n    scanf(\""%d%d\"",&n,&m);\r\n    for(int i=1;i<=n;i++){\r\n        scanf(\""%d\"",&a[i]);\r\n    }\r\n    for(int i=1;i<=n;i++){\r\n        cnt^=a[i];\r\n        sum[i]=cnt;\r\n    }\r\n    while(m--){\r\n        scanf(\""%d%d\"",&l,&r);\r\n        printf(\""%d\\n\"",sum[r]^sum[l-1]);\r\n    }\r\n    return 0;\r\n}\r\n",ACCEPTED,509,12932
1127398835470299136,bbe121ac19634caeeed4004e3a1abe8278fc8f0d7e35d125336e63e024e91fe2,2019-05-12 10:23:23,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include<cstdio>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint n,q;\r\nint a[1000005];\r\nint x,y;\r\nint sum[4000006];\r\nlong long sums=0;\r\nvoid push_up(int o){\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nsum[o]=sum[lc]^sum[rc];\r\n}\r\nvoid build(int o,int l,int r){\r\nif(l==r){\r\n    sum[o]=a[l];\r\n}\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nint mid=(l+r)>>1;\r\nbuild(lc,l,mid);\r\nbuild(rc,mid+1,r);\r\npush_up(o);\r\n}\r\nvoid query(int o,int l,int r){\r\nif(x<=l&&y>=r){\r\n    sums^=sum[o];\r\n    }\r\nint mid=(l+r)>>1;\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nif(x<=mid){\r\n    query(lc,l,mid);\r\n}\r\nif(y>mid)\r\n    query(rc,mid+1,r);\r\n}\r\nint main()\r\n{\r\n    for(int i=1;i<=n;i++){\r\n    scanf(\""%d\"",&a[i]);\r\n    }\r\n    build(1,1,n);\r\n    for(int i=0;i<q;i++){\r\n     scanf(\""%d%d\"",&x,&y);\r\n      sums=0;\r\n     query(1,1,n);\r\n     cout<<sums<<endl;\r\n    }\r\n    return 0;\r\n}\r\n\r\n",SEGMENTATION_FAULT,9,8572
1127399538947354624,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 10:26:10,Java,0.0,1127197494785449984,1125976118128910336,976506807128301568,import java.util.*;\r\npublic class Main {\r\n\tpublic static void main(String [] args){\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint n = input.nextInt();\r\n\t\tint q = input.nextInt();\r\n\t\tint [] num = new int [n];\r\n\t\tfor(int i=0;i<n;i++){\r\n\t\t\tnum[i]=input.nextInt();\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint a = input.nextInt();\r\n\t\t\tint b = input.nextInt();\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tresult = result^num[j];\r\n\t\t\t}\r\n\t\t\tSystem.out.println(result);\r\n\t\t}\r\n\t\t\r\n\t}\r\n}\r\n,MEMORY_LIMIT_EXCEEDED,1039,66984
1127401205667295232,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 10:32:48,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#define ll long long int \r\n#include <cstdio>\r\n\r\nusing namespace std;\r\n\r\nint a[4000020];\r\nll seg[4000020];\r\nll tag[4000020];\r\n\r\ninline ll lc(ll p){\r\n\treturn p<<1;\r\n}\r\n\r\ninline ll rc(ll p){\r\n\treturn p<<1|1;\r\n}\r\n\r\ninline void push_up(ll p){\r\n\tseg[p]=seg[lc(p)]^seg[rc(p)];\r\n}\r\n\r\nvoid build(ll p, ll b, ll e){\r\n\ttag[p]=0;\r\n\tif(b==e){\r\n\t\tseg[p]=a[b];\r\n\t\treturn;\r\n\t} \r\n\tll mid = (b+e)>>1;\r\n\tbuild(lc(p), b, mid);\r\n\tbuild(rc(p), mid+1, e);\r\n\tpush_up(p);\r\n}\r\n\r\n\r\nll query(ll p, ll b,ll e, ll nb, ll ne){\r\n\tll res=0;\r\n\tif(nb <= b&&e<=ne){\r\n\t\treturn seg[p];\r\n\t}\r\n\tll mid = (b+e)>>1;\r\n\t//cout << b << \"" \"" << e << \"" \"" << mid << endl;\r\n\tif(nb<=mid) {\r\n\t\tll temp=query(lc(p),b,mid,nb,ne);\r\n\t\tres = res^temp;\r\n\t}\r\n\tif(ne>=mid+1){\r\n\t\tll temp=query(rc(p), mid+1, e, mid+1, ne);\r\n\t\tres = res^temp;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nint main(){\r\n\tint n, q, l, r;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tcout << query(1,1,n,l, r) << endl;;\r\n\t}\r\n\treturn 0;\r\n}",WRONG_ANSWER,22,5108
1127401390728376320,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 10:33:32,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint a[100000];\r\nint main()\r\n{\r\n    int n,l,r,m;\r\n    long long ans=0;\r\n  //  cout<<(55^447+7);\r\n    //cout<<(447^7);\r\n    scanf(\""%d%d\"",&n,&m);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%d\"",&a[i]);\r\n\r\n\r\n    }\r\n    for(int i=0;i<m;i++)\r\n    {\r\n        ans=0;\r\n        scanf(\""%d%d\"",&l,&r);\r\n\r\n        if((r-l)&1)//ji\r\n\r\n        {\r\n                    for(int j=l-1;j<r-1;j++)\r\n            {\r\n           // cout<<a[j]<<a[j+1];\r\n            ans+=(a[j]^a[j+1]);\r\n\r\n            }\r\n\r\n        }\r\n        else\r\n            {\r\n                ans+=a[r-1];\r\n                for(int j=l-1;j<r-2;j++)\r\n                {\r\n                    ans+=(a[j]^a[j+1]);\r\n\r\n                }\r\n            }\r\n            cout<<ans<<endl;\r\n       // for(int )\r\n    }\r\n\r\n\r\n    return 0;\r\n}\r\n",WRONG_ANSWER,57,856
1127401730022404096,bbe121ac19634caeeed4004e3a1abe8278fc8f0d7e35d125336e63e024e91fe2,2019-05-12 10:34:53,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include <iostream>\r\n#include<cstdio>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint n,q;\r\nint a[1000005];\r\nint x,y;\r\nint sum[4000006];\r\nlong long sums=0;\r\nvoid push_up(int o){\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nsum[o]=sum[lc]^sum[rc];\r\n}\r\nvoid build(int o,int l,int r){\r\nif(l==r){\r\n    sum[o]=a[l];\r\n}\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nint mid=(l+r)>>1;\r\nbuild(lc,l,mid);\r\nbuild(rc,mid+1,r);\r\npush_up(o);\r\n}\r\nvoid query(int o,int l,int r){\r\nif(x<=l&&y>=r){\r\n    sums^=sum[o];\r\n    }\r\nint mid=(l+r)>>1;\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nif(x<=mid){\r\n    query(lc,l,mid);\r\n}\r\nif(y>mid)\r\n    query(rc,mid+1,r);\r\n}\r\nint main()\r\n{\r\n    cin>>n>>q;\r\n    for(int i=1;i<=n;i++){\r\n        cin>>a[i];\r\n    //scanf(\""%d\"",&a[i]);\r\n    }\r\n    build(1,1,n);\r\n    for(int i=0;i<q;i++){\r\n     scanf(\""%d%d\"",&x,&y);\r\n      sums=0;\r\n     query(1,1,n);\r\n     cout<<sums<<endl;\r\n    }\r\n    return 0;\r\n}\r\n\r\n",SEGMENTATION_FAULT,12,10868
1127401968581832704,bbe121ac19634caeeed4004e3a1abe8278fc8f0d7e35d125336e63e024e91fe2,2019-05-12 10:35:50,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include <iostream>\r\n#include<cstdio>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint n,q;\r\nint a[100005];\r\nint x,y;\r\nint sum[400006];\r\nlong long sums=0;\r\nvoid push_up(int o){\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nsum[o]=sum[lc]^sum[rc];\r\n}\r\nvoid build(int o,int l,int r){\r\nif(l==r){\r\n    sum[o]=a[l];\r\n}\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nint mid=(l+r)>>1;\r\nbuild(lc,l,mid);\r\nbuild(rc,mid+1,r);\r\npush_up(o);\r\n}\r\nvoid query(int o,int l,int r){\r\nif(x<=l&&y>=r){\r\n    sums^=sum[o];\r\n    }\r\nint mid=(l+r)>>1;\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nif(x<=mid){\r\n    query(lc,l,mid);\r\n}\r\nif(y>mid)\r\n    query(rc,mid+1,r);\r\n}\r\nint main()\r\n{\r\n    cin>>n>>q;\r\n    for(int i=1;i<=n;i++){\r\n        cin>>a[i];\r\n    //scanf(\""%d\"",&a[i]);\r\n    }\r\n    build(1,1,n);\r\n    for(int i=0;i<q;i++){\r\n     scanf(\""%d%d\"",&x,&y);\r\n      sums=0;\r\n     query(1,1,n);\r\n     cout<<sums<<endl;\r\n    }\r\n    return 0;\r\n}\r\n\r\n",SEGMENTATION_FAULT,12,748
1127402089440702464,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 10:36:18,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint a[100000];\r\nint main()\r\n{\r\n    long long n,l,r,m;\r\n    long long ans=0;\r\n  //  cout<<(55^447+7);\r\n    //cout<<(447^7);\r\n    scanf(\""%lld%lld\"",&n,&m);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&a[i]);\r\n\r\n\r\n    }\r\n    for(int i=0;i<m;i++)\r\n    {\r\n        ans=0;\r\n        scanf(\""%lld%lld\"",&l,&r);\r\n\r\n        if((r-l)&1)//ji\r\n\r\n        {\r\n                    for(int j=l-1;j<r-1;j++)\r\n            {\r\n           // cout<<a[j]<<a[j+1];\r\n            ans+=(a[j]^a[j+1]);\r\n\r\n            }\r\n\r\n        }\r\n        else\r\n            {\r\n                ans+=a[r-1];\r\n                for(int j=l-1;j<r-2;j++)\r\n                {\r\n                    ans+=(a[j]^a[j+1]);\r\n\r\n                }\r\n            }\r\n            printf(\""%lld\\n\"",ans);\r\n       // for(int )\r\n    }\r\n\r\n\r\n    return 0;\r\n}\r\n",WRONG_ANSWER,50,640
1127402494115540992,42f17ffa1f72526ed7daa3e88d6f4fecdc67729447a6106c37ce3df2d48db904,2019-05-12 10:37:55,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\nusing namespace std;\r\nint sum[1000005];\r\nint main(){\r\n\tint n,q;\r\n\t\r\n\tsum[0]=0;\r\n\twhile(~scanf(\""%d %d\"",&n,&q)){\r\n\t\tfor(int i=1;i<=n;i++){\r\n\t\t\tint tmp;\r\n\t\t\tscanf(\""%d\"",&tmp);\r\n\t\t\tsum[i]=sum[i-1]^tmp;\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint l,r;\r\n\t\t\tscanf(\""%d %d\"",&l,&r);\r\n\t\t\tcout<<(int)(sum[l-1]^sum[r])<<endl;\r\n\t\t}\r\n\t}\r\n    return 0; \r\n}",TIME_LIMIT_EXCEEDED,198,4588
1127402594606870528,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 10:38:19,Java,0.0,1127197494785449984,1125976118128910336,976506807128301568,import java.util.*;\r\n\r\npublic class Main {\r\n\tpublic static void main(String [] args){\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint n = input.nextInt();\r\n\t\tint q = input.nextInt();\r\n\t\tint [] num = new int [n];\r\n\t\tfor(int i=0;i<n;i++){\r\n\t\t\tnum[i]=input.nextInt();\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint a = input.nextInt();\r\n\t\t\tint b = input.nextInt();\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\t//Thread.sleep(5);\r\n\t\t\t\ttry{\r\n\t\t\t\t\tThread.sleep(5);\r\n\t\t\t\t}catch(InterruptedException e){\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tresult = result^num[j];\r\n\t\t\t}\r\n\t\t\tSystem.out.println(result);\r\n\t\t}\r\n\t}\r\n}\r\n,TIME_LIMIT_EXCEEDED,0,0
1127402812844896256,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 10:39:11,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<bits/stdc++.h>\r\nusing namespace std;\r\nint a[1000005];\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n,m;\r\n\tcin>>n>>m;\r\n\tfor(int i=1;i<=n;i++)\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\tint l,r;\r\n\tfor(int i=0;i<m;i++){\r\n\t\tcin>>l>>r;\r\n\t\tif(l==r){\r\n\t\t\tcout<<a[r]<<endl;\r\n\t\t\tcontinue; \r\n\t\t}\r\n\t\telse{\r\n\t\t\tint t=1,mx=0,num=0,ans=0;\r\n\t\t\tfor(int i=l;i<=r;i++){\r\n\t\t\t\tmx=max(a[i],mx);\r\n\t\t\t}\r\n\t\t\tfor(int i=1;i<100000;i++){\r\n\t\t\t\tif((pow(2,i)>mx)){\r\n\t\t\t\t\tnum=i;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j=1;j<=num;j++){\r\n\t\t\t\tint tmp=0;\r\n\t\t\t\tfor(int i=l;i<=r;i++){\r\n\t\t\t\t\tint ff=(a[i]&t);\r\n\t\t\t\t\tif(ff>=1)\r\n\t\t\t\t\t\ttmp++;\r\n\t\t\t\t}\r\n\t\t\t\tif(tmp%2==1)\r\n\t\t\t\t\tans+=t;\r\n\t\t\t\tt=t*2;\t\r\n\t\t\t}\r\n\t\t\tcout<<ans<<endl;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,1582,4468
1127402913277505536,bbe121ac19634caeeed4004e3a1abe8278fc8f0d7e35d125336e63e024e91fe2,2019-05-12 10:39:35,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include <iostream>\r\n#include<cstdio>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint n,q;\r\nint a[1000005];\r\nint x,y;\r\nint sum[4000006];\r\nlong long sums=0;\r\nvoid push_up(int o){\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nsum[o]=sum[lc]^sum[rc];\r\n}\r\nvoid build(int o,int l,int r){\r\nif(l==r){\r\n    sum[o]=a[l];\r\n    return;\r\n}\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nint mid=(l+r)>>1;\r\nbuild(lc,l,mid);\r\nbuild(rc,mid+1,r);\r\npush_up(o);\r\n}\r\nvoid query(int o,int l,int r){\r\nif(x<=l&&y>=r){\r\n    sums^=sum[o];\r\n    return;\r\n    }\r\nint mid=(l+r)>>1;\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nif(x<=mid){\r\n    query(lc,l,mid);\r\n}\r\nif(y>mid)\r\n    query(rc,mid+1,r);\r\n}\r\nint main()\r\n{\r\n    cin>>n>>q;\r\n    for(int i=1;i<=n;i++){\r\n       // cin>>a[i];\r\n    scanf(\""%d\"",&a[i]);\r\n    }\r\n    build(1,1,n);\r\n    for(int i=0;i<q;i++){\r\n     scanf(\""%d%d\"",&x,&y);\r\n      sums=0;\r\n     query(1,1,n);\r\n     cout<<sums<<endl;\r\n    }\r\n    return 0;\r\n}\r\n\r\n",TIME_LIMIT_EXCEEDED,201,15920
1127402975168655360,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 10:39:50,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#define ll long long int \r\n#include <cstdio>\r\n\r\nusing namespace std;\r\n\r\nint a[4000020];\r\nint seg[4000020];\r\nint tag[4000020];\r\n\r\ninline ll lc(ll p){\r\n\treturn p<<1;\r\n}\r\n\r\ninline ll rc(ll p){\r\n\treturn p<<1|1;\r\n}\r\n\r\ninline void push_up(ll p){\r\n\tseg[p]=seg[lc(p)]^seg[rc(p)];\r\n}\r\n\r\nvoid build(ll p, ll b, ll e){\r\n\ttag[p]=0;\r\n\tif(b==e){\r\n\t\tseg[p]=a[b];\r\n\t\treturn;\r\n\t} \r\n\tll mid = (b+e)>>1;\r\n\tbuild(lc(p), b, mid);\r\n\tbuild(rc(p), mid+1, e);\r\n\tpush_up(p);\r\n}\r\n\r\n\r\nll query(ll p, ll b,ll e, ll nb, ll ne){\r\n\tint res=0;\r\n\tif(nb <= b&&e<=ne){\r\n\t\treturn seg[p];\r\n\t}\r\n\tll mid = (b+e)>>1;\r\n\tif(nb<=mid) res = res^query(lc(p),b,mid,nb,ne);\r\n\tif(ne>=mid+1)res = res^query(rc(p), mid+1, e, mid+1, ne);\r\n\treturn res;\r\n}\r\n\r\nint main(){\r\n\tll n, q, l, r;\r\n\tscanf(\""%lld%lld\"", &n, &q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%lld%lld\"", &l, &r);\r\n\t\tcout << query(1,1,n,l, r) << endl;;\r\n\t}\r\n\treturn 0;\r\n}",WRONG_ANSWER,22,4640
1127404186240380928,1ca566e2913c6507ed4344fa677619bff7adea5b638b759f777cf0310b6d772a,2019-05-12 10:44:38,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nlong long int a[1000002];\r\nint main()\r\n{\r\n\tlong long int n,q,i ,sum,l,r,m,end;\r\n\tscanf(\""%lld %lld\"",&n,&q);\r\n\tfor(i=0;i<n;i++)\r\n\tscanf(\""%lld\"",&a[i]);\r\n\twhile(q--)\r\n\t{\r\n\t\tscanf(\""%lld %lld\"",&l,&r);\r\n\t\tif(l-r==0)\r\n\t\tprintf(\""%d\\n\"",a[l-1]);\r\n\t\telse \r\n\t\t{\r\n\t\t\tfor(i=l-1;i<r;i++)\r\n\t\t\t{\r\n\t\t\t\tif(i==l-1)\r\n\t\t\t\tm=a[i];\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tm=m^a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\tprintf(\""%lld\\n\"",m);\t\r\n\t}\r\n\t\r\n\treturn 0;\r\n } ",WRONG_ANSWER,30,416
1127404387667636224,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 10:45:26,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<bits/stdc++.h>\r\nusing namespace std;\r\nint a[1000005];\r\nint main(){\r\n//\tfreopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n,m;\r\n\tcin>>n>>m;\r\n\tfor(int i=1;i<=n;i++)\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\tint l,r;\r\n\tfor(int i=0;i<m;i++){\r\n\t\tscanf(\""%d%d\"",&l,&r);\r\n\t\tif(l==r){\r\n\t\t\tcout<<a[r]<<endl;\r\n\t\t\tcontinue; \r\n\t\t}\r\n\t\telse{\r\n\t\t\tint t=1,mx=0,num=0,ans=0;\r\n\t\t\tfor(int i=l;i<=r;i++){\r\n\t\t\t\tmx=max(a[i],mx);\r\n\t\t\t}\r\n\t\t\tfor(int i=1;i<100000;i++){\r\n\t\t\t\tif((pow(2,i)>mx)){\r\n\t\t\t\t\tnum=i;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor(int j=1;j<=num;j++){\r\n\t\t\t\tint tmp=0;\r\n\t\t\t\tfor(int i=l;i<=r;i++){\r\n\t\t\t\t\tif(a[i]&t)\r\n\t\t\t\t\t\ttmp++;\r\n\t\t\t\t}\r\n\t\t\t\tif(tmp%2==1)\r\n\t\t\t\t\tans+=t;\r\n\t\t\t\tt=t*2;\t\r\n\t\t\t}\r\n\t\t\tcout<<ans<<endl;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,1371,4468
1127404415958216704,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 10:45:33,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint main(){\r\n\tint n,z=0,m,q,a,b,t;\r\n\tcin>>n>>q;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n}\r\nfor(int i=1;i<=q;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tt=g[a];\r\n\tfor(int j=a+1;j<=b;j++){\r\n\t\tt=t|g[j];\r\n\t}\r\nsum[i]=t;\r\n}\r\n\t\r\n}\r\nfor(int i=1;i<=n;i++)\r\n\tif(i!=n) cout<<sum[i]<<endl;\r\n\telse cout<<sum[i];\r\n\treturn 0;\r\n}",WRONG_ANSWER,64,2804
1127404533373562880,1ca566e2913c6507ed4344fa677619bff7adea5b638b759f777cf0310b6d772a,2019-05-12 10:46:01,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nlong long int a[1000002];\r\nint main()\r\n{\r\n\tlong long int n,q,i ,sum,l,r,m,end;\r\n\tscanf(\""%lld %lld\"",&n,&q);\r\n\tfor(i=0;i<n;i++)\r\n\tscanf(\""%lld\"",&a[i]);\r\n\twhile(q--)\r\n\t{\r\n\t\tscanf(\""%lld %lld\"",&l,&r);\r\n\t\tif(l-r==0)\r\n\t\tm=a[l-1];\r\n\t\telse \r\n\t\t{\r\n\t\t\tfor(i=l-1;i<r;i++)\r\n\t\t\t{\r\n\t\t\t\tif(i==l-1)\r\n\t\t\t\tm=a[i];\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tm=m^a[i];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\tprintf(\""%lld\\n\"",m);\t\r\n\t}\r\n\t\r\n\treturn 0;\r\n } ",TIME_LIMIT_EXCEEDED,517,10752
1127405845075030016,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 10:51:14,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint a[100000];\r\nint main()\r\n{\r\n    long long n,l,r,m;\r\n    long long ans=0;\r\n//    cout<<(392^7);\r\n\r\n    scanf(\""%lld%lld\"",&n,&m);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&a[i]);\r\n\r\n\r\n    }\r\n    for(int i=0;i<m;i++)\r\n    {\r\n        ans=0;\r\n        scanf(\""%lld%lld\"",&l,&r);\r\n        for(int j=l-1;j<r;j++)\r\n        {\r\n            ans^=a[j];\r\n\r\n        }\r\n        cout<<ans<<endl;\r\n    }\r\n    return 0;\r\n}\r\n",SEGMENTATION_FAULT,72,896
1127405891845713920,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 10:51:25,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint main(){\r\n\tint n,z=0,m,q,a,b,t,w;\r\n\tcin>>n>>q;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n}\r\nfor(int i=1;i<=q;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tt=g[a];\r\n\tfor(int j=a+1;j<=b;j++){\r\n\t\tt=t^g[j];\r\n\t}\r\nsum[i]=t;\r\n}\t\r\n}\r\nfor(int i=1;i<=q;i++)\r\n\tif(i!=n) cout<<sum[i]<<endl;\r\n\telse cout<<sum[i];\r\n\treturn 0;\r\n}",PRESENTATION_ERROR,682,4724
1127406007159713792,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 10:51:52,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint a[1000005];\r\nint main()\r\n{\r\n    long long n,l,r,m;\r\n    long long ans=0;\r\n//    cout<<(392^7);\r\n\r\n    scanf(\""%lld%lld\"",&n,&m);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&a[i]);\r\n\r\n\r\n    }\r\n    for(int i=0;i<m;i++)\r\n    {\r\n        ans=0;\r\n        scanf(\""%lld%lld\"",&l,&r);\r\n        for(int j=l-1;j<r;j++)\r\n        {\r\n            ans^=a[j];\r\n\r\n        }\r\n        cout<<ans<<endl;\r\n    }\r\n    return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,246,4132
1127406137539653632,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 10:52:24,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <stdio.h>\r\n\r\nint main(){\r\n\tint n, cnt, tmp;\r\n\tscanf(\""%d\"", &n);\r\n\tcnt = 1;\r\n\ttmp = 1;\r\n\twhile(n > tmp){\r\n\t\ttmp = (tmp + 1) * 2 - 1;\r\n\t\tcnt ++;\r\n\t}\r\n\tprintf(\""%d\\n\"", cnt);\r\n\treturn 0;\r\n}",ACCEPTED,9,384
1127406158838329344,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 10:52:29,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#define ll long long int \r\n#include <cstdio>\r\n\r\nusing namespace std;\r\n\r\nint a[4000020];\r\nint seg[4000020];\r\nint tag[4000020];\r\n\r\ninline ll lc(ll p){\r\n\treturn p<<1;\r\n}\r\n\r\ninline ll rc(ll p){\r\n\treturn p<<1|1;\r\n}\r\n\r\ninline void push_up(ll p){\r\n\tseg[p]=seg[lc(p)]^seg[rc(p)];\r\n}\r\n\r\nvoid build(ll p, ll b, ll e){\r\n\ttag[p]=0;\r\n\tif(b==e){\r\n\t\tseg[p]=a[b];\r\n\t\treturn;\r\n\t} \r\n\tll mid = (b+e)>>1;\r\n\tbuild(lc(p), b, mid);\r\n\tbuild(rc(p), mid+1, e);\r\n\tpush_up(p);\r\n}\r\n\r\n\r\nint query(ll p, ll b,ll e, ll nb, ll ne){\r\n\tint res=0;\r\n\tif(nb <= b&&e<=ne){\r\n\t\treturn seg[p];\r\n\t}\r\n\tll mid = (b+e)>>1;\r\n\tif(nb<=mid) {\r\n\t\tres = res^query(lc(p),b,mid,nb,ne);\r\n\t}\r\n\tif(ne>=mid+1){\r\n\t\tres = res^query(rc(p), mid+1, e, mid+1, ne);\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nint main(){\r\n\tll n, q, l, r;\r\n\tscanf(\""%lld%lld\"", &n, &q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%lld%lld\"", &l, &r);\r\n\t\tif(i==0) printf(\""%d\"",query(1,1,n,l, r));\r\n\t\telse printf(\""\\n%d\"",query(1,1,n,l, r));\r\n\t}\r\n\treturn 0;\r\n}",WRONG_ANSWER,8,4712
1127406523243655168,db72cc2d20f82713b850b2a4f58b32d38cade8070b18371530c9d819cd20e7e0,2019-05-12 10:53:56,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\n#include<cmath>\r\nusing namespace std;\r\nint q,n;\r\nint res[1000004];\r\nint main(){\r\n    //int a=(447)^(55)^(447);\r\n    //cout<<a;\r\n    scanf(\""%d%d\"",&n,&q);\r\n    for(int i=0;i<n;i++){\r\n    \tint tmp;\r\n\t\tscanf(\""%d\"",&tmp);\r\n\t    if(i>0) {\r\n\t     res[i]=res[i-1]^tmp;\t\r\n\t    }\r\n\t    else{\r\n\t     res[0]=tmp;\r\n\t    }\r\n\t    //cout<<res[i]<<\"" \"";\r\n    }\r\n    for(int i=0;i<q;i++){\r\n    \tint l,r;\r\n    \tscanf(\""%d%d\"",&l,&r);\r\n    \tl-=1;\r\n    \tr-=1;\r\n    \tif(r==0){\r\n    \t printf(\""%d\\n\"",res[0]);\r\n    \t continue;\r\n    \t}\r\n    \tif(l==0){\r\n    \t\tprintf(\""%d\\n\"",res[r]);\r\n    \t\tcontinue;\r\n    \t}\r\n    \tif(l>0){\r\n    \t  int s=res[r]^res[l-1];\r\n\t\t  printf(\""%d\\n\"",s);\r\n    \t}\r\n    }\r\n\treturn 0;\r\n}\r\n ",ACCEPTED,480,10752
1127406535038038016,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 10:53:58,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint main(){\r\n\tint n,q,a,b,t;\r\n\tcin>>n>>q;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n}\r\nfor(int i=1;i<=q;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tt=g[a];\r\n\tfor(int j=a+1;j<=b;j++){\r\n\t\tt=t^g[j];\r\n\t}\r\nsum[i]=t;\r\n}\t\r\n}\r\nfor(int i=1;i<=q;i++)\r\n\tif(i!=q) cout<<sum[i]<<endl;\r\n\telse cout<<sum[i];\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,688,4500
1127406910591823872,2e1ae774448c7cbb694103b08792d72151180d1fe7b1e8ac970c84862c2f2c98,2019-05-12 10:55:28,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint n;\r\nvector<int> arr;\r\nint q;\r\nint main()\r\n{\r\n\tcin>>n>>q;int v=0;\r\n\tarr.push_back(v);\r\n\tfor(int i=0;i<n;i++){\r\n\t\tcin>>v;\r\n\t\tarr.push_back(v);\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\t//异或\r\n\t\tint l,r;int ans;\r\n\t\tcin>>l>>r;\r\n\t\tif(l==r) cout<<arr[l]<<endl;\r\n\t\telse{\r\n\t\t\t\tans=arr[l];\r\n\t\tfor(int i=l+1;i<=r;i++){\r\n\t\t\tans=(ans^arr[i]);\r\n\t\t}\r\n\t\tcout<<ans<<endl;\t\r\n\t\t}\r\n\r\n\t} \r\n\treturn 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,690,4596
1127406917374013440,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 10:55:29,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdio>\r\n#define ll long long int\r\n\r\nusing namespace std;\r\n\r\nint a[4000020];\r\nint seg[4000020];\r\n\r\nint main(){\r\n\tll n, q, l, r;\r\n\tscanf(\""%lld%lld\"", &n, &q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%lld%lld\"", &l, &r);\r\n\t\tint ans=0;\r\n\t\tfor(ll i=l;i<=r;i++){\r\n\t\t\tans = ans^a[i];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", ans);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,522,12800
1127407382362943488,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 10:57:20,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<bits/stdc++.h>\r\nusing namespace std;\r\nint a[1000005];\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint n,m;\r\n\tcin>>n>>m;\r\n\tfor(int i=1;i<=n;i++)\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\tint l,r;\r\n\tfor(int i=0;i<m;i++){\r\n\t\tscanf(\""%d%d\"",&l,&r);\r\n\t\tif(l==r){\r\n\t\t\tcout<<a[r]<<endl;\r\n\t\t\tcontinue; \r\n\t\t}\r\n\t\telse{\r\n\t\t\tint t=1,mx=0,num=0,ans=0;\r\n//\t\t\tfor(int i=l;i<=r;i++){\r\n//\t\t\t\tmx=max(a[i],mx);\r\n//\t\t\t\tnum=i;\r\n//\t\t\t}\r\n\t\t\tfor(int i=l;i<=r;i++){\r\n\t\t\t\t//if(i!=num)\r\n\t\t\t\t\tmx=mx^a[i];\r\n\t\t\t}\r\n\t\t\tcout<<mx<<endl;\r\n\t\t}\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,1739,11028
1127407848178151424,f82a2971d09c42067faf0ede8a4b560bc66eb8858d9880a503ded107fd4609c7,2019-05-12 10:59:11,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\nusing namespace std;\r\n\r\nstatic int m[1000009] ;\r\n\r\nint main()\r\n{\r\n    int a,b;\r\n    int n;\r\n    int l,r;\r\n    int q;\r\n    cin>>n>>q;\r\n    for(int i=1; i<=n; ++i)\r\n        cin>>m[i];\r\n    for(int i=1; i<=q; ++i)\r\n    {\r\n        cin>>l>>r;\r\n        int p=m[l];\r\n        for(int j=l+1; j<=r; ++j)\r\n        {\r\n            p=p^m[j];\r\n        }\r\n        cout<<p<<endl;\r\n    }\r\n\r\n\r\n    return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,686,4540
1127408283798564864,5815a2f766bf69d88350a22c389c096970be3d02e533db608557739c4a357cef,2019-05-12 11:00:55,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\nusing namespace std;\r\n#include<math.h>\r\n#include<stdio.h> \r\n#include<vector>\r\n#define MAXN 1000005\r\nint tree[MAXN*4];\r\nint a[MAXN];\r\nint cal(int a,int b);\r\nvoid build(int p,int l,int r);\r\nint find(int p,int l,int r,int x,int y);\r\nvector<int> binary(int a);\r\nint n,q;\r\nint main(){\r\n\tcin>>n>>q;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tint l,r;\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%d %d\"",&l,&r);\r\n\t\tcout<<find(1,1,n,l,r)<<endl;\r\n\t}\r\n\treturn 0;\r\n}\r\nvoid build(int p,int l,int r){\r\n\tif(l==r){\r\n\t\ttree[p]=a[l];\r\n\t\treturn;\r\n\t}\r\n\tint mid=(l+r)>>1;\r\n\tbuild(p<<1,l,mid);\r\n\tbuild(p<<1|1,mid+1,r);\r\n\ttree[p]=cal(tree[p<<1],tree[p<<1|1]);\r\n}\r\nint find(int p,int l,int r,int x,int y){\r\n\tif(x<=1&&y>=r)return tree[p];\r\n\tint mid=(l+r)>>1;\r\n\tif(y<=mid)return find(p<<1,l,mid,x,y);\r\n\tif(x>mid)return find(p<<1|1,mid+1,r,x,y);\r\n\treturn cal(find(p<<1,l,mid,x,mid),find(p<<1|1,mid+1,r,mid+1,y));\r\n}\r\nint cal(int a,int b){\r\n\tvector<int> va=binary(a);\r\n\tvector<int> vb=binary(b);\r\n\tvector<int> v;\r\n\tint i;\r\n\tfor(i=0;i<va.size()&&i<vb.size();i++){\r\n\t\tif(va[i]==vb[i]){\r\n\t\t\tv.push_back(0); \r\n\t\t}else{\r\n\t\t\tv.push_back(1); \r\n\t\t}\r\n\t}\r\n\tif(va.size()>i){\r\n\t\tfor(int j=i;j<va.size();j++){\r\n\t\t\tv.push_back(va[j]);\r\n\t\t}\r\n\t}\r\n\tif(vb.size()>i){\r\n\t\tfor(int j=i;j<vb.size();j++){\r\n\t\t\tv.push_back(vb[j]);\r\n\t\t}\r\n\t}\r\n\tint sum=0;\r\n\tfor(int i=0;i<v.size();i++){\r\n\t\tsum+=v[i]*pow(2,i);\r\n\t}\r\n\treturn sum;\r\n}\r\nvector<int> binary(int a){\r\n\tvector<int> v;\r\n\twhile(a>0){\r\n\t\tv.push_back(a%2);\r\n\t\ta/=2;\r\n\t}\r\n\treturn v;\r\n}",TIME_LIMIT_EXCEEDED,0,0
1127409175054610432,db72cc2d20f82713b850b2a4f58b32d38cade8070b18371530c9d819cd20e7e0,2019-05-12 11:04:28,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\n#include<cmath>\r\nusing namespace std;\r\nint main(){\r\n\tint n;\r\n\tscanf(\""%d\"",&n);\r\n\tint co=0;\r\n\twhile(n>>=1){\r\n\t co++;\r\n\t}\r\n\tprintf(\""%d\"",co+1);\r\n\treturn 0;\r\n}",ACCEPTED,14,628
1127410283709820928,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 11:08:52,Java,0.0,1127197494785449984,1125976118128910336,976506807128301568,"import java.util.*;\r\nimport java.lang.*;\r\npublic class Main {\r\n\tpublic static void main(String [] args){\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint n = input.nextInt();\r\n\t\tint q = input.nextInt();\r\n\t\tint [] num = new int [n];\r\n\t\tString [] stringnum = new String [n];\r\n\t\tfor(int i=0;i<n;i++){\r\n\t\t\tnum[i]=input.nextInt();\r\n\t\t\tstringnum[i]=Integer.toBinaryString(num[i]);\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint a = input.nextInt();\r\n\t\t\tint b = input.nextInt();\r\n\t\t\tString result = stringnum[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tresult=stringbinary(result,stringnum[j]);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tSystem.out.println(Integer.parseInt(result,2));\r\n\t\t}\r\n\t}\r\n\tpublic static String stringbinary(String a, String b){\r\n\t\tint lengtha=a.length();\r\n\t\tint lengthb=b.length();\r\n\t\tStringBuilder zero = new StringBuilder();\r\n\t\tif(lengtha>lengthb){\r\n\t\t\tint length = lengtha-lengthb;\r\n\t\t\tzero.insert(0,b);\r\n\t\t\tfor(int i=0;i<length;i++){\r\n\t\t\t\tzero.insert(0,\""0\"");\r\n\t\t\t}\r\n\t\t\tb=zero.toString();\r\n\t\t}\r\n\t\telse{\r\n\t\t\tint length = lengthb-lengtha;\r\n\t\t\tzero.insert(0,a);\r\n\t\t\tfor(int i=0;i<length;i++){\r\n\t\t\t\tzero.insert(0,\""0\"");\r\n\t\t\t}\r\n\t\t\tb=zero.toString();\r\n\t\t}\r\n\t\tString result=\""\"";\r\n\t\tfor(int i=0;i<lengtha;i++){\r\n\t\t\tchar x=a.charAt(i);\r\n\t\t\tchar y=b.charAt(i);\r\n\t\t\tif(x==y){\r\n\t\t\t\tresult=result+\""0\"";\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\tresult=result+\""1\"";\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n}\r\n",MEMORY_LIMIT_EXCEEDED,0,0
1127411840572551168,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 11:15:03,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint a[1000005],b[1000005];\r\nint main()\r\n{\r\n    long long n,l,r,m;\r\n    long long ans=0;\r\n\r\n    scanf(\""%lld%lld\"",&n,&m);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&a[i]);\r\n\r\n        i?b[i-1]=(a[i]^a[i-1]):i;\r\n\r\n    }\r\n\r\n    for(int i=0;i<m;i++)\r\n    {\r\n        ans=0;\r\n        scanf(\""%lld%lld\"",&l,&r);\r\n        l--;\r\n        r--;\r\n        /*for(int j=l-1;j<r;j++)\r\n        {\r\n            ans^=a[j];\r\n\r\n        }*/\r\n        if(r==l)\r\n        {\r\n\r\n            cout<<a[l]<<endl;continue;\r\n        }ans=b[l];\r\n        if((r-l)%2)\r\n        {\r\n                 for(int j=l+2;j<r;j+=2)\r\n        {\r\n            ans^=b[j];\r\n\r\n        }\r\n\r\n        }\r\n        else\r\n        {\r\n            for(int j=l+2;j<r-1;j+=2)\r\n            {\r\n\r\n                ans^=b[j];\r\n            }\r\n            ans^=a[r];\r\n\r\n        }\r\n        cout<<ans<<endl;\r\n    }\r\n    return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,206,8212
1127411900760813568,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 11:15:18,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <stdio.h>\r\n#include <stdlib.h>\r\n\r\nint main(){\r\n\tint n, q, l, r, res;\r\n\tint *a = NULL;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\ta = (int *)malloc(n * sizeof(int) );\r\n\tfor(int i=0; i<n; i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tfor(int i=0; i<q; i++){\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tres = a[l-1];\r\n\t\tfor(int j=l; j<=r-1; j++){\r\n\t\t\tres = res^a[j];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", res);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,481,10876
1127413220867665920,52242367a66f65576c135b60fb8d48f86a8742fdd3c55414d401df3af013789d,2019-05-12 11:20:32,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\nstring fun0(int a){\r\n    string res;\r\n    while(a!=0){\r\n        res+=(a%2+'0');\r\n        a/=2;\r\n    }\r\n    reverse(res.begin(),res.end());\r\n    return res;\r\n}\r\n\r\nint fun(int a,int b){\r\n    string s1=fun0(a);\r\n    string s2=fun0(b);\r\n    //cout<<s1<<endl<<s2<<endl;\r\n    if(s1.size()<s2.size()){\r\n    \tint temp=s2.size()-s1.size();\r\n    \tfor(int i=0;i<temp;++i)\r\n    \t\ts1='0'+s1;\r\n    \t//reverse(s1.begin(),s1.end());\r\n    }\r\n    else{\r\n    \tint temp=s1.size()-s2.size();\r\n    \tfor(int i=0;i<temp;++i)\r\n    \t\ts2='0'+s2;\r\n    \t//reverse(s2.begin(),s2.end());\r\n    }\r\n    //cout<<s1<<endl<<s2<<endl;\r\n    int i=s1.size()-1,j=s2.size()-1;\r\n    string res;\r\n    while(i>=0&&j>=0){\r\n        if(s1[i]!=s2[j])res+='1';\r\n        else res+='0';\r\n        i--;\r\n        j--;\r\n    }\r\n    while(i>=0)res+=s1[i--];\r\n    while(j>=0)res+=s2[j--];\r\n    int f=1,sum=0;\r\n    for(int i=0;i<res.size();++i){\r\n        sum+=f*(res[i]-'0');\r\n        f*=2;\r\n    }\r\n    return sum;\r\n}\r\n\r\nint main(){\r\n    ios::sync_with_stdio(false);\r\n    int n,q;\r\n    cin>>n>>q;\r\n    vector<int> v(n+1);\r\n    for(int i=1;i<=n;++i)cin>>v[i];\r\n    vector<int> res(n+1);\r\n    res[1]=v[1];\r\n    int front=res[1];\r\n    for(int i=2;i<=n;++i){\r\n        res[i]=fun(front,v[i]);\r\n        front=res[i];\r\n    }\r\n    int l,r;\r\n    while(q--){\r\n        cin>>l>>r;\r\n        if(l==r)cout<<v[l]<<endl;\r\n        else{\r\n        \tif(l==1)cout<<res[r]<<endl;\r\n        \telse cout<<fun(res[l-1],res[r])<<endl;\r\n        }\r\n    }\r\n    //cout<<fun(447,7);\r\n    return 0;\r\n}",ACCEPTED,2820,11020
1127413971052490752,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 11:23:31,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=100000000;\r\nint num[MAX_N];\r\nint q[1000000][2];\r\nint Ans[1000000];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[30];\r\n\tint ans=0;\r\n\tmemset(dp,0,sizeof(dp));\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<30;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tcin>>N>>Q;\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\tcin>>num[i];\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tcin>>q[i][0]>>q[i][1];\r\n\t\tAns[i]=axor(q[i][0],q[i][1]);\r\n\t} \r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tcout<<Ans[i]<<endl;\r\n\t} \r\n\treturn 0;\r\n}",MEMORY_LIMIT_EXCEEDED,0,0
1127414535630974976,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 11:25:46,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\nint mes[1000006]={-1};\r\nint yihuo(int start,int end){\r\n\tint temp=-1;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tfor(int i = start;i<end;i++){\r\n\t\tif(temp==-1){\r\n\t\t\ttemp=mes[i]^mes[i+1];\r\n\t\t}else{\r\n\t\t\ttemp = temp^mes[i+1];\r\n\t\t}\r\n\t}\r\n\t}\r\n\t\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\tint temp;\r\n\t\tcin>>temp;\r\n\t\tmes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tcin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tcout<<store[i]<<endl;\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,2493,14916
1127414734176743425,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 11:26:33,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=1000000;\r\nlong long num[MAX_N];\r\n//int q[1000000][2];\r\nint Ans[1000000];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[30];\r\n\tint ans=0;\r\n\tmemset(dp,0,sizeof(dp));\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<30;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tcin>>N>>Q;\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\tcin>>num[i];\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tint a,b;\r\n\t\tcin>>a>>b;\r\n\t\tAns[i]=axor(a,b);\r\n\t} \r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tcout<<Ans[i]<<endl;\r\n\t} \r\n\treturn 0;\r\n}",RUNTIME_ERROR,13,10112
1127416281849753600,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 11:32:42,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=1000000;\r\nlong long num[MAX_N];\r\nlong long Ans[1000000];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[30];\r\n\tint ans=0;\r\n\tmemset(dp,0,sizeof(dp));\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<30;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tint a,b;\r\n\t//cin>>N;\r\n\tscanf(\""%d%d\"",&N,&Q);\r\n\t//cin>>Q;\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\t//cin>>num[i];\r\n\t\tscanf(\""%d\"",&num[i]);\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tscanf(\""%d%d\"",&a,&b);\r\n\t\tAns[i]=axor(a,b);\r\n\t} \r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tcout<<Ans[i]<<endl;\r\n\t} \r\n\treturn 0;\r\n}",RUNTIME_ERROR,10,9940
1127416957988335616,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 11:35:23,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\nint mes[1000006]={-1};\r\nint yihuo(int start,int end){\r\n\tint temp=0;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tfor(int i = start;i<=end;i++){\r\n\t\ttemp = temp^mes[i];\r\n\t}\r\n\t}\r\n\t\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\tint temp;\r\n\t\tcin>>temp;\r\n\t\tmes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tcin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tcout<<store[i]<<endl;\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,680,4276
1127417452991705088,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 11:37:21,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=1000000;\r\nlong long num[MAX_N];\r\nlong long Ans[MAX_N];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[40];\r\n\tmemset(dp,0,sizeof(dp));\r\n\tint ans=0;\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<40;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tint a,b;\r\n\t//cin>>N;\r\n\tscanf(\""%d %d\"",&N,&Q);\r\n\t//cin>>Q;\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\t//cin>>num[i];\r\n\t\tscanf(\""%d\"",&num[i]);\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tscanf(\""%d %d\"",&a,&b);\r\n\t\tAns[i]=axor(a,b);\r\n\t} \r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tcout<<Ans[i]<<endl;\r\n\t} \r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,0,0
1127418736050270208,c4249ccf7d0ae4ce1aabf6f6b7adcb919b8202351ddad46f0300f727f06480dd,2019-05-12 11:42:27,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<cstdio>\r\n#include<algorithm>\r\nusing namespace std;\r\nint n,q,r,l,a[1000005],b;\r\nint main(){\r\n    scanf(\""%d%d\"",&n,&q);\r\n    \tfor(int i=1;i<=n;i++)\r\n        scanf(\""%d\"",&a[i]);\r\n  while (scanf(\""%d%d\"",&l,&r)!=EOF&&(q--)){\r\n    \r\n\tfor(int i=l;i<=r;\ti++){\r\n    \tb=b^a[i];\r\n    \r\n  }printf(\""%d\\n\"",b);\r\n  b=0;\r\n}\r\n    return 0;\r\n}\r\n",TIME_LIMIT_EXCEEDED,496,11120
1127418812537597952,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 11:42:45,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=1000000;\r\nlong long num[MAX_N];\r\nlong long Ans[MAX_N];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[40];\r\n\tmemset(dp,0,sizeof(dp));\r\n\tint ans=0;\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<40;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tint a,b;\r\n\tscanf(\""%d %d\"",&N,&Q);\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&num[i]);\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tscanf(\""%d %d\"",&a,&b);\r\n\t\tAns[i]=axor(a,b);\r\n\t} \r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\t//cout<<Ans[i]<<endl;\r\n\t\tprintf(\""%d\\n\"",Ans[i]);\r\n\t} \r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,0,0
1127421805966225408,27815222c523253035889d3967c037074fc7c2392aad2f4d68ce6a49054c3c9e,2019-05-12 11:54:39,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\nint num[1000005];\r\n\r\n\r\nint main()\r\n{\r\n    int n,q;\r\n    int a,b;\r\n    int ans;\r\n    cin>>n>>q;\r\n    for(int i=1;i<=n;i++)\r\n    {\r\n\r\n        scanf(\""%d\"",&num[i]);\r\n    }\r\n    for(int i=2;i<=n;i++)\r\n    {\r\n\r\n        num[i]^=num[i-1];\r\n    }\r\n    for(int i=0;i<q;i++)\r\n    {\r\n        scanf(\""%d %d\"",&a,&b);\r\n        ans=num[b]^num[a-1];\r\n        cout<<ans<<endl;\r\n\r\n    }\r\n\r\n\r\n}\r\n",ACCEPTED,2014,11100
1127422547099742208,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 11:57:36,Java,0.0,1127197494785449984,1125976118128910336,976506807128301568,"import java.util.*;\r\nimport java.lang.*;\r\npublic class Main {\r\n\tpublic static void main(String [] args){\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint n = input.nextInt();\r\n\t\tint q = input.nextInt();\r\n\t\tint [] num = new int [n];\r\n\t\tString [] stringnum = new String [n];\r\n\t\tfor(int i=0;i<n;i++){\r\n\t\t\tnum[i]=input.nextInt();\r\n\t\t\tstringnum[i]=Integer.toBinaryString(num[i]);\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint a = input.nextInt();\r\n\t\t\tint b = input.nextInt();\r\n\t\t\tString result = stringnum[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tresult=stringbinary(result,stringnum[j]);\r\n\t\t\t}\r\n\t\t\tSystem.out.println(Integer.parseInt(result,2));\r\n\t\t}\r\n\t}\r\n\tpublic static String stringbinary(String a, String b){\r\n\t\t//stem.out.println(\""a\""+a);\r\n\t\t//stem.out.println(\""b\""+b);\r\n\t\tint lengtha=a.length();\r\n\t\tint lengthb=b.length();\r\n\t\tStringBuilder zero = new StringBuilder();\r\n\t\tif(lengtha>lengthb){\r\n\t\t\tfor(int i=1;i<=lengthb;i++){\r\n\t\t\t\tchar x=a.charAt(lengtha-i);\r\n\t\t\t\tchar y=b.charAt(lengthb-i);\r\n\t\t\t\tif(x==y){\r\n\t\t\t\t\tzero=zero.insert(0,\""0\"");\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tzero=zero.insert(0,\""1\"");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tString temp=a.substring(0,lengtha-lengthb);\r\n\t\t\tzero.insert(0, temp);\r\n\t\t}\r\n\t\telse{\r\n\t\t\tfor(int i=1;i<=lengtha;i++){\r\n\t\t\t\tchar x=a.charAt(lengtha-i);\r\n\t\t\t\tchar y=b.charAt(lengthb-i);\r\n\t\t\t\tif(x==y){\r\n\t\t\t\t\tzero=zero.insert(0,\""0\"");\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tzero=zero.insert(0,\""1\"");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tString temp=b.substring(0,lengthb-lengtha);\r\n\t\t\t//stem.out.println(\""temp\""+temp);\r\n\t\t\tzero.insert(0, temp);\r\n\t\t}\r\n\t\t\r\n\t\treturn zero.toString();\r\n\t}\r\n}\r\n",MEMORY_LIMIT_EXCEEDED,0,0
1127423272336846848,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 12:00:29,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdio>\r\n#define ll long long int\r\n\r\nusing namespace std;\r\n\r\nint a[4000020];\r\nint seg[4000020];\r\n\r\nint main(){\r\n\tll n, q, l, r;\r\n\tscanf(\""%lld%lld\"", &n, &q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%lld%lld\"", &l, &r);\r\n\t\tint ans=0;\r\n\t\tfor(ll i=l;i<=r;i++){\r\n\t\t\tans = ans^a[i];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", ans);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,548,12920
1127423278938681344,56ad04e7aea44f55046251a22019aea68dc6128fbf3e538b3f0f9b3d129a555f,2019-05-12 12:00:30,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <cstdio>\r\n\r\nint num[1100000], sum[1100000];\r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\tsum[0] = 0;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor(int i = 1; i <= n; i++)\r\n\t{\r\n\t\tscanf(\""%d\"", &num[i]);\r\n\t\tsum[i] = num[i] ^ sum[i - 1];\r\n\t}\r\n\tfor(int i = 0; i < q; i++)\r\n\t{\r\n\t\tint a, b;\r\n\t\tscanf(\""%d%d\"", &a, &b);\r\n\t\tprintf(\""%d\\n\"", sum[b] ^ sum[a - 1]);\r\n\t}\r\n\treturn 0;\r\n}\r\n",ACCEPTED,462,12672
1127423286899470336,6e955fd672f1676395e4e6cc697b74ac833334e572f3542b5d599d7b0b02e246,2019-05-12 12:00:32,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h>\r\n\r\nusing namespace std;\r\n\r\nint a[1000005],b[1000005];\r\nint main()\r\n{\r\n    long long n,l,r,m;\r\n    long long ans=0;\r\n\r\n    scanf(\""%lld%lld\"",&n,&m);\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        scanf(\""%lld\"",&a[i]);\r\n\r\n        i?b[i-1]=(a[i]^a[i-1]):i;\r\n\r\n    }\r\n\r\n    for(int i=0;i<m;i++)\r\n    {\r\n        ans=0;\r\n        scanf(\""%lld%lld\"",&l,&r);\r\n        l--;\r\n        r--;\r\n        /*for(int j=l-1;j<r;j++)\r\n        {\r\n            ans^=a[j];\r\n\r\n        }*/\r\n        if(r==l)\r\n        {\r\n\r\n            cout<<a[l]<<endl;continue;\r\n        }ans=b[l];\r\n        if((r-l)%2)\r\n        {\r\n                 for(int j=l+2;j<r;j+=2)\r\n        {\r\n            ans^=b[j];\r\n\r\n        }\r\n\r\n        }\r\n        else\r\n        {\r\n            for(int j=l+2;j<r-1;j+=2)\r\n            {\r\n\r\n                ans^=b[j];\r\n            }\r\n            ans^=a[r];\r\n\r\n        }\r\n        cout<<ans<<endl;\r\n    }\r\n    return 0;\r\n}\r\n",ACCEPTED,3451,12952
1127423291588702208,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 12:00:33,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <stdio.h>\r\n\r\nint main(){\r\n\tint n, cnt, tmp;\r\n\tscanf(\""%d\"", &n);\r\n\tcnt = 1;\r\n\ttmp = 1;\r\n\twhile(n > tmp){\r\n\t\ttmp = (tmp + 1) * 2 - 1;\r\n\t\tcnt ++;\r\n\t}\r\n\tprintf(\""%d\\n\"", cnt);\r\n\treturn 0;\r\n}",ACCEPTED,24,636
1127423318449025024,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 12:00:40,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=1000000;\r\nlong long num[MAX_N];\r\nlong long Ans[MAX_N];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[40];\r\n\tmemset(dp,0,sizeof(dp));\r\n\tint ans=0;\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<40;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tint a,b;\r\n\tscanf(\""%d %d\"",&N,&Q);\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&num[i]);\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tscanf(\""%d %d\"",&a,&b);\r\n\t\tAns[i]=axor(a,b);\r\n\t} \r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\t//cout<<Ans[i]<<endl;\r\n\t\tprintf(\""%d\\n\"",Ans[i]);\r\n\t} \r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,0,0
1127423328137867264,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 12:00:42,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <stdio.h>\r\n#include <stdlib.h>\r\n\r\nint main(){\r\n\tint n, q, l, r, res;\r\n\tint *a = NULL;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\ta = (int *)malloc(n * sizeof(int) );\r\n\tfor(int i=0; i<n; i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tfor(int i=0; i<q; i++){\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tres = a[l-1];\r\n\t\tfor(int j=l; j<=r-1; j++){\r\n\t\t\tres = res^a[j];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", res);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,487,10620
1127423381833347072,bbe121ac19634caeeed4004e3a1abe8278fc8f0d7e35d125336e63e024e91fe2,2019-05-12 12:00:55,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include <iostream>\r\n#include<cstdio>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint n,q;\r\nint a[1000005];\r\nint x,y;\r\nint sum[4000006];\r\nlong long sums=0;\r\nvoid push_up(int o){\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nsum[o]=sum[lc]^sum[rc];\r\n}\r\nvoid build(int o,int l,int r){\r\nif(l==r){\r\n    sum[o]=a[l];\r\n    return;\r\n}\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nint mid=(l+r)>>1;\r\nbuild(lc,l,mid);\r\nbuild(rc,mid+1,r);\r\npush_up(o);\r\n}\r\nvoid query(int o,int l,int r){\r\nif(x<=l&&y>=r){\r\n    sums^=sum[o];\r\n    return;\r\n    }\r\nint mid=(l+r)>>1;\r\nint lc=o<<1;\r\nint rc=o<<1|1;\r\nif(x<=mid){\r\n    query(lc,l,mid);\r\n}\r\nif(y>mid)\r\n    query(rc,mid+1,r);\r\n}\r\nint main()\r\n{\r\n    cin>>n>>q;\r\n    for(int i=1;i<=n;i++){\r\n       // cin>>a[i];\r\n    scanf(\""%d\"",&a[i]);\r\n    }\r\n    build(1,1,n);\r\n    for(int i=0;i<q;i++){\r\n     scanf(\""%d%d\"",&x,&y);\r\n      sums=0;\r\n     query(1,1,n);\r\n     cout<<sums<<endl;\r\n    }\r\n    return 0;\r\n}\r\n\r\n",ACCEPTED,2016,15728
1127423452092133376,42f17ffa1f72526ed7daa3e88d6f4fecdc67729447a6106c37ce3df2d48db904,2019-05-12 12:01:12,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\nusing namespace std;\r\nint sum[1000005];\r\nint main(){\r\n\tint n,q;\r\n\t\r\n\tsum[0]=0;\r\n\twhile(~scanf(\""%d %d\"",&n,&q)){\r\n\t\tfor(int i=1;i<=n;i++){\r\n\t\t\tint tmp;\r\n\t\t\tscanf(\""%d\"",&tmp);\r\n\t\t\tsum[i]=sum[i-1]^tmp;\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint l,r;\r\n\t\t\tscanf(\""%d %d\"",&l,&r);\r\n\t\t\tcout<<(int)(sum[l-1]^sum[r])<<endl;\r\n\t\t}\r\n\t}\r\n    return 0; \r\n}",ACCEPTED,1743,10752
1127423489937338368,f675ec631d87348266c124f9c9644c1c9413195cb2686f48383823bf2f2a62b3,2019-05-12 12:01:21,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nint a[1000005];\r\nint main()\r\n{\r\n\tint n,q;\r\n\tscanf(\""%d%d\"",&n,&q);\r\n\tfor(int i=1;i<=n;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\tint l,r;\r\n\t\tscanf(\""%d%d\"",&l,&r);\r\n\t\tint res=a[l];\r\n\t\tfor(int i=l+1;i<=r;i++)\r\n\t\t{\r\n\t\t\tres=res^a[i];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"",res);\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,488,10624
1127423735006326784,4122b8a8cc7415b2d5ef2738372c612850d5707ab1ffb371f3ff60425fe6838d,2019-05-12 12:02:19,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\tint a[1000005];\r\n\tint b[1000005];\r\nint main(){\r\n\tint i,j,k,n,q,l,r,s;\r\n\r\n\tcin>>n>>q;\r\n\tfor(i=1;i<=n;i++){\r\n\t\tcin>>a[i];\r\n\t}\r\n\tfor(i=0;i<q;i++){\r\n\t\tcin>>l>>r;\r\n\t\tif(l==r){\r\n\t\t\tb[i]=a[l];continue;\r\n\t\t}\t\t\r\n\t\ts=a[l];\r\n\t\tfor(j=l+1;j<=r;j++)\r\n\t\ts= s ^a[j];\t\t\t\r\n\t\tb[i]=s;\r\n\t} \r\n\tfor(i=0;i<q;i++){\r\n\t\tcout<<b[i]<<endl;\r\n\t}\r\n\r\n}",TIME_LIMIT_EXCEEDED,2376,14976
1127424206504816640,a9433ab49fa612cb99c8f0cfd63fd66b26abb2e010bf50a05985cfff5bd5053d,2019-05-12 12:04:12,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n#define ll long long\r\nusing namespace std;\r\nint a[1000000];\r\nint n,q;\r\nint x[100005];\r\nvoid pushup(int rt){\r\n     a[rt]=a[rt<<1]^a[rt<<1|1];\r\n}\r\nvoid build(int l,int r,int rt){\r\n    if(l==r){\r\n        a[rt]=x[l];\r\n        return;\r\n    }\r\n    int m=(l+r)>>1;\r\n    build(l,m,rt<<1);\r\n    build(m+1,r,rt<<1|1);\r\n    pushup(rt);\r\n}\r\nint query(int l,int r,int rt,int L,int R){\r\n    if(L<=l && r<= R){\r\n        return a[rt];\r\n    }\r\n    int ans=0;\r\n    int m=(l+r)>>1;\r\n    if(L<=m) ans=ans^query(l,m,rt<<1,L,R);\r\n    if(R>m) ans=ans^query(m+1,r,rt<<1|1,L,R);\r\n    return ans;\r\n}\r\nint main(){\r\n    cin>>n>>q;\r\n    for(int i=1;i<=n;i++){\r\n        scanf(\""%d\"",&x[i]);\r\n    }\r\n    build(1,n,1);\r\n    while(q--){\r\n        int l,r;\r\n        scanf(\""%d%d\"",&l,&r);\r\n        printf(\""%d\\n\"",query(1,n,1,l,r));\r\n    }\r\n}\r\n",TIME_LIMIT_EXCEEDED,15,512
1127424338914799616,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 12:04:43,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\nint mes[1000006]={-1};\r\nint yihuo(int start,int end){\r\n\tint temp=0;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tfor(int i = start;i<=end;i++){\r\n\t\ttemp = temp^mes[i];\r\n\t}\r\n\t}\r\n\t\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\tint temp;\r\n\t\tcin>>temp;\r\n\t\tmes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tcin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tcout<<store[i]<<endl;\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,2398,14832
1127424392010493952,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 12:04:56,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\nint mes[1000006]={-1};\r\nint yihuo(int start,int end){\r\n\tint temp=0;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tfor(int i = start;i<=end;i++){\r\n\t\ttemp = temp^mes[i];\r\n\t}\r\n\t}\r\n\t\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\tint temp;\r\n\t\tcin>>temp;\r\n\t\tmes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tcin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tcout<<store[i]<<endl;\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,2380,14816
1127424558432088064,a9433ab49fa612cb99c8f0cfd63fd66b26abb2e010bf50a05985cfff5bd5053d,2019-05-12 12:05:35,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\n#define ll long long\r\nusing namespace std;\r\nint a[8000002];\r\nint n,q;\r\nint x[1000005];\r\nvoid pushup(int rt){\r\n     a[rt]=a[rt<<1]^a[rt<<1|1];\r\n}\r\nvoid build(int l,int r,int rt){\r\n    if(l==r){\r\n        a[rt]=x[l];\r\n        return;\r\n    }\r\n    int m=(l+r)>>1;\r\n    build(l,m,rt<<1);\r\n    build(m+1,r,rt<<1|1);\r\n    pushup(rt);\r\n}\r\nint query(int l,int r,int rt,int L,int R){\r\n    if(L<=l && r<= R){\r\n        return a[rt];\r\n    }\r\n    int ans=0;\r\n    int m=(l+r)>>1;\r\n    if(L<=m) ans=ans^query(l,m,rt<<1,L,R);\r\n    if(R>m) ans=ans^query(m+1,r,rt<<1|1,L,R);\r\n    return ans;\r\n}\r\nint main(){\r\n    scanf(\""%d%d\"",&n,&q);\r\n    for(int i=1;i<=n;i++){\r\n        scanf(\""%d\"",&x[i]);\r\n    }\r\n    build(1,n,1);\r\n    while(q--){\r\n        int l,r;\r\n        scanf(\""%d%d\"",&l,&r);\r\n        printf(\""%d\\n\"",query(1,n,1,l,r));\r\n    }\r\n}\r\n",ACCEPTED,606,12960
1127425162516721664,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 12:07:59,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\nint mes[1000006]={-1};\r\nint yihuo(int start,int end){\r\n\tint temp=0;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tfor(int i = start;i<=end;i++){\r\n\t\ttemp = temp^mes[i];\r\n\t}\r\n\t}\r\n\t\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\t//int temp;\r\n\t\tscanf(\""%d\"",&mes[i]);\r\n\t\t//cin>>temp;\r\n\t\t//mes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tscanf(\""%d%d\"",&start,&end);\r\n\t\t//cin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tprintf(\""%d\\n\"",store[i]);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,528,14876
1127425485704622080,760a54321c9b044091db2f03fe4ef1c436dc52786fd07fce69ef0039e4ccf89d,2019-05-12 12:09:16,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdio>\r\nusing namespace std;\r\n#define sf(x) scanf(\""%d\"",&(x))\r\n#define fre freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin)\r\nconst int maxn=1e6+5;\r\nint yh[maxn<<2];\r\nvoid getyh(int i){\r\n\tyh[i]=yh[i<<1]^yh[i<<1|1];\r\n} \r\nvoid build(int i,int l,int r,int L ,int R){\r\n\tif(l==r){\r\n\t\tscanf(\""%d\"",&yh[i]);\r\n\t\treturn;\r\n\t}\r\n\tint m=l+(r-l)/2;\r\n\tif(L<=m)build(i<<1,l,m,L,R);\r\n\tif(R>m)build(i<<1|1,m+1,r,L,R);\r\n\tgetyh(i);\r\n} \r\nint query(int i,int l,int r,int L,int R){\r\n\tif(L<=l&&r<=R)return yh[i];\r\n\tif(l>R||r<L)return 0;\r\n\tint ans=0;\r\n\tint m=l+(r-l)/2;\r\n\tif(L<=m)ans=ans^(query(i<<1,l,m,L,R));\r\n\tif(R>m)ans=ans^(query(i<<1|1,m+1,r,L,R));\r\n\treturn ans;\r\n}\r\nint main(){\r\n\tint n,q;sf(n);sf(q);\r\n\tbuild(1,1,n,1,n);\r\n\tint ql,qr;\r\n\twhile(q--){\r\n\t\tsf(ql);sf(qr);\r\n\t\t//cout<<query(1,1,n,ql,qr)<<endl;\r\n\t\tprintf(\""%d\\n\"",query(1,1,n,ql,qr));\r\n\t}\r\n\treturn 0;\r\n} ",ACCEPTED,674,10912
1127425551353868288,f675ec631d87348266c124f9c9644c1c9413195cb2686f48383823bf2f2a62b3,2019-05-12 12:09:32,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nint a[1000005];\r\nint m[1000005]; \r\nint main()\r\n{\r\n\tint n,q;\r\n\tscanf(\""%d%d\"",&n,&q);\r\n\tscanf(\""%d\"",&a[1]);\r\n\tm[1]=a[1];\r\n\tfor(int i=2;i<=n;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&a[i]);\r\n\t\tm[i]=m[i-1]^a[i];\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\tint l,r;\r\n\t\tscanf(\""%d%d\"",&l,&r);\r\n\t\tprintf(\""%d\\n\"",m[r]^m[l-1]);\r\n\t}\r\n\treturn 0;\r\n} ",ACCEPTED,513,12924
1127428164459786240,50732ce5653eeab9688efbe3dac184b142f0fd90eac47128099a03515d517d06,2019-05-12 12:19:55,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstring>\r\n#include <string>\r\n#include <algorithm>\r\n#include <fstream>\r\n\r\nusing namespace std;\r\nconst int maxn = 10e6 + 4;\r\nlong long num[maxn]; \r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor (int i = 1; i <= n; i++)\r\n\t{\r\n\t\tscanf(\""%lld\"", &num[i]);\r\n\t}\r\n\t\r\n\twhile (q--)\r\n\t{\r\n\t\tint l, r;\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tint ans = num[l];\r\n\t\tfor (int i = l + 1; i <= r; i++)\r\n\t\t{\r\n\t\t\tans = (ans ^ num[i]);\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", ans);\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,597,10740
1127428789868261376,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 12:22:24,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint q[1000][1000];\r\nint main(){\r\n\tint n,q1,a,b,t,i2,j2;\r\n\tcin>>n>>q1;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n\t\tq[i][i]=g[i];\r\n}\r\nfor(int i=1;i<=q1;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tif(q[a][b]!=0) sum[i]=q[a][b];\r\n\t\telse{\r\n\t\t\t\tfor(i2=a;i2<=b;i2++)\r\n\t\t\t\t\tfor( j2=b;j2>i2;j2--)\r\n\t\t\t\t\tif(q[i2][j2]!=0){\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\tfor(int i1=a+1;i1<i2;i1++){\r\n\t\t\tq[a][i1]=q[a][i1-1]^g[i1];\r\n\t\t}\r\n\t\t\tfor(int j1=j2+1;j1<=b;j1++){\r\n\t\t\tq[j2][j1]=q[j2][j1-1]^g[j1];\r\n\t\t}\r\n\t\tq[a][b]=q[a][i2-1]^q[i2][j2]^q[j2+1][b];\r\n sum[i]=q[a][b];\r\n}\t\r\n}\r\n}\r\nfor(int i=1;i<=q1;i++)\r\n\tif(i!=q1) cout<<sum[i]<<endl;\r\n\telse cout<<sum[i];\r\n\treturn 0;\r\n}",SEGMENTATION_FAULT,8,12160
1127429995214761984,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 12:27:12,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint q[1000][1000]={0};\r\nint main(){\r\n\tint n,q1,a,b,i2,j2,flag;\r\n\tcin>>n>>q1;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n\t\tq[i][i]=g[i];\r\n}\r\nfor(int i=1;i<=q1;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tif(q[a][b]!=0) sum[i]=q[a][b];\r\n\t\telse{\r\n\t\t\tflag=0;\r\n\t\t\t\tfor(i2=a;i2<=b;i2++){\r\n\t\t\t\t\tfor( j2=b;j2>i2;j2--)\r\n\t\t\t\t\tif(q[i2][j2]!=0){\r\n\t\t\t\t\t\tflag=1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif(flag==1)\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\tfor(int i1=a+1;i1<i2;i1++){\r\n\t\t\tq[a][i1]=q[a][i1-1]^g[i1];\r\n\t\t}\r\n\t\t\tfor(int j1=j2+1;j1<=b;j1++){\r\n\t\t\tq[j2][j1]=q[j2][j1-1]^g[j1];\r\n\t\t}\r\n\t\tq[a][b]=q[a][i2-1]^q[i2][j2]^q[j2+1][b];\r\n   sum[i]=q[a][b];\r\n}\t\r\n}\r\n}\r\nfor(int i=1;i<=q1;i++)\r\n\tif(i!=q1) cout<<sum[i]<<endl;\r\n\telse cout<<sum[i];\r\n\treturn 0;\r\n}",SEGMENTATION_FAULT,10,12140
1127430269484494848,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:28:17,Java,0.0,1127197494785449984,1125976118128910336,976506807128301568,import java.util.*;\r\npublic class Main {\r\n\tpublic static void main(String [] args){\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint n = input.nextInt();\r\n\t\tint q = input.nextInt();\r\n\t\tint [] num = new int [n];\r\n\t\tfor(int i=0;i<n;i++){\r\n\t\t\tnum[i]=input.nextInt();\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n\t\t\tint a = input.nextInt();\r\n\t\t\tint b = input.nextInt();\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tint x=result^num[j];\r\n\t\t\t\tresult = x;\r\n\t\t\t}\r\n\t\t\tSystem.out.println(result);\r\n\t\t}\r\n\t\t\r\n\t}\r\n}\r\n,MEMORY_LIMIT_EXCEEDED,1352,73980
1127430290808336384,50732ce5653eeab9688efbe3dac184b142f0fd90eac47128099a03515d517d06,2019-05-12 12:28:22,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstring>\r\n#include <string>\r\n#include <algorithm>\r\n#include <fstream>\r\n\r\nusing namespace std;\r\nconst int maxn = 10e6 + 4;\r\nlong long num[maxn]; \r\n\r\n\r\nvoid fg(long long a[], int li, int rb)\r\n{\r\n\tint nn = rb - li + 1;\r\n\tlong long p[nn];\r\n\t\r\n\tfor (int i = 0, j = li; j <= rb; i++, j++)\r\n\t{\r\n\t\tp[i] = a[j];\r\n\t}\r\n\t\r\n\tint r = 0;\r\n\tfor (r = 0; r < (nn >> 1); r++)\r\n\t{\r\n\t\tp[r] = p[r << 1] ^ p[r << 1 | 1];\r\n\t}\r\n\tif ((r << 1 | 1) == nn)\r\n\t{ \r\n\t\tp[r++] = p[r << 1];\r\n\t}\r\n\t\r\n\tif (r == 1)\r\n\t\tprintf(\""%d\\n\"", p[0]);\r\n\telse\r\n\t{\r\n\t\tfg(p, 0, --r);\r\n\t}\r\n\t\t\r\n}\r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor (int i = 1; i <= n; i++)\r\n\t{\r\n\t\tscanf(\""%lld\"", &num[i]);\r\n\t}\r\n\t\r\n\twhile (q--)\r\n\t{\r\n\t\tint l, r;\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\t\r\n\t\tfg(num, l, r);\r\n\t}\r\n\treturn 0;\r\n} ",WRONG_ANSWER,108,768
1127430640076419072,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 12:29:45,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint q[1000][1000]={0};\r\nint main(){\r\n\tint n,q1,a,b,i2,j2,flag;\r\n\tcin>>n>>q1;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n\t\tq[i][i]=g[i];\r\n}\r\nfor(int i=1;i<=q1;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tif(q[a][b]!=0) sum[i]=q[a][b];\r\n\t\telse{\r\n\t\t\tflag=0;\r\n\t\t\t\tfor(i2=a;i2<=b;i2++){\r\n\t\t\t\t\tfor( j2=b;j2>i2;j2--)\r\n\t\t\t\t\tif(q[i2][j2]!=0){\r\n\t\t\t\t\t\tflag=1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif(flag==1)\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\tfor(int i1=a+1;i1<i2;i1++){\r\n\t\t\tq[a][i1]=q[a][i1-1]^g[i1];\r\n\t\t}\r\n\t\t\tfor(int j1=j2+1;j1<=b;j1++){\r\n\t\t\tq[j2][j1]=q[j2][j1-1]^g[j1];\r\n\t\t}\r\n\t\tq[a][b]=q[a][i2-1]^q[i2][j2]^q[j2+1][b];\r\n   sum[i]=q[a][b];\r\n}\t\r\n}\r\n}\r\n    for(int i=1;i<=q1;i++)\r\n\tcout<<sum[i]<<endl;\r\n\t\r\n\treturn 0;\r\n}",SEGMENTATION_FAULT,9,12160
1127430828169981952,4122b8a8cc7415b2d5ef2738372c612850d5707ab1ffb371f3ff60425fe6838d,2019-05-12 12:30:30,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\tint a[1000005];\r\n\tint b[1000005];\r\nint main(){\r\n\tint i,j,k,n,q,l,r,s;\r\n\tcin>>n>>q;\r\n\tfor(i=1;i<=n;i++){\r\n\t\tcin>>a[i];\r\n\t}\r\n\tfor(i=0;i<q;i++){\r\n\t\tcin>>l>>r;\r\n\t\tif(l==r){\r\n\t\t\tb[i]=a[l];continue;\r\n\t\t}\t\t\r\n\t\ts=a[l];\r\n\t\tfor(j=l+1;j<=r;j++){\r\n\t\t\ts= s ^a[j];\t\t\t\r\n\t\t}\t\t\t\t\r\n\t\tb[i]=s;\r\n\t} \r\n\tfor(i=0;i<q;i++)\r\n\t\tcout<<b[i]<<endl;\r\n}",TIME_LIMIT_EXCEEDED,2396,14868
1127430874475098112,db72cc2d20f82713b850b2a4f58b32d38cade8070b18371530c9d819cd20e7e0,2019-05-12 12:30:41,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<cstdio>\r\n#include<cmath>\r\nusing namespace std;\r\nint q,n;\r\nint res[1000004];\r\nint main(){\r\n    //int a=(447)^(55)^(447);\r\n    //cout<<a;\r\n    scanf(\""%d%d\"",&n,&q);\r\n    for(int i=0;i<n;i++){\r\n    \tint tmp;\r\n\t\tscanf(\""%d\"",&tmp);\r\n\t    if(i>0) {\r\n\t     res[i]=res[i-1]^tmp;\t\r\n\t    }\r\n\t    else{\r\n\t     res[0]=tmp;\r\n\t    }\r\n\t    //cout<<res[i]<<\"" \"";\r\n    }\r\n    for(int i=0;i<q;i++){\r\n    \tint l,r;\r\n    \tscanf(\""%d%d\"",&l,&r);\r\n    \tl-=1;\r\n    \tr-=1;\r\n    \tif(r==0){\r\n    \t printf(\""%d\\n\"",res[0]);\r\n    \t continue;\r\n    \t}\r\n    \tif(l==0){\r\n    \t\tprintf(\""%d\\n\"",res[r]);\r\n    \t\tcontinue;\r\n    \t}\r\n    \tif(l>0){\r\n    \t  int s=res[r]^res[l-1];\r\n\t\t  printf(\""%d\\n\"",s);\r\n    \t}\r\n    }\r\n\treturn 0;\r\n}\r\n ",ACCEPTED,505,10564
1127430929181405184,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 12:30:54,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint q[1000][1000]={0};\r\nint main(){\r\n\tint n,q1,a,b,i2,j2,flag;\r\n\tcin>>n>>q1;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n\t\tq[i][i]=g[i];\r\n}\r\nfor(int i=1;i<=q1;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tif(q[a][b]!=0) sum[i]=q[a][b];\r\n\t\telse{\r\n\t\t\tflag=0;\r\n\t\t\t\tfor(i2=a;i2<=b;i2++){\r\n\t\t\t\t\tfor( j2=b;j2>i2;j2--)\r\n\t\t\t\t\tif(q[i2][j2]!=0){\r\n\t\t\t\t\t\tflag=1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif(flag==1)\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\tfor(int i1=a+1;i1<i2;i1++){\r\n\t\t\tq[a][i1]=q[a][i1-1]^g[i1];\r\n\t\t}\r\n\t\t\tfor(int j1=j2+1;j1<=b;j1++){\r\n\t\t\tq[j2][j1]=q[j2][j1-1]^g[j1];\r\n\t\t}\r\n\t\tq[a][b]=q[a][i2-1]^q[i2][j2]^q[j2+1][b];\r\n   sum[i]=q[a][b];\r\n}\t\r\n}\r\n}\r\n    for(int r=1;r<=q1;r++)\r\n\tcout<<sum[r]<<endl;\r\n\t\r\n\treturn 0;\r\n}",SEGMENTATION_FAULT,13,12024
1127431227228647424,8454879697fcba219ae419e54d1fa81518ce9ca69ba8b399a7a83aafb7f2e3d7,2019-05-12 12:32:05,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#define ll long long int \r\n#include <cstdio>\r\n#include <cmath>\r\n\r\nusing namespace std;\r\n\r\nll a[4000020];\r\nll seg[4000020];\r\nll tag[4000020];\r\n\r\ninline ll lc(ll p){\r\n\treturn p<<1;\r\n}\r\n\r\ninline ll rc(ll p){\r\n\treturn p<<1|1;\r\n}\r\n\r\ninline void push_up(ll p){\r\n\tseg[p]=seg[lc(p)]^seg[rc(p)];\r\n}\r\n\r\nvoid build(ll p, ll b, ll e){\r\n\tif(b==e){\r\n\t\tseg[p]=a[b];\r\n\t\treturn;\r\n\t} \r\n\tll mid = (b+e)>>1;\r\n\tbuild(lc(p), b, mid);\r\n\tbuild(rc(p), mid+1, e);\r\n\tpush_up(p);\r\n}\r\n\r\nll query(ll p, ll b,ll e, ll nb, ll ne){\r\n\tint res=0;\r\n\tif(nb <= b&&e<=ne){\r\n\t\treturn seg[p];\r\n\t}\r\n\tll mid = (b+e)>>1;\r\n\tif(nb<=mid) {\r\n\t\tres = res^query(lc(p), b, mid, nb, ne);\r\n\t}\r\n\tif(ne>=mid+1){\r\n\t\tres = res^query(rc(p), mid+1, e,nb, ne);\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nint main(){\r\n\tll n, q, l, r;\r\n\tscanf(\""%lld%lld\"", &n, &q);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tbuild(1,1,n);\r\n\tfor(int i=0;i<q;i++){\r\n\t\tscanf(\""%lld%lld\"",&l,&r);\r\n\t\tcout << query(1,1,n,l,r) << endl;\r\n\t}\r\n\treturn 0;\r\n}",ACCEPTED,1917,28992
1127431294865993728,d3d395d8e4bdd94c3755da1f31f31c570a61cee7352b9eb3b616f5ad7033d2ba,2019-05-12 12:32:22,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint q[202000],f[202000];\r\nint main()\r\n{\r\n    int n,k;\r\n    scanf(\""%d%d\"",&n,&k);\r\n    for (int i = 0; i < n; i++)\r\n    scanf(\""%d\"",&q[i]);\r\n    f[0] = q[0];\r\n    for (int i = 1; i < n; i++)\r\n    {\r\n    \tf[i] = f[i-1]^q[i];\r\n    }\r\n    for (int i = 0; i < k; i++)\r\n    {\r\n    \tint l , r;\r\n    \tscanf(\""%d%d\"",&l,&r);\r\n    //\tprintf(\""%d\\n\"",f[r-1]^f[l-1]);\r\n    \tprintf(\""%d\\n\"",(f[r-1]^f[l-1])^q[l-1]);\r\n    }\r\n\treturn 0;\t\r\n}\r\n",SEGMENTATION_FAULT,39,1024
1127431514563637248,d3d395d8e4bdd94c3755da1f31f31c570a61cee7352b9eb3b616f5ad7033d2ba,2019-05-12 12:33:14,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint q[1020000],f[1020000];\r\nint main()\r\n{\r\n    int n,k;\r\n    scanf(\""%d%d\"",&n,&k);\r\n    for (int i = 0; i < n; i++)\r\n    scanf(\""%d\"",&q[i]);\r\n    f[0] = q[0];\r\n    for (int i = 1; i < n; i++)\r\n    {\r\n    \tf[i] = f[i-1]^q[i];\r\n    }\r\n    for (int i = 0; i < k; i++)\r\n    {\r\n    \tint l , r;\r\n    \tscanf(\""%d%d\"",&l,&r);\r\n    //\tprintf(\""%d\\n\"",f[r-1]^f[l-1]);\r\n    \tprintf(\""%d\\n\"",(f[r-1]^f[l-1])^q[l-1]);\r\n    }\r\n\treturn 0;\t\r\n}\r\n",ACCEPTED,506,12928
1127431661490106368,2e1ae774448c7cbb694103b08792d72151180d1fe7b1e8ac970c84862c2f2c98,2019-05-12 12:33:49,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\nint n;\r\nvector<int> arr;\r\nvector<int> brr;\r\nint q;\r\nint main()\r\n{\r\n\tcin>>n>>q;int v=0;\r\n\tarr.push_back(v);\r\n\tfor(int i=0;i<n;i++){\r\n\t\tcin>>v;\r\n\t\tarr.push_back(v);\r\n\t}\r\n\tbrr.resize(n+1);\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tif(i==1)\r\n\t\tbrr[i]=arr[i];\r\n\t\telse{\r\n\t\t\tbrr[i]=(brr[i-1]^arr[i]);\r\n\t\t}\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\t//异或\r\n\t\tint l,r;int ans;\r\n\t\tcin>>l>>r;\r\n\t\tif(l==r) cout<<arr[l]<<endl;\r\n\t\telse{\r\n\t\t\tcout<<(brr[r]^brr[l-1])<<endl;\r\n\t\t}\t\r\n\t\t}\r\n\treturn 0;\r\n}",ACCEPTED,2846,10696
1127431722932465664,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:34:04,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,#include <iostream>\r\nusing namespace std;\r\nint main(String [] args){\r\n        int n;\r\n        int q;\r\n        cin>>n>>q;\r\n\t\tint num[n];\r\n\t\tfor(int i=0;i<n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a;\r\n            int b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tint x=result^num[j];\r\n\t\t\t\tresult = x;\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t\t\r\n\t}\r\n,COMPILE_ERROR,0,0
1127431771615752192,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:34:15,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n;\r\n        int q;\r\n        cin>>n>>q;\r\n\t\tint num[n];\r\n\t\tfor(int i=0;i<n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a;\r\n            int b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tint x=result^num[j];\r\n\t\t\t\tresult = x;\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t\t\r\n\t}\r\n,TIME_LIMIT_EXCEEDED,672,4224
1127431961387036672,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 12:35:00,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint q[10000][10000]={0};\r\nint main(){\r\n\tint n,q1,a,b,i2,j2,flag;\r\n\tcin>>n>>q1;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n\t\tq[i][i]=g[i];\r\n}\r\nfor(int i=1;i<=q1;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tif(q[a][b]!=0) sum[i]=q[a][b];\r\n\t\telse{\r\n\t\t\tflag=0;\r\n\t\t\t\tfor(i2=a;i2<=b;i2++){\r\n\t\t\t\t\tfor( j2=b;j2>i2;j2--)\r\n\t\t\t\t\tif(q[i2][j2]!=0){\r\n\t\t\t\t\t\tflag=1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif(flag==1)\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\tfor(int i1=a+1;i1<i2;i1++){\r\n\t\t\tq[a][i1]=q[a][i1-1]^g[i1];\r\n\t\t}\r\n\t\t\tfor(int j1=j2+1;j1<=b;j1++){\r\n\t\t\tq[j2][j1]=q[j2][j1-1]^g[j1];\r\n\t\t}\r\n\t\tq[a][b]=q[a][i2-1]^q[i2][j2]^q[j2+1][b];\r\n     sum[i]=q[a][b];\r\n}\t\r\n}\r\n}\r\n    for(int r=1;r<=q1;r++)\r\n    if(r!=q1)\r\n\tcout<<sum[r]<<endl;\r\n\telse cout<<sum[r];\r\n\t\r\n\treturn 0;\r\n}",MEMORY_LIMIT_EXCEEDED,0,0
1127431977140842496,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:35:04,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n;\r\n        int q;\r\n        cin>>n>>q;\r\n\t\tint num[n];\r\n\t\tfor(int i=0;i<n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a;\r\n            int b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n,TIME_LIMIT_EXCEEDED,2425,10980
1127432017762676736,0beeaed6a902ae57419da2146c4aecf21042c727b40b2a48e52ebd27ff787a22,2019-05-12 12:35:14,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint sum[1000001],g[1000001];\r\nint q[1000][1000]={0};\r\nint main(){\r\n\tint n,q1,a,b,i2,j2,flag;\r\n\tcin>>n>>q1;\r\n\tfor(int i=1;i<=n;i++){\r\n\t\tcin>>g[i];\r\n\t\tq[i][i]=g[i];\r\n}\r\nfor(int i=1;i<=q1;i++){\r\n\tcin>>a>>b;\r\n\tif(a==b){\r\n\t\tsum[i]=g[a];\r\n\t}\r\n\tif(b>a){\r\n\t\tif(q[a][b]!=0) sum[i]=q[a][b];\r\n\t\telse{\r\n\t\t\tflag=0;\r\n\t\t\t\tfor(i2=a;i2<=b;i2++){\r\n\t\t\t\t\tfor( j2=b;j2>i2;j2--)\r\n\t\t\t\t\tif(q[i2][j2]!=0){\r\n\t\t\t\t\t\tflag=1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif(flag==1)\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\tfor(int i1=a+1;i1<i2;i1++){\r\n\t\t\tq[a][i1]=q[a][i1-1]^g[i1];\r\n\t\t}\r\n\t\t\tfor(int j1=j2+1;j1<=b;j1++){\r\n\t\t\tq[j2][j1]=q[j2][j1-1]^g[j1];\r\n\t\t}\r\n\t\tq[a][b]=q[a][i2-1]^q[i2][j2]^q[j2+1][b];\r\n     sum[i]=q[a][b];\r\n}\t\r\n}\r\n}\r\n    for(int r=1;r<=q1;r++)\r\n    if(r!=q1)\r\n\tcout<<sum[r]<<endl;\r\n\telse cout<<sum[r];\r\n\t\r\n\treturn 0;\r\n}",SEGMENTATION_FAULT,8,12032
1127432514766729216,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:37:12,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n];\r\n\t\tfor(int i=0;i<n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",TIME_LIMIT_EXCEEDED,718,4352
1127432646593703936,66f4054c1bcfef8a1db99d5d6b9fe39ef48d8e259825c84ee1663760e98ae472,2019-05-12 12:37:44,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\n\r\nint n,q, x, y, ans;\r\nstruct node{\r\n    int l, r, w;\r\n}tree[400005];\r\nint p = 1;\r\nvoid build(int k, int ll, int rr){\r\n    tree[k].l = ll, tree[k].r = rr;\r\n    if(tree[k].l == tree[k].r)\r\n    {\r\n        scanf(\""%d\"", &tree[k].w);\r\n        return;\r\n    }\r\n    int mid = (ll + rr) / 2;\r\n    build(2*k, ll, mid);\r\n    build(2*k+1, mid+1, rr);\r\n    tree[k].w = tree[2*k].w+tree[2*k+1].w;\r\n}\r\nvoid find(int k){\r\n    if(tree[k].l >= x && tree[k].r <= y){\r\n        ans ^= tree[k].w;\r\n        return;\r\n    }\r\n    int mid =(tree[k].l + tree[k].r) / 2;\r\n    if(x <= mid) find(2*k);\r\n    if(y > mid) find(2*k+1);\r\n}\r\n\r\nint main()\r\n{\r\n    scanf(\""%d%d\"", &n, &q);\r\n    build(1, 1, n);\r\n    while(q--)\r\n    {\r\n        ans = 0;\r\n        scanf(\""%d%d\"", &x, &y);\r\n        find(1);\r\n        printf(\""%d\\n\"", ans);\r\n        \r\n    }\r\n    return 0;\r\n}\r\n",WRONG_ANSWER,15,768
1127432676700418048,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:37:51,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n];\r\n\t\tfor(int i=0;i<n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a-1];\r\n\t\t\tfor(int j=a;j<=b-1;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",TIME_LIMIT_EXCEEDED,2392,10784
1127432893948588032,5be1ea2fa56a2a415c4684b1d82c2cfbbc9ed554a0319b565278f2e2ef54c0bd,2019-05-12 12:38:43,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <bits/stdc++.h>\r\n#define fei(a, b) for(int i = a; i <= b; i++)\r\nconst int maxm = 0x3f3f3f3f;\r\nconst int maxn = 1e6 + 5;\r\nusing namespace std;\r\nint n, q;\r\n\r\nint arr[maxn];\r\nint arr2[maxn];\r\n\r\n// int Xor(int a, int b);\r\n\r\nint main()\r\n{\r\n    // freopen(\""in.txt\"", \""r\"", stdin);\r\n    scanf(\""%d %d\"", &n, &q);\r\n    arr2[0] = 0;\r\n    fei(1, n)\r\n    {\r\n        scanf(\""%d\"", &arr[i]);\r\n        //arr2[i] = Xor(arr[i], arr2[i - 1]);\r\n        arr2[i] = arr[i] ^ arr2[i - 1];\r\n       // cout << arr2[i] << endl;\r\n    }\r\n\r\n    while(q--)\r\n    {\r\n        int l, r;\r\n        scanf(\""%d %d\"", &l, &r);\r\n        printf(\""%d\\n\"", arr2[l - 1] ^ arr2[r]);\r\n        // cout << Xor(arr2[l - 1], arr2[r]) << endl;\r\n    }\r\n    return 0;\r\n}\r\n",ACCEPTED,498,13012
1127433130033377280,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:39:39,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n+1];\r\n\t\tfor(int i=1;i<=n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a];\r\n\t\t\tfor(int j=a;j<=b;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",WRONG_ANSWER,77,384
1127433392026382336,50732ce5653eeab9688efbe3dac184b142f0fd90eac47128099a03515d517d06,2019-05-12 12:40:42,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstring>\r\n#include <string>\r\n#include <algorithm>\r\n#include <fstream>\r\n\r\nusing namespace std;\r\nconst int maxn = 10e6 + 4;\r\nint num[maxn]; \r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor (int i = 1; i <= n; i++)\r\n\t{\r\n\t\tscanf(\""%lld\"", &num[i]);\r\n\t}\r\n\t\r\n\twhile (q--)\r\n\t{\r\n\t\tint l, r;\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tint ans = num[l];\r\n\t\tfor (int i = l + 1; i <= r; i++)\r\n\t\t{\r\n\t\t\tans = (ans ^ num[i]);\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", ans);\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,486,10784
1127433406366707712,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:40:45,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n+1];\r\n\t\tfor(int i=1;i<=n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a];\r\n\t\t\tfor(int j=a+1;j<=b;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",TIME_LIMIT_EXCEEDED,694,4304
1127433508216991744,1ca566e2913c6507ed4344fa677619bff7adea5b638b759f777cf0310b6d772a,2019-05-12 12:41:09,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nlong long int a[1000002];\r\nint main()\r\n{\r\n\tlong long int n,q,i ,sum,l,r,m,end,temp;\r\n\tscanf(\""%lld %lld\"",&n,&q);\r\n\tfor(i=1;i<=n;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&temp);\r\n\t\tif(i==1)\r\n\t\t{\r\n\t\t\ta[i]=temp;\r\n\t\t\tm=temp;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tm=m^temp;\r\n\t\t\ta[i]=m;\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\tscanf(\""%lld %lld\"",&l,&r);\r\n\t\tif(l-r==0)\r\n\t\tm=a[l];\r\n\t\telse \r\n\t\t{\r\n\t\t\tm=a[r]^a[l-1];\r\n\t\t\r\n\t\t}\r\n\tprintf(\""%lld\\n\"",m);\t\r\n\t}\r\n\t\r\n\treturn 0;\r\n } ",WRONG_ANSWER,11,384
1127433557298737152,50732ce5653eeab9688efbe3dac184b142f0fd90eac47128099a03515d517d06,2019-05-12 12:41:21,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstring>\r\n#include <string>\r\n#include <algorithm>\r\n#include <fstream>\r\n\r\nusing namespace std;\r\nconst int maxn = 10e6 + 4;\r\nint num[maxn]; \r\n\r\nint main()\r\n{\r\n\tint n, q;\r\n\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\tfor (int i = 1; i <= n; i++)\r\n\t{\r\n\t\tscanf(\""%d\"", &num[i]);\r\n\t}\r\n\t\r\n\twhile (q--)\r\n\t{\r\n\t\tint l, r;\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tint ans = num[l];\r\n\t\tfor (int i = l + 1; i <= r; i++)\r\n\t\t{\r\n\t\t\tans = (ans ^ num[i]);\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", ans);\r\n\t}\r\n\treturn 0;\r\n} ",TIME_LIMIT_EXCEEDED,486,10880
1127433576215048192,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:41:25,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n+1];\r\n\t\tfor(int i=1;i<=n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a];\r\n\t\t\tfor(int j=a+1;j<=b;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",TIME_LIMIT_EXCEEDED,685,4256
1127434095478272000,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:43:29,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n+1];\r\n\t\tfor(int i=1;i<=n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=num[a];\r\n\t\t\tfor(int j=a+1;j<=b;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",TIME_LIMIT_EXCEEDED,2396,10912
1127434519253970944,66f4054c1bcfef8a1db99d5d6b9fe39ef48d8e259825c84ee1663760e98ae472,2019-05-12 12:45:10,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\n\r\nint n,q, x, y, ans;\r\nstruct node{\r\n    int l, r, w;\r\n}tree[400005];\r\nint p = 1;\r\nvoid build(int k, int ll, int rr){\r\n    tree[k].l = ll, tree[k].r = rr;\r\n    if(tree[k].l == tree[k].r)\r\n    {\r\n        scanf(\""%d\"", &tree[k].w);\r\n        return;\r\n    }\r\n    int mid = (ll + rr) / 2;\r\n    build(2*k, ll, mid);\r\n    build(2*k+1, mid+1, rr);\r\n    tree[k].w = tree[2*k].w^tree[2*k+1].w;\r\n}\r\nvoid find(int k){\r\n    if(tree[k].l >= x && tree[k].r <= y){\r\n        ans ^= tree[k].w;\r\n        return;\r\n    }\r\n    int mid =(tree[k].l + tree[k].r) / 2;\r\n    if(x <= mid) find(2*k);\r\n    if(y > mid) find(2*k+1);\r\n}\r\n\r\nint main()\r\n{\r\n    scanf(\""%d%d\"", &n, &q);\r\n    build(1, 1, n);\r\n    while(q--)\r\n    {\r\n        ans = 0;\r\n        scanf(\""%d%d\"", &x, &y);\r\n        find(1);\r\n        printf(\""%d\\n\"", ans);\r\n    }\r\n    return 0;\r\n}\r\n",SEGMENTATION_FAULT,13,2304
1127434623801192448,66f4054c1bcfef8a1db99d5d6b9fe39ef48d8e259825c84ee1663760e98ae472,2019-05-12 12:45:35,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<bits/stdc++.h>\r\nusing namespace std;\r\n\r\n\r\nint n,q, x, y, ans;\r\nstruct node{\r\n    int l, r, w;\r\n}tree[4000005];\r\nint p = 1;\r\nvoid build(int k, int ll, int rr){\r\n    tree[k].l = ll, tree[k].r = rr;\r\n    if(tree[k].l == tree[k].r)\r\n    {\r\n        scanf(\""%d\"", &tree[k].w);\r\n        return;\r\n    }\r\n    int mid = (ll + rr) / 2;\r\n    build(2*k, ll, mid);\r\n    build(2*k+1, mid+1, rr);\r\n    tree[k].w = tree[2*k].w^tree[2*k+1].w;\r\n}\r\nvoid find(int k){\r\n    if(tree[k].l >= x && tree[k].r <= y){\r\n        ans ^= tree[k].w;\r\n        return;\r\n    }\r\n    int mid =(tree[k].l + tree[k].r) / 2;\r\n    if(x <= mid) find(2*k);\r\n    if(y > mid) find(2*k+1);\r\n}\r\n\r\nint main()\r\n{\r\n    scanf(\""%d%d\"", &n, &q);\r\n    build(1, 1, n);\r\n    while(q--)\r\n    {\r\n        ans = 0;\r\n        scanf(\""%d%d\"", &x, &y);\r\n        find(1);\r\n        printf(\""%d\\n\"", ans);\r\n    }\r\n    return 0;\r\n}\r\n",ACCEPTED,539,26880
1127434677043687424,1ca566e2913c6507ed4344fa677619bff7adea5b638b759f777cf0310b6d772a,2019-05-12 12:45:48,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<stdio.h>\r\nlong long int a[1000002];\r\nint main()\r\n{\r\n\tlong long int n,q ,sum,l,r,m,end,temp;\r\n\tint i;\r\n\tscanf(\""%lld %lld\"",&n,&q);\r\n\tfor(i=1;i<=n;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&temp);\r\n\t\tif(i==1)\r\n\t\t{\r\n\t\t\ta[i]=temp;\r\n\t\t\tm=temp;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tm=m^temp;\r\n\t\t\ta[i]=m;\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}\r\n\twhile(q--)\r\n\t{\r\n\t\tscanf(\""%lld %lld\"",&l,&r);\r\n\t\tif(l-r==0)\r\n\t\tm=a[r]^a[l-1];\r\n\t\telse \r\n\t\tm=a[r]^a[l-1];\r\n\tprintf(\""%lld\\n\"",m);\t\r\n\t}\r\n\t\r\n\treturn 0;\r\n } ",ACCEPTED,523,10892
1127435948572110848,4f3d3b52e2779beaa11bdc0007ff1d369195a5eb1e1143f8c7a6d1aef8b9cf6a,2019-05-12 12:50:51,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\nusing namespace std;\r\nint main(){\r\n        int n, q;\r\n        cin>>n>>q;\r\n\t\tint num[n+1];\r\n\t\tfor(int i=1;i<=n;i++){\r\n            cin>>num[i];\r\n\t\t}\r\n\t\tfor(int i=0;i<q;i++){\r\n            int a,b;\r\n            cin>>a>>b;\r\n\t\t\tint result=0;\r\n\t\t\tfor(int j=a;j<=b;j++){\r\n\t\t\t\tresult=result^num[j];\r\n\t\t\t}\r\n            cout<<result<<endl;\r\n\t\t}\r\n\t}\r\n",TIME_LIMIT_EXCEEDED,2395,10784
1127436239270932480,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 12:52:00,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\ntypedef struct zuobiao{\r\n\tint x;\r\n\tint y;\r\n};\r\nint mes[1000006]={-1};\r\nint messtore[1000006][1000006]={-1};\r\nzuobiao find(int start,int end){\r\n\tzuobiao z;\r\n\tint x= start;\r\n\tint y = end;\r\n\tbool flag = true;\r\n    while(messtore[x][y]!=-1||x>=y){\r\n    \tif(flag){\r\n    \t\ty--;\r\n    \t\tflag=false;\r\n\t\t}else{\r\n\t\t\tx++;\r\n\t\t\tflag=true;\r\n\t\t}\r\n\t}\r\n\tif(x<y){\r\n\t\tz.x=x;\r\n\t\tz.y=y;\r\n\t\treturn z;\r\n\t}else{\r\n\t\tz.x=0;\r\n\t\tz.y=0;\r\n\t\treturn z;\r\n\t}\r\n}\r\nint yihuo(int start,int end){\r\n\tint temp=0;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tzuobiao z = find(start,end);\r\n\t\tif(z.x==0){\r\n\t\t\tfor(int i = start;i<=end;i++){\r\n\t\t    temp = temp^mes[i];\r\n\t\t}\r\n\t\t}else{\r\n\t\t\tfor(int i = start;i<=z.x-1;i++){\r\n\t\t\t\ttemp = temp^mes[i];\r\n\t\t\t}\r\n\t\t\tfor(int i = z.y+1;i<=end;i++){\r\n\t\t\t\ttemp = temp^mes[i];\r\n\t\t\t}\r\n\t\t\ttemp = temp^messtore[z.x][z.y];\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t}\r\n\t\r\n\tmesstore[start][end]=temp;\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\t//int temp;\r\n\t\tscanf(\""%d\"",&mes[i]);\r\n\t\t//cin>>temp;\r\n\t\t//mes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tscanf(\""%d%d\"",&start,&end);\r\n\t\t//cin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tprintf(\""%d\\n\"",store[i]);\r\n\t}\r\n\treturn 0;\r\n}",COMPILE_ERROR,0,0
1127436291997528064,57677a01d5944dc8f5f28091d97757fc15042b38cd3e509c7050779786c16999,2019-05-12 12:52:13,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"\r\n#include<bits/stdc++.h> \r\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\r\nusing namespace std;\r\ntypedef struct zuobiao{\r\n\tint x;\r\n\tint y;\r\n};\r\nint mes[1000006]={-1};\r\nint messtore[1000006][1000006]={-1};\r\nzuobiao find(int start,int end){\r\n\tzuobiao z;\r\n\tint x= start;\r\n\tint y = end;\r\n\tbool flag = true;\r\n    while(messtore[x][y]!=-1||x>=y){\r\n    \tif(flag){\r\n    \t\ty--;\r\n    \t\tflag=false;\r\n\t\t}else{\r\n\t\t\tx++;\r\n\t\t\tflag=true;\r\n\t\t}\r\n\t}\r\n\tif(x<y){\r\n\t\tz.x=x;\r\n\t\tz.y=y;\r\n\t\treturn z;\r\n\t}else{\r\n\t\tz.x=0;\r\n\t\tz.y=0;\r\n\t\treturn z;\r\n\t}\r\n}\r\nint yihuo(int start,int end){\r\n\tint temp=0;\r\n\tif(start==end){\r\n\t\ttemp=mes[start];\r\n\t}else{\r\n\t\tzuobiao z = find(start,end);\r\n\t\tif(z.x==0){\r\n\t\t\tfor(int i = start;i<=end;i++){\r\n\t\t    temp = temp^mes[i];\r\n\t\t}\r\n\t\t}else{\r\n\t\t\tfor(int i = start;i<=z.x-1;i++){\r\n\t\t\t\ttemp = temp^mes[i];\r\n\t\t\t}\r\n\t\t\tfor(int i = z.y+1;i<=end;i++){\r\n\t\t\t\ttemp = temp^mes[i];\r\n\t\t\t}\r\n\t\t\ttemp = temp^messtore[z.x][z.y];\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t}\r\n\t\r\n\tmesstore[start][end]=temp;\r\n\treturn temp; \r\n}\r\nint main(int argc, char** argv) {\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\in.txt\"",r,stdin);\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Documents\\\\WHJ\\\\out.txt\"",w,stdout);\r\n\tint a,b;\r\n\tvector<int> store;\r\n\tcin>>a>>b;\r\n\tfor(int i = 1;i<=a;i++){\r\n\t\t//int temp;\r\n\t\tscanf(\""%d\"",&mes[i]);\r\n\t\t//cin>>temp;\r\n\t\t//mes[i]=temp;\r\n\t}\r\n\tfor(int i = 0;i<b;i++){\r\n\t\tint start,end;\r\n\t\tscanf(\""%d%d\"",&start,&end);\r\n\t\t//cin>>start>>end;\r\n\t\tstore.push_back(yihuo(start,end));\r\n\t}\r\n\tfor(int i = 0;i<store.size();i++){\r\n\t\tprintf(\""%d\\n\"",store[i]);\r\n\t}\r\n\treturn 0;\r\n}",COMPILE_ERROR,0,0
1127436315074588672,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 12:52:18,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<bits/stdc++.h>\r\nusing namespace std;\r\nstruct node{\r\n\tint l,r,g;\r\n}n[400005];\r\nvector<int> v;\r\nint ans;\r\nvoid build(int l,int r,int no){\r\n\tn[no].l=l;\r\n\tn[no].r=r;\r\n\tif(l==r){\r\n\t\tscanf(\""%d\"",&n[no].g);\r\n\t\treturn;\r\n\t}\r\n\tint mid=(l+r)/2;\r\n\tbuild(l,mid,no*2);\r\n\tbuild(mid+1,r,no*2+1);\r\n\tn[no].g=n[no*2].g^n[no*2+1].g;\r\n\treturn;\r\n}\r\nvoid q(int l,int r,int no){\r\n\tif(l<=n[no].l&&r>=n[no].r){\r\n\t\tif(ans==0)\r\n\t\t\tans=n[no].g;\r\n\t\telse\r\n\t\t\tans=ans^n[no].g;\r\n\t\treturn;\r\n\t}\r\n\tint mid=(n[no].l+n[no].r)/2;\r\n//\tif((r<n[no].l)||(l>n[no].r))\r\n//\t\treturn;\r\n//\tq(l,r,no*2);\r\n//\tq(l,r,no*2+1);\r\n\tif(l<=mid)\r\n\t\tq(l,r,no*2);\r\n\tif(r>mid)\r\n\t\tq(l,r,no*2+1);\r\n\treturn;\t\r\n}\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint z,m;\r\n\tcin>>z>>m;\r\n\tbuild(1,z,1);\r\n\tint a,b,c;\r\n\tfor(int i=0;i<m;i++){\r\n\t\tans=0;\r\n\t\tcin>>a>>b;\r\n\t\tq(a,b,1);\r\n\t\tcout<<ans<<endl;\r\n\t}\r\n\tfor(int i=1;i<=9;i++)\r\n\t\t//cout<<n[i].g<<\"" \""<<n[i].l<<\"" \""<<n[i].r<<endl;\r\n\treturn 0;\r\n}",SEGMENTATION_FAULT,29,2556
1127436414487982080,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 12:52:42,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<bits/stdc++.h>\r\nusing namespace std;\r\nstruct node{\r\n\tint l,r,g;\r\n}n[4000005];\r\nvector<int> v;\r\nint ans;\r\nvoid build(int l,int r,int no){\r\n\tn[no].l=l;\r\n\tn[no].r=r;\r\n\tif(l==r){\r\n\t\tscanf(\""%d\"",&n[no].g);\r\n\t\treturn;\r\n\t}\r\n\tint mid=(l+r)/2;\r\n\tbuild(l,mid,no*2);\r\n\tbuild(mid+1,r,no*2+1);\r\n\tn[no].g=n[no*2].g^n[no*2+1].g;\r\n\treturn;\r\n}\r\nvoid q(int l,int r,int no){\r\n\tif(l<=n[no].l&&r>=n[no].r){\r\n\t\tif(ans==0)\r\n\t\t\tans=n[no].g;\r\n\t\telse\r\n\t\t\tans=ans^n[no].g;\r\n\t\treturn;\r\n\t}\r\n\tint mid=(n[no].l+n[no].r)/2;\r\n//\tif((r<n[no].l)||(l>n[no].r))\r\n//\t\treturn;\r\n//\tq(l,r,no*2);\r\n//\tq(l,r,no*2+1);\r\n\tif(l<=mid)\r\n\t\tq(l,r,no*2);\r\n\tif(r>mid)\r\n\t\tq(l,r,no*2+1);\r\n\treturn;\t\r\n}\r\nint main(){\r\n\t////freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint z,m;\r\n\tcin>>z>>m;\r\n\tbuild(1,z,1);\r\n\tint a,b,c;\r\n\tfor(int i=0;i<m;i++){\r\n\t\tans=0;\r\n\t\tcin>>a>>b;\r\n\t\tq(a,b,1);\r\n\t\tcout<<ans<<endl;\r\n\t}\r\n\tfor(int i=1;i<=9;i++)\r\n\t\t//cout<<n[i].g<<\"" \""<<n[i].l<<\"" \""<<n[i].r<<endl;\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,224,27136
1127436848632000512,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 12:54:26,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <stdio.h>\r\n#include <stdlib.h>\r\n\r\nint main(){\r\n\tint n, q, l, r, res;\r\n\tint *a = NULL;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\ta = (int *)malloc(n * sizeof(int) );\r\n\tfor(int i=0; i<n; i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tfor(int i=0; i<q; i++){\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tres = a[l-1];\r\n\t\tfor(int j=l; j<=r-1; j++){\r\n\t\t\tres = res^a[j];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", res);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,492,10752
1127436876406681600,69f7166e50fa3d78e21db3308715e00d27b6d92f319b26780f7b85296726b14f,2019-05-12 12:54:32,C++,20.0,1127197494785449984,1125976118128910336,976506807128301568,"#include<iostream>\r\n#include<bits/stdc++.h>\r\nusing namespace std;\r\nstruct node{\r\n\tint l,r,g;\r\n}n[4000005];\r\nvector<int> v;\r\nint ans;\r\nvoid build(int l,int r,int no){\r\n\tn[no].l=l;\r\n\tn[no].r=r;\r\n\tif(l==r){\r\n\t\tscanf(\""%d\"",&n[no].g);\r\n\t\treturn;\r\n\t}\r\n\tint mid=(l+r)/2;\r\n\tbuild(l,mid,no*2);\r\n\tbuild(mid+1,r,no*2+1);\r\n\tn[no].g=n[no*2].g^n[no*2+1].g;\r\n\treturn;\r\n}\r\nvoid q(int l,int r,int no){\r\n\tif(l<=n[no].l&&r>=n[no].r){\r\n\t\tif(ans==0)\r\n\t\t\tans=n[no].g;\r\n\t\telse\r\n\t\t\tans=ans^n[no].g;\r\n\t\treturn;\r\n\t}\r\n\tint mid=(n[no].l+n[no].r)/2;\r\n//\tif((r<n[no].l)||(l>n[no].r))\r\n//\t\treturn;\r\n//\tq(l,r,no*2);\r\n//\tq(l,r,no*2+1);\r\n\tif(l<=mid)\r\n\t\tq(l,r,no*2);\r\n\tif(r>mid)\r\n\t\tq(l,r,no*2+1);\r\n\treturn;\t\r\n}\r\nint main(){\r\n\t//freopen(\""C:\\\\Users\\\\Lenovo\\\\Desktop\\\\in.txt\"",\""r\"",stdin);\r\n\tint z,m;\r\n\tscanf(\""%d%d\"",&z,&m);\r\n\tbuild(1,z,1);\r\n\tint a,b,c;\r\n\tfor(int i=0;i<m;i++){\r\n\t\tans=0;\r\n\t\tscanf(\""%d%d\"",&a,&b);\r\n\t\tq(a,b,1);\r\n\t\tcout<<ans<<endl;\r\n\t}\r\n\t//for(int i=1;i<=9;i++)\r\n\t\t//cout<<n[i].g<<\"" \""<<n[i].l<<\"" \""<<n[i].r<<endl;\r\n\treturn 0;\r\n}",ACCEPTED,1866,27000
1127437875666055168,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 12:58:30,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <stdio.h>\r\n#include <stdlib.h>\r\n\r\nint main(){\r\n\tint n, q, l, r, res;\r\n\tint *a = NULL;\r\n\tscanf(\""%d%d\"", &n, &q);\r\n\ta = (int *)malloc(n * sizeof(int) );\r\n\tfor(int i=0; i<n; i++){\r\n\t\tscanf(\""%d\"", &a[i]);\r\n\t}\r\n\tfor(int i=0; i<q; i++){\r\n\t\tscanf(\""%d%d\"", &l, &r);\r\n\t\tres = a[l-1];\r\n\t\tfor(int j=l; j<=r-1; j++){\r\n\t\t\tres = res^a[j];\r\n\t\t}\r\n\t\tprintf(\""%d\\n\"", res);\r\n\t}\r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,578,10656
1127437947116023808,99af5fd5408fa8722e550ba508b1ce5fe5bfefc001fe66dd944e4eca6a2b0710,2019-05-12 12:58:48,C++,20.0,1127197494777061376,1125965660827262976,976506807128301568,"#include <stdio.h>\r\n\r\nint main(){\r\n\tint n, cnt, tmp;\r\n\tscanf(\""%d\"", &n);\r\n\tcnt = 1;\r\n\ttmp = 1;\r\n\twhile(n > tmp){\r\n\t\ttmp = (tmp + 1) * 2 - 1;\r\n\t\tcnt ++;\r\n\t}\r\n\tprintf(\""%d\\n\"", cnt);\r\n\treturn 0;\r\n}",ACCEPTED,12,256
1127438030599450624,3fa97ae79c53a18d23c4e10f8a3fe592fab3c8a0c63236326ca7cd126ecc0ce2,2019-05-12 12:59:07,C++,0.0,1127197494785449984,1125976118128910336,976506807128301568,"#include <iostream>\r\n#include <cstdlib>\r\n#include <cstdio>\r\n#include <cstring>\r\n#include <cmath>\r\nusing namespace std;\r\nint N;\r\nint Q;\r\nconst int MAX_N=1000005;\r\nlong long num[MAX_N];\r\nlong long Ans[MAX_N];\r\nlong long q[MAX_N][2];\r\n\r\nlong long axor(long long a,long long b)\r\n{\r\n\tint dp[40];\r\n\tmemset(dp,0,sizeof(dp));\r\n\tint ans=0;\r\n\tfor(int i=a-1;i<=b-1;i++)\r\n\t{\r\n\t\tint cnt=0;\r\n\t\tint y=0;\r\n\t\ty=num[i];\r\n\t\twhile(y/2!=0)\r\n\t\t{\r\n\t\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t\t\ty=y/2;\r\n\t\t\tcnt++;\r\n\t\t} \r\n\t\tdp[cnt]=dp[cnt]+y%2;\r\n\t}\r\n\tfor(int i=0;i<40;i++)\r\n\t{\r\n\t\tif(dp[i]%2==1)\r\n\t\t{\r\n\t\t\tans=ans+pow(2,i);\r\n\t\t}\r\n\t} \r\n\treturn ans;\r\n}\r\n\r\nint main(int argc, char** argv) {\r\n\tmemset(num,0,sizeof(num));\r\n\tint a,b;\r\n\tscanf(\""%d %d\"",&N,&Q);\r\n\tfor(int i=0;i<N;i++)\r\n\t{\r\n\t\tscanf(\""%d\"",&num[i]);\r\n\t}\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\tscanf(\""%d %d\"",&q[i][0],&q[i][1]);\r\n\t\t//Ans[i]=axor(a,b);\r\n\t} \r\n\t\r\n\tfor(int i=0;i<Q;i++)\r\n\t{\r\n\t\t//cout<<Ans[i]<<endl;\r\n\t\tprintf(\""%d\\n\"",axor(q[i][0],q[i][1]));\r\n\t} \r\n\treturn 0;\r\n}",TIME_LIMIT_EXCEEDED,0,0