/*輸入學生的學號、姓名、性別、年齡、成績、家庭住址，輸出成績較高的學生資訊*/
#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;