/* 讀入問題條件 */printf("input total num:");scanf("%d", &n);printf("from which num begin:");scanf("%d", &k);if(k>n||k==0){printf("please input the right begin num");return 1; }printf("input the out num:");scanf("%d", &m);if(m>n||m==0){ printf("please input the right del num");return 2; }

typedef struct node{int data;struct node *next;}linklist;構(gòu)建循環(huán)鏈表進(jìn)行“猴子”的圓圈建設(shè)。/* 創(chuàng)建循環(huán)鏈表，頭節(jié)點也存信息 */head = (linklist*) malloc(sizeof(linklist));p = head;p->data = 1;p->next = p;/* 初始化循環(huán)鏈表 */for (i = 2; i <= n; i++){s = (linklist*) malloc(sizeof(linklist));s->data = i;s->next = p->next;p->next = s;p = p->next;}

p = head;for (i = 1; i <= k; i++){p = p->next;}

/* 保存節(jié)點總數(shù) */
total = n;printf("\nthe out num:");q = head;

/* 只剩一個節(jié)點時停止循環(huán) */while (total != 1){/* 報數(shù)過程，p指向要刪除的節(jié)點 */for (i = 1; i < m; i++){p = p->next;}/* 打印要刪除的節(jié)點序號 */printf("[%d] ", p->data);/* q 指向 p 節(jié)點的前驅(qū) */while (q->next != p){q = q->next;}/* 刪除 p 節(jié)點 */q->next = p->next;/* 保存被刪除節(jié)點指針 */s = p;/* p 指向被刪除節(jié)點的后繼 */p = p->next;/* 釋放被刪除的節(jié)點 */free(s);/* 節(jié)點個數(shù)減一 */total--;}/* 打印最后剩下的節(jié)點序號 */printf("\n\nthe last num:[%d] \n\n", p->data);free(p);}

linklist *head, *p, *s, *q;