Submission #247347

#TimeUsernameProblemLanguageResultExecution timeMemory
247347dwscMouse (info1cup19_mouse)C++14
6.00 / 100
3048 ms384 KiB
#include <bits/stdc++.h> #include "grader.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())); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...