#include <bits/stdc++.h>
using namespace std;
#define MAXN 151
int n,trenmaks=1,boje[MAXN];
vector<int> trenboje;
int main()
{
cin>>n;boje[1]=1;trenboje.push_back(0);trenboje.push_back(1);
for (int i=2;i<=n;i++)
{
int l=2,r=trenmaks+1,rez=1;
while (l<=r)
{
int mid=(l+r)/2;cout<<mid<<" ";
for (int j=1;j<=mid-1;j++) cout<<trenboje[j]<<" ";
cout<<i<<endl;int sol;cin>>sol;
if (sol==mid) {rez=mid;l=mid+1;}
else r=mid-1;
}
boje[i]=rez;
if (boje[i]>trenmaks) {trenmaks=boje[i];trenboje.push_back(i);}
}
cout<<0<<" ";
for (int i=1;i<=n;i++) cout<<boje[i]<<" ";
cout<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |