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"
using namespace std;
vector<int> coin_flips(vector<int> v, int c) {
int Xor = 0;
for (int i = 0; i < 64; ++i) {
if (v[i] == 1) Xor ^= i;
}
vector<int> ret(1, Xor^c);
return ret;
}
int find_coin(vector<int> v) {
int ret = 0;
for (int i = 0; i < 64; ++i) {
if (v[i] == 1) ret ^= i;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |