ACM-josephus问题

#include<stdio.h>
#include<malloc.h>
typedef struct people 
{   
    int num;
    struct people *next;
}node;
 void main()
{
    node *head,*p1,*p2;
    int n,m,i;
    while(scanf( "%d", &n )==1)
    { 
        head = p1 = (node *)malloc(sizeof(node)); 
        head->num = 1;          
        for( i=2;i<=n;i++ )     
        {  
          p1->next = (node *)malloc(sizeof(node));
          p1 = p1->next;
          p1->num=i;
        }
        p1->next=head;
        scanf("%d",&m);
        while(n!=1)     
        { 
            for(i=1; i<m;i++ )
            {
                p1=p1->next;  
            }
            p2=p1->next;
            printf("%d ",p2->num );         
            p1->next=p2->next;
            free(p2);   
            n--;             
        }
        printf("%dn",p1->num);
    }
}