摘要： #include<iostream>using namespace std;typedef struct student{ int data; struct student *next;}node;void JOSEPHUS(int k,int m) //创建单链表{ node *head,*p,*s; int x,cycle=1; head=(node *)malloc(sizeof(node)); p=head; int n=0; while(cycle) { cout<<"请输入一直不为0的数，输入0则结束"<<endl; cin& 阅读全文