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 xs = 0;
for (int i = 0; i < 64; i ++)
xs ^= b[i] * i;
vector<int> v(1, xs ^ c);
return v;
}
int find_coin(vector<int> b) {
int xs = 0;
for (int i = 0; i < 64; i ++)
xs ^= b[i] * i;
return xs;
}
# | 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... |