一道C语言编程题（基于TC2.0，不要出现中文）

#include
#include
#define NULL 0
#define LEN sizeof(struct student)
struct student
{long num;
int score; struct student *next;
};
int n;
struct student *creat()
{ struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=( struct student*) malloc(LEN);
scanf("%ld,%d",&p1->num,&p1->score);
head=NULL;
while(p1->num!=0)
{n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct student*)malloc(LEN);
scanf("%ld,%d",&p1->num,&p1->score);
}
p2->next=NULL;
return(head);
}

void print(struct student *head)
{ struct student *p;
printf("\nNow,These %d records are:\n",n);
p=head;
if(head!=NULL)
do
{ printf("%ld %d\n",p->num,p->score);
p=p->next;
}while(p!=NULL);
}

struct student *del(struct student *head,long num)
{ struct student *p1,*p2;
if (head==NULL){printf("\nlist null!\n");goto end;}
p1=head;
while(num!=p1->num && p1->next!=NULL)
{p2=p1;p1=p1->next;}
if(num==p1->num)
{if(p1==head)head=p1->next;
else p2->next=p1->next;
printf("delete:%ld\n",num);
n=n-1;
}
else printf("%ld not been found!\n",num);
end:
return(head);
}

struct student *insert(struct student *head, struct student *stud)
{ struct student *p0,*p1,*p2;
p1=head;
p0=stud;
if(head==NULL)
{head=p0; p0->next=NULL;}
else
{

给你这个差不多的,这是我以前做的,也是老师布置的作业~!

也用了很长的时间,关键是,你写的一定要调试才能完成正确~

所以你自己慢慢写喽~!

想要别人给你完整的答案,应该是不可能的~除非他和你做的一样的题~!

给多少啊 晕