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