# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
956017 | 2024-03-31T19:50:48 Z | emad234 | Cluedo (IOI10_cluedo) | C++17 | 0 ms | 0 KB |
#include "grader.h" #include "cluedo.h" #include <bits/stdc++.h> #define ll long long #define F first #define S second #define pii pair<ll, ll> const ll mod = 1e9 + 7; const ll mxN = 1e7 + 5; using namespace std; void Solve(){ int i = 1,j = 1,k = 1; while(1){ int th = Theory(i,j,k); if(th == 0) return th; if(th == 1) i++; if(th == 2) j++; if(th == 3) k++; } }