Pagini recente » Cod sursa (job #3134282) | Cod sursa (job #254459) | Cod sursa (job #2559646) | Cod sursa (job #2459200) | Cod sursa (job #2486497)
#include <iostream>
#include <cstdio>
using namespace std;
int t, n;
int query(int st, int dr) {
int x;
printf("1 %d 1 ", dr - st + 1);
for(int i = st; i <= dr; i++)
printf("%d ", i);
printf("\n");
fflush(stdout);
scanf("%d", &x);
return x;
}
int main() {
int st, dr, d1, d, mij;
scanf("%d", &t);
for(int i = 1; i <= t; i++) {
scanf("%d", &n);
st = 2;
dr = n;
d1 = query(st, dr);
while(st < dr) {
mij = (st + dr) / 2;
d = query(st, mij);
if(d == d1)
dr = mij;
else
st = mij + 1;
}
printf("1 %d %d ", n - 1, st);
for(int i = 1; i <= n; i++)
if(i != st)
printf("%d ", i);
printf("\n");
fflush(stdout);
scanf("%d", &d);
printf("-1 %d\n", d);
fflush(stdout);
}
return 0;
}