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"
std::vector<int> coin_flips(std::vector<int> b, int c) {
if(c==0){
if(b[0] == b[1]){
b[63] = 1-b[63];
}
else{
b[0] = 1-b[0];
}
}
else{
if(b[0] == b[1]){
b[0] = 1-b[0];
}
else{
b[63] = 1-b[63];
}
}
return b;
}
int find_coin(std::vector<int> b) {
return b[0] != b[1];
}
# | 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... |