# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
652568 | ngano_upat_na | 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;
void Solve() {
int mur = 1, loc = 1, wep = 1;
int res = -1;
while (true) {
int res = Theory(mur,loc,wep);
if (res == 0) return;
if (res == 1) mur++;
if (res == 2) loc++;
if (res == 3) wep++;
}
}