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;
template<typename T,int sz>using ar=array<T, sz>;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define endl '\n'
vector<int> coin_flips(vector<int> b, int c) {
vector<int> turn;
if(c==0){
if(b[0] == b[1]){
turn.pb(63);
}
else{
turn.pb(0);
}
}
else{
if(b[0] == b[1]){
turn.pb(0);
}
else{
turn.pb(63);
}
}
return turn;
}
int find_coin(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... |