# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339571 | fixikmila | Xoractive (IZhO19_xoractive) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include<interactive.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,ll>pll;
typedef long double ld;
ll bin_pow(ll a,ll b){
if(b==0)return 1;
if(b%2==0){
ll t=bin_pow(a,b/2);
return t*t%MOD;
}
else return a*bin_pow(a,b-1)%MOD;
}
vector<int> guess(int n){
vector<int>a(n);
for(int i=0;i<=n-2;i+=2){
int x=ask(i+1);
vector<int>c,y;
c.push_back(i+1);
c.push_back(i+2);
//с.push_back(i+3);
y=get_pairwise_xor(c);
int z=y.back()^x;
a[i]=x;
a[i+1]=z;
}
if(n%2==1){
x=ask(n);
a[n-1]=x;
}
return a;
}