#include <stdio.h>

#define NULL 0

typedef int Elemtype;

typedef struct slnode

}L,slnodetype;

slnodetype *inti(slnodetype *head)

{

head=(slnodetype *)malloc(sizeof(slnodetype));

head->next=NULL;

return head;

}

slnodetype *create(slnodetype *head)

{

slnodetype *p,*q;

Elemtype x;

head=(slnodetype *)malloc(sizeof(slnodetype));

head->next=NULL;

q=head;

scanf("%d",&x);

while (x!=-1)

{

p=(slnodetype *)malloc(sizeof(slnodetype));

p->data=x;

q->next=p;

q=p;

scanf("%d",&x);

}

p->next=NULL;

return head;

}

slnodetype *find(slnodetype *head,Elemtype x)

{

slnodetype *p;

p=head->next;

while ((p!=NULL)&&(p->data!=x))

p=p->next;

return p;

}

slnodetype *get(slnodetype *head,int i)

{

slnodetype *p;

int j;

j=0;

p=head;

while ((p!=NULL)&&(j<i))

{

p=p->next;

j++;

}

return p;

}

slnodetype *insert(slnodetype *head,int i,Elemtype x)

{

slnodetype *p,*q;

int j;

j=1;

p=head;

while ((p!=NULL)&&(j<i))

{

p=p->next;

j++;

}

if (j!=i||p==NULL) return head;

else {

q=(slnodetype *)malloc(sizeof(slnodetype));

q->data=x;

q->next=p->next;

p->next=q;

return head;

}

}

slnodetype *delete(slnodetype *head,int i)

{

slnodetype *p,*q;

int j;

j=0;

p=head;

while ((p->next!=NULL)&&(j<i-1))

{

p=p->next;

j++;

}

if (j==i-1&&p->next!=NULL)

{

q=p->next;

p->next=p->next->next;

free(q);

}

return head;

}

void print(slnodetype *head)

}

main()

}