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>
using namespace std;
vector<int> coin_flips(vector<int> b, int c){
int xr = 0;
for (int i = 0; i < 64; i++) if (b[i]) xr ^= i;
b[c^xr] = 1-b[c^xr];
return b;
}
int find_coin(vector<int> b){
int xr = 0;
for (int i = 0; i < 64; i++) if (b[i]) xr ^= i;
return xr;
}
# | 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... |