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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll , ll> ii;
#define ff first
#define ss second
#define pb push_back
#define in insert
std::vector<int> coin_flips(std::vector<int> b, int c) {
int x = c;
for(int i = 0; i < 64; i++){
x ^= (b[i] * i);
}
vector < int > f;
f.pb(x);
return f;
}
int find_coin(std::vector<int> b) {
int c = 0;
for(int i = 0; i < 64; i++){
c ^= (b[i] * 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... |