# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715478 | vjudge1 | Cluedo (IOI10_cluedo) | C++11 | 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>
#include "grader.h"
#include "cluedo.h"
using namespace std;
static int M,L,W,gotit,cnt,maxcnt;
void Solve()
{
int arr[4]= {1,1,1,1};
while(Theory(arr[1],arr[2],arr[3]))
{
int now=Theory(arr[1],arr[2],arr[3]);
arr[now]++;
}
return;
}
int main()
{
while (3 == scanf("%d%d%d",&M,&L,&W))
{
cnt = gotit = 0;
Solve();
if (cnt > maxcnt) maxcnt = cnt;
if (!gotit)
{
printf("NO\n");
return 91;
}
}
printf("OK %d\n",maxcnt);
return 0;
}