| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 819679 | enerelt14 | Coins (IOI17_coins) | C++14 | 0 ms | 0 KiB |
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 "candies.h"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
vector<int> coin_flips(vector<int> b, int c) {
for(int i = 0; i < 3; i++) {
b[i] = 1 - b[i];
bool is = 1;
for(int j = 0; j < 3; j++) {
if(i != j && b[i] == b[j]) is = 0;
}
if(is) return b;
b[i] = 1 - b[i];
}
}
int find_coin(vector<int> b) {
for(int i = 0; i < 3; i++) {
bool is = 1;
for(int j = 0; j < 3; j++) {
if(i != j && b[i] == b[j]) is = 0;
}
if(is) return i;
}
}