约瑟夫问题，丢手绢问题

#include <stdio.h>

#include <stdlib.h>

typedef struct node

{

int data;

struct node* next;

}cLinkList;

int main()

{

cLinkList *head, *p, *s, *temp;

int n, k;

int i = 1;

printf("Please enter the total number n:\n");

scanf("%d", &n);

printf("Please enter the key value:\n");

scanf("%d", &k);

head = (cLinkList *)malloc(sizeof(cLinkList));

p = head;

p->next = p;

p->data = i;

for (i = 2; i <= n; i++)

{

s = (cLinkList *)malloc(sizeof(cLinkList));

s->data = i;

s->next = p->next;

p->next = s;

p = s;

}

p = head;

while (n--)

{

for (i = 1; i < k - 1; i++)

{

p = p->next;//p指向了k-1项

}

printf("%d->", p->next->data);

temp = p->next;

p->next = temp->next;

free(temp);

p = p->next;

}

printf("Done！\n");

return 0;

}