# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595238 | SlyGaleeb | Cluedo (IOI10_cluedo) | C++17 | 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>
using namespace std;
typedef long long ll;
#define ld long double
#define F first
#define S second
int Theory (int a, int b, int c);
void Solve () {
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_base::sync_with_stdio(false);
cin.tie(NULL);
}*/