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 <vector>
using namespace std;
vector<int> coin_flips(vector<int> b, int c) {
int x = 0;
for(int i=0;i<=63;++i) if(b[i] == 1) x = x ^ b[i];
x = x ^ c;
vector<int>ans;
ans.push_back(x);
return ans;
}
int find_coin(vector<int> b) {
int ans = 0;
for(int i=0;i<64;++i) if(b[i] == 1) ans = ans ^ b[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... |