# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524023 | Deepesson | 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>
#include "coins.h"
std::vector<int> coin_flips(std::vector<int> b, int c) {
std::vector<int> flips(1);
long long xoro=0;
for(int i=0;i!=b.size();++i)if(b[i])xoro^=x;
long long quer = c^xoro;
flips[0]=quer;
return flips;
}
int find_coin(std::vector<int> b) {
int ans=0;
for(auto&x:b)ans^=x;
return ans;
}