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<bits/stdc++.h>
#include "coins.h"
using namespace std;
// const ll INF = 1e12;
// const ll N =(1e5+5); // TODO : change value as per problem
// const ll MOD = 1e9;
vector<int> coin_flips(vector<int> b, int c) {
int x = 0;
for(int i = 0;i<64;i++){
if(b[i])
x ^= b[i];
}
if(x == 0) {
// even number of 1s
vector<int> v;
v.push_back(c);
return v;
}
else{
// odd number of 1s
vector<int> v;
v.push_back(c ^ x);
return v;
}
}
int find_coin(vector<int> b) {
int x =0;
for(int i =0;i<64;i++)
if(b[i])
x ^= b[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... |