1
#include <stdio.h>
2
#include <string.h>
3
#include <ctype.h>
4
#include <stdlib.h>
5

6
// 你需要实现的函数
7
int FuzzyMatchLine(const char *filename, int i, const char *pattern);
8

9
int main()
10
{
11
    int i;
12
    char pattern[51];  // 题目说明 pattern 长度 ≤ 50
13

14
    if (scanf("%d", &i) != 1)
15
    {
16
        printf("No\n");
17
        return 0;
18
    }
19

20
    // 跳过换行符
21
    getchar();
22

23
    if (fgets(pattern, sizeof(pattern), stdin) == NULL)
24
    {
25
        printf("No\n");
26
        return 0;
27
    }
28

29
    // 去除 fgets 读入的换行符（如果存在）
30
    size_t len = strlen(pattern);
31
    if (len > 0 && pattern[len - 1] == '\n')
32
    {
33
        pattern[len - 1] = '\0';
34
    }
35

36
    int result = FuzzyMatchLine("strings.txt", i, pattern);
37

38
    if (result == 1)
39
    {
40
        printf("Yes\n");
41
    }
42
    else
43
    {
44
        printf("No\n");
45
    }
46

47
    return 0;
48
}
49

50

51
int FuzzyMatchLine(const char *filename, int i, const char *pattern)
52
{
53
    if (pattern[0] == '\0') return 1;
54
    if (i < 1) return 0;
55
    char line[100];
56
    FILE *fp;
57
    fp = fopen(filename, "r");
58
    if (fp == NULL) return 0;
59
    for (int j = 1; j <= i; j++)
60
    {
61
        if (fgets(line, sizeof(line), fp) == NULL)
62
        {
63
            fclose(fp);
64
            return 0;
65
        }
66
    }
67
    for (int k = 0; line[k] != '\0'; k++)
68
    {
69
        line[k] = tolower((unsigned char)line[k]);
70
    }
71
    char *pattern_temp;
72
    pattern_temp = NULL;
73
    pattern_temp = (char *)malloc(strlen(pattern) * sizeof(char));
74
    memcpy(pattern_temp, pattern, strlen(pattern));
75
    for(int l = 0; pattern_temp[l] != '\0'; l++)
76
    {
77
        pattern_temp[l] = tolower((unsigned char)pattern_temp[l]);
78
    }
79
    if (strstr(line, pattern_temp) != NULL)
80
    {
81
        free(pattern_temp);
82
        fclose(fp);
83
        return 1;
84
    }
85
    free(pattern_temp);
86
    fclose(fp);
87
    return 0;
88
}

1
#include <stdio.h>
2
#include <string.h>
3
#include <stdlib.h>
4

5
struct Student
6
{
7
    char name[21];  // 姓名，最多20字符 + '\0'
8
    int age;        // 年龄
9
    int id;         // 学号
10
};
11

12
// 你需要实现
13
void LoadAndSortStudents(char mode, struct Student **stus, int *n);
14

15
int main()
16
{
17
    char mode = getchar();
18
    struct Student *students;
19
    int n;
20
    LoadAndSortStudents(mode, &students, &n);
21
    for (int i = 0; i < n; i++)
22
    {
23
        printf("id: %d, name: %s, age: %d\n", students[i].id, students[i].name, students[i].age);
24
    }
25
    return 0;
26
}
27

28
int cmpByNameThenId(const void *a, const void *b)
29
{
30
    const struct Student *s1 = (const struct Student *)a;
31
    const struct Student *s2 = (const struct Student *)b;
32

33
    int nameCmp = strcmp(s1->name, s2->name);
34
    if (nameCmp != 0)
35
    {
36
        return nameCmp;
37
    }
38

39
    return s1->id - s2->id;
40
}
41

42
int cmpByAgeThenId(const void *a, const void *b)
43
{
44
    const struct Student *s1 = (const struct Student *)a;
45
    const struct Student *s2 = (const struct Student *)b;
46

47
    if (s1->age != s2->age)
48
    {
49
        return s1->age - s2->age;
50
    }
51

52
    return s1->id - s2->id;
53
}
54

55
int cmpById(const void *a, const void *b)
56
{
57
    const struct Student *s1 = (const struct Student *)a;
58
    const struct Student *s2 = (const struct Student *)b;
59

60
    return s1->id - s2->id;
61
}
62

63

64
void LoadAndSortStudents(char mode, struct Student **stus, int *n)
65
{
66
    FILE *fp;
67
    fp = fopen("stuInfo.dat", "rb");
68
    if (fp == NULL) return;
69
    fread(n, sizeof(int), 1, fp);
70
    *stus = (struct Student *)malloc(sizeof(struct Student) * (*n));
71
    if (*stus == NULL)
72
    {
73
        fclose(fp);
74
        return;
75
    }
76
    fread(*stus, sizeof(struct Student), *n, fp);
77

78
    switch(mode) {
79
        case 'n': goto n;
80
        case 'a': goto a;
81
        case 'i': goto i;
82
        default: fclose(fp); free(*stus); return;
83
    }
84
n:
85
    qsort(*stus, *n, sizeof(struct Student), cmpByNameThenId);
86
    fclose(fp);
87
    return;
88
a:
89
    qsort(*stus, *n, sizeof(struct Student), cmpByAgeThenId);
90
    fclose(fp);
91
    return;
92
i:
93
    qsort(*stus, *n, sizeof(struct Student), cmpById);
94
    fclose(fp);
95
    return;
96
}