3.21

61.将链表中的结点依次输出：

#include<stdio.h>

#include<malloc.h>

#define LEN sizeof(struct student)

struct student

{long num;

float 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,%f",&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,%f",&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)

while(p!=NULL)

{printf("%ld %5.1f\n",p->num,p->score);

p=p->next;

}

}

void main()

{struct student *head;

head=creat();

printf(head);

}