jose.cpp

Jose

#include"iostream"
using namespace std;

#define N  7


typedef struct Lnode{
	struct Lnode *next;
	int pastw;
	int order;
}Lnode,*link;


int pastword[]={2,3,6,3,6,33,98};

void jose(link head,int first);

int first;
void main(){
	link josehead=new Lnode;
	josehead->next=NULL;
	josehead->order=1;
	josehead->pastw=pastword[0];
	link q=josehead;
	for(int i=1;i<N;i++){
		link p=new Lnode;
		p->next=NULL;
		p->order =i+1;
		p->pastw=pastword[i];
		q->next=p;
		q=p;

	
	}
	q->next=josehead;
	cout<<"please input the num of first:";
		cin>>first;
	cout<<endl;
	jose(josehead,first);
}

void jose(link p,int pastw){
	int ps;
	link pre;
	if(p!=NULL) {
	
	   if(p->next==p) {
	    	cout<<p->order<<"  ";
	        delete p;
	   }
	   else {
		   
		   for(int i=1;i<pastw;i++){
			   pre=p;
		       p=p->next;
		   }
		   cout<<p->order<<"  " ;
		   ps=p->pastw;
           pre->next =p->next ;
		   delete p;


	   }//else
	   	jose(pre->next,ps);
	
	}//if
 // return 0;
}//jose