03-12 15:17 算法工程师
关注
#约瑟夫环NO.2#
#define _CRT_SECURE_NO_WARNINGS
#include
#include
#include
using namespace std;
int main()
{
queue queue1;
int n, p, m;
scanf("%d%d%d", &n, &p, &m);
for (int i = 1;i <= n;i++){
queue1.push(i);
}
for (int i = 1;i < p;i++) {
queue1.push(queue1.front());
queue1.pop();
}
while (!queue1.empty()) {
for (int i = 1;i < m;i++) {
queue1.push(queue1.front());
queue1.pop();
}
if (queue1.size() == 1) {
printf("%d\n", queue1.front());
}
else {
printf("%d,", queue1.front());
}
queue1.pop();
}
return 0;
}
#define _CRT_SECURE_NO_WARNINGS
#include
#include
#include
using namespace std;
int main()
{
queue
int n, p, m;
scanf("%d%d%d", &n, &p, &m);
for (int i = 1;i <= n;i++){
queue1.push(i);
}
for (int i = 1;i < p;i++) {
queue1.push(queue1.front());
queue1.pop();
}
while (!queue1.empty()) {
for (int i = 1;i < m;i++) {
queue1.push(queue1.front());
queue1.pop();
}
if (queue1.size() == 1) {
printf("%d\n", queue1.front());
}
else {
printf("%d,", queue1.front());
}
queue1.pop();
}
return 0;
}
全部评论
相关推荐
点赞 评论 收藏
转发
投递莉莉丝游戏等公司7个岗位 > 点赞 评论 收藏
转发
点赞 评论 收藏
转发