Submission #339573

#TimeUsernameProblemLanguageResultExecution timeMemory
339573fixikmilaXoractive (IZhO19_xoractive)C++14
6 / 100
1 ms364 KiB
#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-4;i+=2){ int x=ask(i+1); a[i]-x; vector<int>c,y; c.push_back(i+1); c.push_back(i+2); с.push_back(i+3); c.push_back(i+4); y=get_pairwise_xor(c); do{ m=y.size(); if() }while(next_permutation(y.begin(),y.end())); }*/ for(int i=0;i<n;i++){ a[i]=ask(i+1); } return a; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...