刚看了链表，贴一个约瑟夫问题的代码

#include <stdlib.h>
#include <stdio.h>
typedef struct node* link;
struct node {int item;link next;};
int main (int argc, char *argv[]){

int i, N=atoi(argv[1]), M=atoi(argv[2]);
link t=malloc(sizeof *t), x=t;
t->item =1; t->next=t;

for(i=2;i<=N;i++){
    x=(x->next=malloc(sizeof *x));
    x->item=i;x->next=t;

}
x=t;
printf("%d,%d\n",x->item,x->next->item);
while(x!=x->next){
for(i=1;i<M-1;i++) x=x->next;
printf("NO:%d is out,%d left\n",x->next->item,--N);
x->next=x->next->next; x=x->next;


}
printf("%d is winner\n",x->item);
return 0;

}