@[Xin_Ting](/user/1332851)
用队列更简单啊
```cpp
#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<cmath>
#include<queue>
using namespace std;
int main(){
int n,m,x;
queue<int>q;
cin>>n>>m;
for(int i=1;i<=n;i++)
q.push(i);
for(int i=1;i<=n;i++){
for(int j=1;j<=m-1;j++){
x=q.front();
q.push(x);
q.pop();
}
cout<<q.front()<<' ';
q.pop();
}
return 0;
}
```
by Patrick_Liu_Bingxian @ 2024-04-18 18:34:47
@[Patrick_Liu_Bingxian](/user/915569) thx
by Xin_Ting @ 2024-04-18 22:34:59