约瑟夫问题c语言代码
时间: 2023-11-08 17:05:23 浏览: 49
以下是一个使用循环单链表解决约瑟夫问题的C语言代码:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int data;
struct node *next;
} Node;
Node *createList(int n) {
Node *head = NULL, *tail = NULL;
for (int i = 1; i <= n; i++) {
Node *newNode = (Node *)malloc(sizeof(Node));
newNode->data = i;
newNode->next = NULL;
if (head == NULL) {
head = tail = newNode;
} else {
tail->next = newNode;
tail = newNode;
}
}
tail->next = head;
return head;
}
void josephus(int n, int m, int k) {
Node *head = createList(n);
Node *p = head, *prev = NULL;
while (n > 0) {
for (int i = 1; i < m; i++) {
prev = p;
p = p->next;
}
for (int i = 1; i <= k; i++) {
prev = p;
p = p->next;
if (i == k) {
printf("%d ", p->data);
prev->next = p->next;
free(p);
p = prev->next;
n--;
}
}
}
}
int main() {
int n, m, k;
printf("请输入总人数n、开始报数的位置m和出圈的数字k:");
scanf("%d%d%d", &n, &m, &k);
josephus(n, m, k);
return 0;
}
```