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