# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950140 | 2024-03-20T05:52:44 Z | pcc | Mouse (info1cup19_mouse) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define pii pair<int,int> #define fs first #define sc second #define tlll tuple<ll,ll,ll> void solve(int N){ if(N>7)return; vector<int> v; for(int i = 1;i<=N;i++)v.push_back(i); while(query(v) != N&&next_permutation(v.begin(),v.end())); return; }