# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396559 | ak2006 | 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;
void Solve()
{
int i = 1,j = 1,k = 1;
int pos = Theory(i,j,k);
while (pos != 0){
if (pos == 1)i++;
if (pos == 2)j++;
if (pos == 3)k++;
pos = Theory(i,j,k);
}
}