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;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,b) for(int i=a; i<b; i++)
#define all(x) x.begin(),x.end()
using ll=long long;
#include "grader.h"
#include "cluedo.h"
void Solve(){
int r;
int m=1,l=1,w=1;
while(true){
r=Theory(m,l,w);
if(r==0)break;
else if(r==1){
m++;
}
else if(r==2){
l++;
}
else if(r==3){
w++;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |