约瑟夫环的变形

sdut   2056

#include<stdio.h>
#include<stdlib.h>
struct node
{
    int data;
    struct node *next;
};
struct node *creat(int n)
{
    struct node *head,*tail,*p;
    int i;
    p = (struct node *)malloc(sizeof(struct node));
    p->data = 1;
    p->next = NULL;
    head = p;
    tail = p;
    for(i = 2;i <= n;i++)
    {
        p = (struct node *)malloc(sizeof(struct node));
        p->data = i;
        tail->next = p;
        tail = p;
        p->next = NULL;
    }
    tail->next = head;
    return head;
}
int main ()
{
    int n,i,a[10010];
    struct node *head;
    while(scanf("%d",&n) != EOF)
    {
        if(n == 0) break;
        head = creat(n);
        int num = 1;
        int count = 0;
        struct node *p,*q;
        q = head;
        int m = 1;
        while(count <= n-1)
        {
            p = q->next;
            num++;
            if(num%5 == 0)
            {
                q->next = p->next;
                a[m] = p->data;
                m++;
                free(p);
                count++;
            }
            else q = p;
        }
        for(i = 1;i < m;i++)
            if(a[i] == 1)
                printf("%d\n",i);
    }
    return 0;
}