joseph.txt

来自「约瑟夫环 1. 本演示程序利用一循环链表,每个结点为一人,类似将人按顺时针方向」· 文本 代码 · 共 47 行

#include<stdio.h>
#include<malloc.h>
typedef struct LNode
{
	int number;
	int code;
	struct LNode *next;
}
LNode,*LinkList;

void main()
{
	int i,j,m,n;
	LinkList p1,p2,head,p,q;

	printf("Please input the total number of persons n=");
	scanf("%d",&n);
	printf("Please input the original code m=");
	scanf("%d",&m);

	head=(LinkList) malloc (sizeof(struct LNode));
	p1=head;
	for(i=1;i<=n;i++)
	{ p2=(LinkList) malloc (sizeof(struct LNode));
	p2->number=i;
	printf("The code of %d person is:",i);
	scanf("%d",&p2->code);
	p1->next=p2;
	p1=p2;
	}
	p1->next=head->next;

    printf("The out order is:");
	p=head;
	for(i=1;i<=n;i++){
	  for(j=1;j<=m;j++)
		{q=p;p=p->next;}
	printf("%d",p->number);
	m=p->code;
	q->next=p->next;
	p=q;
	}
}