#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a;
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
a.push_back(i);
int t = 1;
while(a.size() != 1){
t += m-1;
t = (t%n) ? (t%n) : n;
a.erase(a.begin()+t-1);
n--;
}
cout<<*(a.begin())<<endl;
return 0;
}
zzuli oj 1195: 猴子选大王(结构体专题)
最新推荐文章于 2024-08-15 08:54:14 发布