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 <coins.h>
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
vector<int> coin_flips(vector<int> b,int c) {
int xr = 0;
for (int i = 0;i<63;i++) if (b[i])xr^=i;
b[xr^c] = !b[xr^c];
return b;
}
int find_coin(vector<int> b) {
int xr = 0;
for (int i = 0;i<63;i++) if (b[i]) xr^=i;
return xr;
}
/*int main() {
vector<int> a(64);
for (int i = 0;i<63;i++) a[i]=rng()%2;
a = coin_flips(a,rng()%64);
cout<<find_coin(a)<<endl;
return 0;
}*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |