/*输入学生的学号、姓名、性别、年龄、成绩、家庭住址,输出成绩较高的学生信息*/
#include<stdio.h>
void main()
{
struct student
{
int num;
char name[20];
int age;
char sex;
float score;
char addr[30];
}stdt1={10101,"Li Lin",'M',18,99.5,"123Beijing Road"},stdt2;
/*注意最后一个分号*/
/*如果%d和%c之间有空格,输入的时候,数字和字符之间有没有间隔都行*/
/*如果%d和%c之间没有有空格,输入的时候,数字和字符之间就不能有间隔*/
/*会把中间的空格当做字符处理*/
scanf("%d%s%d%c%f%s",&stdt2.num,stdt2.name,&stdt2.age,&stdt2.sex,&stdt2.score,stdt2.addr);
printf("%d\t%s\t%d\t%c\t%5.2f\t%s\n",stdt2.num,stdt2.name,stdt2.age,stdt2.sex,stdt2.score,stdt2.addr);
if(stdt1.score>stdt2.score)
printf("%d\t%s\t%6.2f\n",stdt1.num,stdt1.name,stdt1.score);
else
printf("%d\t%s\t%6.2f\n",stdt2.num,stdt2.name,stdt2.score);
}
结果:
10102 pepe 22w 99.8 adb
10102 pepe 22 w 99.80 adb
10102 pepe 99.80
/*有N各结构体变量,内含学生学号、姓名、3门课程成绩,输出平均成绩最高的学生的信息*/
#include<stdio.h>
#define N 3
struct student
{
int num;
char name[20];
float score[3];
float aver;
};
void main()
{
void input(struct student stu[]);
struct student max(struct student stu[]);
void print(struct student stu);
struct student stu[N],* p =stu;
input(p);
print(max(p));
}
void input(struct student stu[])
{
int i;
printf("请输入各学生的信息:学号、姓名、三门课成绩:\n");
for(i=0;i<N;i++)
{
scanf("%d%s%f%f%f",&stu[i].num,stu[i].name,&stu[i].score[0],&stu[i].score[1],&stu[i].score[2]);
stu[i].aver = (stu[i].score[0]+stu[i].score[1]+stu[i].score[2])/3.0;
}
}
struct student max(struct student stu[])
{
int m=0;
for(int i=0;i<N;i++)
if(stu[i].aver>stu[m].aver) m=i;
return stu[m];
}
void print(struct student stud)
{
printf("学号:%d\n姓名:%s\n三门课成绩:%5.1f,%5.1f,%5.1f\n平均成绩:%5.1f\n",stud.num,stud.name,stud.score[0],stud.score[1],stud.score[2],stud.aver);
}
结果:
请输入各学生的信息:学号、姓名、三门课成绩:
111 ee 88 99 77
222 rr 88 99 88
333 tt 88 77 66
学号:222
姓名:rr
三门课成绩: 88.0, 99.0, 88.0
平均成绩: 91.7
建立简单的静态链表
#include<stdio.h>
#define NULL 0
struct student
{
int num;
float score;
struct student *next;
};
void main()
{
struct student a,b,c,*head,*p;
a.num = 11;
a.score = 88;
b.num = 22;
b.score = 99;
c.num = 18;
c.score = 95;
head = &a;
a.next = &b;
b.next = &c;
c.next = NULL;
p = head;
do
{
printf("%d,%5.1f\n",(*p).num,p->score);
p = (*p).next;
}while(p != NULL);
}
结果:
11, 88.0
22, 99.0
18, 95.0
建立动态链表
#include<stdio.h>
/*在C语言中,开辟内存单元用malloc函数*/
#include<malloc.h>
#define LEN sizeof(struct student)
struct student
{
int num;
float score;
struct student *next;
};
void main()
{
struct student *head,*p;
head = p = (struct student *)malloc(LEN);
scanf("%d%f",&p->num,&p->score);
p = (struct student *)malloc(LEN);
scanf("%d%f",&p->num,&p->score);
head->next = p;
p->next = NULL;
p = head;
printf("节点1:%d%5.1f\n",head->num,head->score);
p = p->next;
printf("节点2:%d%5.1f\n",p->num,p->score);
}
结果:
101 33.6
1112 66.5
节点1:101 33.6
节点2:1112 66.5
枚举类型
enum weekday(sun,mon,tue,wed,thu,fri,sat);
enum weekday workday,week_end;
workday = mon;
week_end = sun;