金字招牌

1
#include<stdio.h>
2
#define N 8
3

4
typedef struct stu
5
{
6
    char num[10];
7
    double s[N];
8
    double ave;
9
} STREC;
10

11
void fun(STREC *a)
12
{
13
    int i = 0;
14
    a->ave = 0.0;
15
    for(i = 0; i < N; i++)
16
    {
17
        a->ave += a->s[i];
18
    }
19
    a->ave /= N;
20
}
21

22
int main()
23
{
24
    STREC s = {"GA005", 85.5, 76, 69.5, 85, 91, 72, 64.5, 87.5};
25
    int i;
26
    fun(&s);
27
    printf("%s \n", s.num);
28
    for(i = 0; i < N; i++)
29
    {
30
        printf("%4.1f ", s.s[i]);
31
    }
32
    printf("%7.3f ", s.ave);
33
    return 0;
34
}

1
#include <stdio.h>
2
#include <string.h>
3
#define N 12
4

5
typedef struct
6
{
7
    char num[10];
8
    int s;
9
} STREC;
10

11
double fun(STREC *a, STREC *b, int *n)
12
{
13
    float avg = 0.0;
14
    for(int i = 0; i < N; i++)
15
    {
16
        avg += a[i].s;
17
    }
18
    avg /= N;
19

20
    for(int i = 0, j = 0; i < N; i++)
21
    {
22
        if(a[i].s > avg)
23
        {
24
            b[j++] = a[i];
25
            (*n)++;
26
        }
27
    }
28

29
    return avg;
30
}
31

32
void main()
33
{
34
    STREC s[N] = {{"GA05", 85}, {"GA03", 76}, {"GA02", 69}, {"GA04", 85}, {"GA01", 91}, {"GA07", 72}, {"GA08", 64}, {"GA06", 87}, {"GA09", 60}, {"GA11", 79}, {"GA12", 73}, {"GA10", 90}};
35
    STREC h[N];
36
    int i, n;
37
    double ave;
38
    ave = fun(s, h, &n);
39
    printf("The %d student data which is higher than %7.3f:\n", n, ave);
40
    for (i = 0; i < n; i++)
41
        printf("%s  %d\n", h[i].num, h[i].s);
42
    printf("\n");
43
}

1
#include <stdio.h>
2
#include <stdlib.h>
3
#define N 8
4

5
typedef struct list
6
{
7
    int data;
8
    struct list* next;
9
} SLIST;
10

11
void fun(SLIST* h, int x)
12
{
13
    SLIST* p, * q, * s;
14
    s = (SLIST*)malloc(sizeof(SLIST));
15
    s->data = x;
16
    q = h;
17
    p = h->next;
18
    while (p != NULL && x > p->data)
19
    {
20
        q = p;
21
        p = p->next;
22
    }
23
    s->next = p;
24
    q->next = s;
25
}
26

27
SLIST* creatlist(int* a)
28
{
29
    SLIST* h, * p, * q;
30
    int i;
31
    h = p = (SLIST*)malloc(sizeof(SLIST));
32
    for (i = 0; i < N; i++)
33
    {
34
        q = (SLIST*)malloc(sizeof(SLIST));
35
        q->data = a[i];
36
        p->next = q;
37
        p = q;
38
    }
39
    p->next = 0;
40
    return h;
41
}
42

43
void outlist(SLIST* h)
44
{
45
    SLIST* p;
46
    p = h->next;
47
    if (p == NULL)
48
        printf("\nThe list is NULL!\n");
49
    else
50
    {
51
        printf("\nHead");
52
        do
53
        {
54
            printf("->%d", p->data);
55
            p = p->next;
56
        } while (p != NULL);
57
        printf("->End\n");
58
    }
59
}
60

61
void main()
62
{
63
    SLIST* head;
64
    int x;
65
    int a[N] = { 11, 12, 15, 18, 19, 22, 25, 29 };
66
    head = creatlist(a);
67
    printf("\nThe list before inserting:\n");
68
    outlist(head);
69
    printf("\nEnter a number: ");
70
    scanf("%d", &x);
71
    fun(head, x);
72
    printf("\nThe list after inserting:\n");
73
    outlist(head);
74
}

1
#include <stdio.h>
2
#include <stdlib.h>
3
#define N 5
4

5
typedef struct node
6
{
7
    int data;
8
    struct node* next;
9
} NODE;
10

11
void fun(NODE* h)
12
{
13
    NODE* p, * q, * r;
14
    p = h->next;
15
    if (p == NULL)
16
        return;
17
    q = p->next;
18
    p->next = NULL;
19
    while (q)
20
    {
21
        r = q->next;
22
        q->next = p;
23
        p = q;
24
        q = r;
25
    }
26
    h->next = p;
27
}
28

29
NODE* creatlist(int a[])
30
{
31
    NODE* h, * p, * q;
32
    int i;
33
    h = (NODE*)malloc(sizeof(NODE));
34
    h->next = NULL;
35
    for (i = 0; i < N; i++)
36
    {
37
        q = (NODE*)malloc(sizeof(NODE));
38
        q->data = a[i];
39
        q->next = NULL;
40
        if (h->next == NULL)
41
            h->next = p = q;
42
        else
43
        {
44
            p->next = q;
45
            p = q;
46
        }
47
    }
48
    return h;
49
}
50

51
void outlist(NODE* h)
52
{
53
    NODE* p;
54
    p = h->next;
55
    if (p == NULL)
56
        printf("The list is NULL!\n");
57
    else
58
    {
59
        printf("\nHead  ");
60
        do
61
        {
62
            printf("->%d", p->data);
63
            p = p->next;
64
        } while (p != NULL);
65
        printf("->End\n");
66
    }
67
}
68

69
void main()
70
{
71
    NODE* head;
72
    int a[N] = { 2, 4, 6, 8, 10 };
73
    head = creatlist(a);
74
    printf("\nThe original list:\n");
75
    outlist(head);
76
    fun(head);
77
    printf("\nThe list after inverting:\n");
78
    outlist(head);
79
}

1
#include <stdio.h>
2
#include <stdlib.h>
3
#define N 8
4

5
typedef struct list
6
{
7
    int data;
8
    struct list* next;
9
} SLIST;
10

11
SLIST* creatlist(char*);
12
void outlist(SLIST*);
13

14
int fun(SLIST* h, char ch)
15
{
16
    SLIST* p;
17
    int n = 0;
18
    p = h->next;
19
    while (p != NULL)
20
    {
21
        n++;
22
        if (p->data == ch)
23
            return n;
24
        else
25
            p = p->next;
26
    }
27
    return 0;
28
}
29

30
void main()
31
{
32
    SLIST* head;
33
    int k;
34
    char ch;
35
    char a[N] = { 'm', 'p', 'g', 'a', 'w', 'x', 'r', 'd' };
36
    head = creatlist(a);
37
    outlist(head);
38
    printf("Enter a letter:");
39
    scanf("%c", &ch);
40
    k = fun(head, ch);
41
    if (k == 0)
42
        printf("\nNot found!\n");
43
    else
44
        printf("The sequence number is: %d\n", k);
45
}
46

47
SLIST* creatlist(char* a)
48
{
49
    SLIST* h, * p, * q;
50
    int i;
51
    h = p = (SLIST*)malloc(sizeof(SLIST));
52
    for (i = 0; i < N; i++)
53
    {
54
        q = (SLIST*)malloc(sizeof(SLIST));
55
        q->data = a[i];
56
        p->next = q;
57
        p = q;
58
    }
59
    p->next = 0;
60
    return h;
61
}
62

63
void outlist(SLIST* h)
64
{
65
    SLIST* p;
66
    p = h->next;
67
    if (p == NULL)
68
        printf("\nThe list is NULL!\n");
69
    else
70
    {
71
        printf("\nHead");
72
        do
73
        {
74
            printf("->%c", p->data);
75
            p = p->next;
76
        } while (p != NULL);
77
        printf("->End\n");
78
    }
79
}

1
#include <stdio.h>
2
#include <stdlib.h>
3
#define N 8
4

5
typedef struct list
6
{
7
    int data;
8
    struct list* next;
9
} SLIST;
10

11
void fun(SLIST* h)
12
{
13
    SLIST* p, * q;
14
    p = h->next;
15
    if (p != NULL)
16
    {
17
        q = p->next;
18
        while (q != NULL)
19
        {
20
            if (p->data == q->data)
21
            {
22
                p->next = q->next;
23
                free(q);
24
                q = p->next;
25
            }
26
            else
27
            {
28
                p = q;
29
                q = q->next;
30
            }
31
        }
32
    }
33
}
34

35
SLIST* creatlist(int* a)
36
{
37
    SLIST* h, * p, * q;
38
    int i;
39
    h = p = (SLIST*)malloc(sizeof(SLIST));
40
    for (i = 0; i < N; i++)
41
    {
42
        q = (SLIST*)malloc(sizeof(SLIST));
43
        q->data = a[i];
44
        p->next = q;
45
        p = q;
46
    }
47
    p->next = 0;
48
    return h;
49
}
50

51
void outlist(SLIST* h)
52
{
53
    SLIST* p;
54
    p = h->next;
55
    if (p == NULL)
56
        printf("\nThe list is NULL!\n");
57
    else
58
    {
59
        printf("\nHead");
60
        do
61
        {
62
            printf("->%d", p->data);
63
            p = p->next;
64
        } while (p != NULL);
65
        printf("->End\n");
66
    }
67
}
68

69
void main()
70
{
71
    SLIST* head;
72
    int a[N] = { 1, 2, 2, 3, 4, 4, 4, 5 };
73
    head = creatlist(a);
74
    printf("\nThe list before deleting:\n");
75
    outlist(head);
76
    fun(head);
77
    printf("\nThe list after deleting:\n");
78
    outlist(head);
79
}