求薪资管理系统和学生成绩查询系统。

# include & ltstdio.h & gt

# include & ltmalloc.h & gt

#定义NULL 0

#define LEN sizeof(结构学生)

结构学生

{ long num

int分数;结构学生*下一个;

};

int n;

struct student *creat()

{结构学生*头;

struct student *p1,* p2

n = 0;

p1=p2=(结构学生*)malloc(LEN);

scanf("%ld,%d ",& ampp 1->;数字& ampp 1->;分数);

head = NULL

while(p 1->;num!=0)

{ n = n+1;

if(n = = 1)head = p 1;

否则p2-& gt;next = p 1;

p2 = p 1;

p1=(结构学生*)malloc(LEN);

scanf("%ld,%d ",& ampp 1->;数字& ampp 1->;分数);

}

p2->;next = NULL

返回(头);

}

作废打印(结构学生*头)

{ struct student * p;

printf(" \n现在,这%d条记录是:\ n ",n);

p =头部;

如果(头!=空)

{ printf("%ld %d\n ",p-& gt;num,p->分数);

p = p-& gt;接下来;

}while(p!= NULL);

}

结构学生*del(结构学生*head,long num)

{ struct student *p1,* p2

if(head = = NULL){ printf(" \ n list NULL!\ n ");转到结尾;}

p 1 =头;

而(num!= p 1->;数字& amp& ampp 1->;下一个!=空)

{ p2 = p 1;p 1 = p 1->;接下来;}

if(num = = p 1->;数字)

{ if(p 1 = = head)head = p 1-& gt;接下来;

否则p2-& gt;next = p 1->;接下来;

printf("delete:%ld\n ",num);

n = n-1;

}

else printf("%ld未找到!\n ",编号);

结束:

返回(头);

}

struct student * insert(struct student * head,struct student *stud)

{ struct student *p0,*p1,* p2

p 1 =头;

p0 =螺柱;

if(head==NULL)

{ head = p0P0->;next = NULL}

其他

{

给你这个类似的,这是我之前做的,也是老师布置的作业~!

也花了很长时间。重点是,你写的东西一定要调试好才能正确完成~

所以自己慢慢写吧~!

你不可能要求别人给你写一个完全符合你要求的!除非他写的论文和你一样~!哈哈~!

抱歉~ 1写不出你'!