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