#include
#include
#include
#include
#include
#include
struct cause{
char subject[20];
int term;
int grade;
};
typedef struct node{
char name[10];
int num;
int clas;
struct cause data;
struct node*next;
}stu;
void main()
{
node *head, *end, *p;
FILE *fp;
int i = 0;
head = (node *)malloc(sizeof(node));
p = head;
p->next = NULL;
errno_t err;
if ((err = fopen_s(&fp, "class.txt", "r")) == NULL)
//判断文件是否结束
while (!feof(fp))
{ //尾插法建立单链表
end = (node *)malloc(sizeof(node));
p->next = end;
p = end;
p->next = NULL;
//读取数据
fscanf_s(fp, "%d %d %s %d %s %d", &p->num, &p->clas, &p->name, &p->data.term, &p->data.subject, &p->data.grade);
}
fclose(fp);
printf("Data import successfully\n");
p = head->next;
printf("\nnode name \t \tnum\tage\tsex\t score\n");
while (NULL != p->next)
{
i++;
printf("%d %d %s %d %s %d", i, p->num, p->clas, p->name, p->data.term, p->data.subject, p->data.grade);
p = p->next;
}