#include #define REP(i,n,N) for(int i=(n);i<(int) N;i++) #define p(s) cout<<(s)<>n>>k; vector ansList; int ans=n-1; while(ans>=0){ ansList.push_back(ans); ans-=(k+1); } reverse(ansList.begin(),ansList.end()); int enemy; REP(i,0,ansList.size()){ p(ansList[i]); cin>>enemy; } return 0; }