| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1175242 | wernklung | Cluedo (IOI10_cluedo) | C++20 | 0 ms | 0 KiB | 
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
void Solve() {
   set<int> m_choice = {1,2,3,4,5,6};
   set<int> l_choice = {1,2,3,4,5,6,7,8,9,10};
   set<int> w_choice = {1,2,3,4,5,6};
   while(true){
    int m=m_choice[0];
    int l=l_choice[0];
    int w=w_choice[0];
    int result = Theory(m,l,w);
    if(result == 0){
        break;
    }
    else if(result == 1){
        m_choice.erase(m);
    }
    else if(result == 2){
        l_choice.erase(l);
    }
    else if(result == 3){
        l_choice.erase(w);
    }
   }
}
