Լɪ·ò

#include #include #define NULL 0 typedef struct Node { int num; int Cipher; struct Node* next; }

Node,*LinkList;

Node* creat(LinkList LA,int n){ LinkList p1,p2;

int i,k=0;

p1=p2=(LinkList)malloc(sizeof(Node)); printf(\scanf(\for(i=n;i>0;--i) {

k=k+1; if(k==1) {

p1->num=k; LA=p1; }

else p2->next=p1; p2=p1;

if(i-1==0) break;

else{

p1=(LinkList)malloc(sizeof(Node)); p1->num=k+1;

scanf(\ }

}

p2->next=LA;

return LA; }

void JosephProblem(LinkList L,int n,int m){ LinkList p1,p2; int count=0;

int countPerson=0; p1=L£» p2=L£»

while(p2->next != L){ p2=p1;

p1=p1->next;

//¹¹½¨Á´±í

}

while(countPerson

if(count==m){

printf(\´òÓ¡³öÁÐÃÜÂ몣³öÁÐÐòºÅ printf(\

m=p1->Cipher;

p2->next=p1->next; //ɾ³ý³öÁнڵã p1=p1->next;

count=0; //¼ÆÊýÆ÷¹éÁã countPerson+=1; } else

{

p2=p1; //p2ΪǰÇû p1=p1->next; //p1תÏòºó¼Ì }

} }

main()

{ //Ö÷º¯Êý LinkList LA,head;

int n,m;

printf(\

scanf(\ //ÊäÈëÓм¸¸öÈËÀ´²ÎÓë LA=(LinkList)malloc(sizeof(Node));

head=creat(LA,n); //¹¹½¨Á´±í

printf(\

scanf(\ //ÊäÈë³õʼÃÜÂë printf(\printf(\ Cipher\\n\

JosephProblem(head,n,m); //½â¾öԼɪ·ò»·µÄÎÊÌâ system(\system(\}