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 <algorithm>
using namespace std;
vector<int> coin_flips(vector<int> b, int c) {
vector <int> flips;
for (int i = 0; i < 6; ++i)
{
if ((c & (1 << i)) && !b[i]) flips.emplace_back(i);
if (!(c & (1 << i)) && b[i]) flips.emplace_back(i);
}
flips.emplace_back(63);
return flips;
}
int find_coin(vector<int> b) {
int ans = 0;
for (int i = 0; i < 6; ++i)
if (b[i])
ans += (1 << 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... |