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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
constexpr bool typetest = 0;
constexpr int N = 1e5 + 5;
#define bit(i, x) (((x) >> (i)) & 1)
vector<int> coin_flips(vector<int> b, int c)
{
vector<int> ans;
for (int i = 0; i < 6; ++i)
if (b[i] != bit(i, c))
ans.emplace_back(i);
return ans;
}
int find_coin(vector<int> b)
{
int ans(0);
for (int i = 0; i < 5; ++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... |