# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637473 | as111 | 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 <coins.h>
#include <vector>
using namespace std;
vector<int> coin_flips(int b[], int c) {
int A = 0;
for (int i = 0; i < 64; i++) {
A = A ^ (i * b[i]);
}
vector<int> flips;
flips.push_back(c ^ A);
return flips;
}
int find_coin(int b[]) {
int X = 0;
for (int i = 0; i < 64; i++) {
X = X ^ (i * b[i]);
}
return X;
}