# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
648603 | a_aguilo | 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<bits/stdc++.h>
using namespace std;
vector<int> coin_flips(vector<int> b, int c) {
vector<int> flips(1);
int TotalXOR = 0;
for(int i = 0; i < 64; ++i){
if(b[i]) TotalXor ^= i;
}
flips[0] = TotalXOR^c;
return flips;
}
int find_coin(vector<int> b) {
int ans = 0;
for(int i = 0; i < 64; ++i){
if(b[i]) ans^=i;
}
return ans;
}