#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int n,k,count=0,qp=0;
cin>>n>>k;
vector<int> que;
for(int i=0;i<n;i++)
que.push_back(i+1);
while(que.size()>1)
{
count++;
if(count%k==0||count%10==k)
{
//cout<<que[qp]<<" ";
que.erase(que.begin()+qp);
if(qp>=que.size()) qp=0;
}
else
{
qp++;
if(qp>=que.size()) qp=0;
}
// cout<<"*"<<qp<<" count:"<<count<<endl;
}
cout<<que[0]<<endl;
}
csp201712-2
最新推荐文章于 2021-12-04 18:07:30 发布