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