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]={1};
for(int i=0;i<3;i++)a[i]=1;
//printf("\n");
while(1){
int r=Theory(a[0],a[1],a[2]);
// for(int i=0;i<3;i++)printf("%d ",a[i]);
// printf("\n");
if(r!=0)a[r-1]++;
else return;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |