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