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;
typedef vector<int> vi;
const int N = 64;
vi coin_flips(vi aa, int a) {
for (int i = 0; i < N; i++)
if (aa[i])
a ^= i;
return { a };
}
int find_coin(vi aa) {
int a = 0;
for (int i = 0; i < N; i++)
if (aa[i])
a ^= i;
return a;
}
# | 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... |