Submission #315093

#TimeUsernameProblemLanguageResultExecution timeMemory
315093daniel920712Mouse (info1cup19_mouse)C++14
0 / 100
0 ms256 KiB
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <algorithm> #include "grader.h" using namespace std; struct A { int all[10]; }all[6000],guess[105]; vector < int > how; void solve(int N) { int i; for(i=0;i<N;i++) how.push_back(i); do { if(query(how)==N) return; }while(next_permutation(how.begin(),how.begin())); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...