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 <vector>
using std::vector;
std::vector<int> coin_flips(std::vector<int> b, int c) {
std::vector<int> v;
for (int i = 0; i < 7; i++) {
if (b[i] != (c & (1 << i)))
v.push_back(i);
}
return v;
}
int find_coin(std::vector<int> b) {
int c = 0;
for (int i = 0; i < 7; i++) {
c += (1 << i);
}
return c;
}
# | 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... |