# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1267009 | ti24dung_nt | Cluedo (IOI10_cluedo) | C++20 | 0 ms | 0 KiB |
#include<grader.h>
#include<cluedo.h>
void Solve()
{
bool found = false;
int murd = 1, loca = 1, weap = 1;
while(found == false)
{
cout << "Theory(" << murd << "," << loca << "," << weap << ")" << endl;
cout.flush();
int type;
cin >> type;
if(type == 0)
{
found = true;
}
else if(type == 1)
{
if(murd < 6) ++murd;
}
else if(type == 2)
{
if(loca < 10) ++loca;
}
else
{
if(weap < 6) ++weap;
}
}
return 0;
}