# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660259 | Truitadepatates | 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;
#include "coins.h"
int[] coins_flips(int[] b, int c){
int ans = 0;
for (int i = 0; i < 64; i++){
if (b[i] == 1) ans ^= i;
}
ans ^= c;
int[1] flip;
flip[0] = ans;
return flip;
}
int find_coin(int[]b){
int c = 0;
for (int i = 0; i < 64; i++){
if (b[i] == 1) c ^= i;
}
return c;
}