Good Bye 2019 D
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int n, k;
map<int,int> mp;
int main()
{
scanf("%d%d", &n, &k);
int mx = 0;
for (int i=1; i<=k+1; i++)
{
printf("?");
for (int j=1; j<=k+1; j++)
{
if (i==j) continue;
printf(" %d", j);
}
puts("");
fflush(stdout);
int p, v;
scanf("%d%d", &p, &v);
mp[v]++;
mx = max(mx, v);
}
printf("! %d\n", mp[mx]);
fflush(stdout);
return 0;
}
codeforces Good Bye 2019 D
猜你喜欢
转载自blog.csdn.net/king9666/article/details/103812927
今日推荐
周排行