dfs会超吧
by linmoxi @ 2024-03-31 10:35:00
```cpp
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
const int N=1e5+5;
int s[N];
int head,tail;
int main() {
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
s[tail++]=i;
}
while(tail-head>0){
for(int j=1;j<m;j++){
s[tail++]=s[head];
head++;
}
cout<<s[head]<<" ";
head++;
}
return 0;
}
```
by linmoxi @ 2024-03-31 10:35:29
试试模拟队列
by linmoxi @ 2024-03-31 10:35:52
@[linmoxi](/user/746240) 谢谢
by Ghy_boy @ 2024-04-09 19:12:21