# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092650 | SulA | 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) {
for (int i = 0; i < 64; i++) if (b[i]) c ^= i;
int a[1] = { c };
return a;
}
int find_coin(int[] b) {
int c = 0;
for (int i = 0; i < 64; i++) if (b[i]) c ^= i;
return c;
}