제출 #315092

#제출 시각아이디문제언어결과실행 시간메모리
315092daniel920712Mouse (info1cup19_mouse)C++14
0 / 100
1 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)
{
    int i;
    for(i=0;i<N;i++) how[i]=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...