# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1275707 | marckv | Cluedo (IOI10_cluedo) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
// Provided by the grader (you don’t implement this)
int Theory(int murderer, int location, int weapon);
// You must implement this
void Solve() {
// your logic goes here
// repeatedly call Theory(...) until it returns 0
for (int i=1; i<=6; i++) {
for (int j=1; j<=10; j++) {
for (int k=1; k<=6; k++) {
if (Theory(i, j, k) == 0) return;
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// The grader / judge environment might invoke Solve() repeatedly.
// In some setups, main should call Solve() once, and the grader handles
// multiple test cases by itself.
Solve();
return 0;
}