# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
989949 | the_coding_pooh | 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>
#define uwu return 0;
using namespace std;
void Solve(){
queue <int> q[4];
for (int i = 1; i <= 6; i++){
q[1].push(i);
}
for (int i = 1; i <= 10; i++){
q[2].push(i);
}
for (int i = 1; i <= 6; i++){
q[3].push(i);
}
int ret;
while (ret = Theory(q[1].front(), q[2].front(), q[3].front())){
q[ret].pop();
}
return;
}