-
Notifications
You must be signed in to change notification settings - Fork 105
Expand file tree
/
Copy path5.2.cpp
More file actions
42 lines (39 loc) · 1.18 KB
/
5.2.cpp
File metadata and controls
42 lines (39 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/*
* 题目名称：约瑟夫问题No.2
* 题目来源：bailian 3254
* 题目链接：http://bailian.openjudge.cn/practice/3254
* 代码作者：杨泽邦(炉灰)
*/
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int main() {
int n, p, m;
while (scanf("%d%d%d", &n, &p, &m)) {
if (n == 0 && p == 0 && m == 0) {
break;
}
queue<int> children;
for (int i = 1; i <= n; ++i) { //依此加入队列
children.push(i);
}
for (int i = 1; i < p; ++i) { //使编号p的小孩在队首
children.push(children.front());
children.pop();
}
while (!children.empty()) {
for (int i = 1; i < m; ++i) { //m - 1小孩依此重新入队
children.push(children.front());
children.pop();
}
if (children.size() == 1) { //最后一个小孩的输出不同
printf("%d\n", children.front());
} else {
printf("%d,", children.front());
}
children.pop();
}
}
return 0;
}