#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;
how.push_back(0);
for(i=0;i<N;i++) how.push_back(i+1);
do
{
if(query(how)==N) return;
}while(next_permutation(how.begin(),how.begin()));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Integer 0 violates the range [1, 7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Integer 0 violates the range [1, 7] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Integer 0 violates the range [1, 7] |
2 |
Halted |
0 ms |
0 KB |
- |