# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247344 | 2020-07-11T08:52:22 Z | dwsc | Mouse (info1cup19_mouse) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; void solve(int N){ vector<int> v; for (int i = 1; i <= N; i++) v.push_back(i); do{ int val = query(v); if (val == N) return; }while(next_permutation(v.begin(),v.end())); }