1 solutions
-
1
#include<bits/stdc++.h> using namespace std; queue<int> q; int main() { int n,m; cin>>n>>m; for(int i=1;i<=n;i++) //先拍好队 { q.push(i); } for(int i=1;i<=n;i++) //依次出队n个人 { for(int j=1;j<m;j++) //数m-1个人到后面取 { q.push(q.front()); // q.pop(); } cout<<q.front()<<" "; //输出第m个人编号 q.pop(); //删除 } return 0; }
- 1
Information
- ID
- 163
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 22
- Accepted
- 10
- Uploaded By