# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637466 | ram | Cluedo (IOI10_cluedo) | 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 <bits/stdc++.h>
using namespace std;
int solve() {
int m = 1, l = 1; w = 1, c = -1;
while (true) {
c = Theory(m, l, w);
if (c == 0) break;
if (c == 1) m++;
else if (c == 2) l++;
else w++;
}
return;
}