十分简单明了的约瑟夫环问题 struct Joseph { int no; int key; struct Joseph *next; }*p,*q,*head; void main() { int i,j; int n,m; //n个人，m报数上限 printf("请输入m的初值:"); scanf("%d",&m);