# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758278 | JANCARAPAN | Cluedo (IOI10_cluedo) | C++17 | 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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define sz(a) (long long) a.size()
#define endl '\n'
const long long INF = 1e18, MOD = 1e9+7;
void Solve() {
int i = 1, j = 1, k = 1;
for (int t = 0; t < 20; t++) {
int ans = Theory(i, j, k);
if (ans == 0) return;
if (ans == 1) i++;
else if (ans == 2) j++;
else k++;
}
}
//signed main() {
//ios_base::sync_with_stdio(false);
//cin.tie(0);
//int tt = 1;
//cin >> tt;
//while (tt--) {
//test_case();
//}
//return 0;
//}