两行正解

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