代码.txt

#include<stdio.h>
#include<stdlib.h>
#include <iostream>
using namespace std;
typedef  struct
{
	int num;
	int key;

}ElemType;

typedef  struct  LNode
{
ElemType data;
struct  LNode *next;
}LNode, *LinkList;

LinkList CreateListFromTail (int n)
{
    LinkList  h,s,p;
    int i;
    h=(LNode*)malloc(sizeof(LNode));
    h->next=NULL;
	h->data.num=1;
	cin>>h->data.key;
    p=h;
    for(i=2;i<=n;i++)
    {
        s=(LNode*)malloc(sizeof(LNode));
		cin>>s->data.key;
		s->data.num=i;
        p->next=s;
        p=s;
    }
    p->next=h;
    return h;
}

void del(LinkList h,int n,int m)
{
	int i,j; LinkList p,q;
	p=h;
	for(i=1;i<=n;i++)
	{
	for(j=1;j<=m-1;j++)
	{q=p;
	p=p->next;}

	q->next=p->next;
	cout<<p->data.num<<endl;
	m=p->data.key;
	free(p);
	p=q->next;
	}



}


int main( )
{	LinkList h;int n,m;
	cout<<"ÊäÈë³õʼÈËÊýºÍM"<<endl;
	cin>>n>>m;
	h=CreateListFromTail(n);
	del(h,n,m);
	system("PAUSE");
	return 0;
}