Submission #315108

#TimeUsernameProblemLanguageResultExecution timeMemory
315108daniel920712Mouse (info1cup19_mouse)C++14
6.00 / 100
3047 ms384 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) { how.clear(); int i; for(i=0;i<N;i++) how.push_back(i+1); do { //printf("aa\n"); if(query(how)==N) return; }while(next_permutation(how.begin(),how.end())!=0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...