题解 100% AC

#include<bits/stdc++.h>
using namespace std;
int n,m,cnt=0;
queue<int>q;
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)q.push(i);
    while(q.size()){
        cnt++;
        if(cnt==m){
            cout<<q.front()<<" ";
            q.pop();
            cnt=0;
        }else{
            q.push(q.front());
            q.pop();
        }
    }
    return 0;
}