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