# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093378 | Uniq0rn | Coins (IOI17_coins) | C++14 | 0 ms | 0 KiB |
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 p = 0;
for(int i=0;i<64;i++){
if(b[i]) continue;
p ^= i;
}
c ^= p;
return {c};
}
int find_coin(vector<int>& b){
int p = 0;
for(int i=0;i<64;i++){
if(b[i]) p ^= i;
}
return p;
}