# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315089 | daniel920712 | Mouse (info1cup19_mouse) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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)
{
for(i=0;i<N;i++) how[i]=i;
do
{
if(query(how)==n) return;
}while(next_permutation(how.begin(),how.begin()));
}