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> bs, int c) {
int n = bs.size();
int x = 0;
for (int i = 0; i < n; ++i)
if (bs[i]) x ^= i;
x ^= c;
return {x};
}
int find_coin(vector<int> bs) {
int n = bs.size();
int x = 0;
for (int i = 0; i < n; ++i)
if (bs[i]) x ^= i;
return x;
}
# | 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... |