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