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> b, int c)
{
int tmp = 0;
for (int i = 0; i < 64; i++) {
if (b[i]) tmp ^= i;
}
b[tmp ^ c] = !b[tmp ^ c];
return b;
}
int find_coin(vector<int> b)
{
int ans = 0;
for (int i = 0; i < 64; i++) {
if (b[i]) ans ^= i;
}
return ans;
}
# | 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... |