# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
885296 | 12345678 | 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 "grader.h"
#include "cluedo.h"
void Solve(){
int a[3];
a[0]=a[1]=a[2]=1;
while (1)
{
printf("%d %d %d\n", a[0], a[1], a[2]);
int x=Theory(a[0], a[1], a[2]);
if (x==0) break;
a[x-1]++;
}
return;
}