# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571346 | RandomLB | Coins (IOI17_coins) | C++17 | 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;
int[] coin_flips(int[] b, int c){
int xr = 0;
for (int i = 0; i < 64; i++) if (b[i]) xr ^= i;
b[c^xr] = 1-b[c^xr];
retrun b;
}
int find_coin(int b[64]){
int xr = 0;
for (int i = 0; i < 64; i++) if (b[i]) xr ^= i;
return xr;
}