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