用C语言实现约瑟夫环问题
时间: 2024-01-21 08:13:58 浏览: 42
以下是用C语言实现约瑟夫环问题的代码示例:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
int data;
struct Node* next;
}Node;
Node* Create(int n){
Node* head = (Node*)malloc(sizeof(Node));
if (head == NULL) {
exit(1);
}
head->data = 1;
head->next = NULL;
Node* current = head;
for (int i = 2; i <= n; i++) {
Node* newNode = (Node*)malloc(sizeof(Node));
if (newNode == NULL) {
exit(1);
}
newNode->data = i;
newNode->next = NULL;
current->next = newNode;
current = newNode;
}
current->next = head; // 构建循环链表
return head;
}
void Josephus(int n, int m){
Node* head = Create(n);
Node* current = head;
while (current->next != current) {
for (int i = 1; i < m - 1; i++) {
current = current->next;
}
Node* temp = current->next;
current->next = temp->next;
printf("%d ", temp->data);
free(temp);
current = current->next;
}
printf("%d\n", current->data);
free(current);
}
int main(){
int n, m;
printf("请输入总人数n:");
scanf("%d", &n);
printf("请输入报数m:");
scanf("%d", &m);
printf("出列顺序为:");
Josephus(n, m);
return 0;
}
```