复试第十四天

C笔试

1.输出小于500的所有的“水仙花数”，所谓“水仙花数”是指一个3位数，其各位数字立方和等于该数本身。

例如，153是一个水仙花数，因为153=1**3+5**3+3**3。

int main() { int a = 0, b = 0, c = 0; for (int i = 100; i < 500; i++) { c = i % 10; b = (i / 10) % 10; a = i / 100; if (i == (c * c * c + b * b * b + a * a * a)) { printf("%d是水仙花数\n", i); } } return 0; }

2.在一个3*4的二维数组a中，要求编程求出其中值最大的那个元素的值，并输出其所在的行号和列号。

int main() { int num[3][4] = { 0 }; printf("请输入若干整数：\n"); for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { scanf("%d", &num[i][j]); } } int max = -9999; int i_max = 0, j_max = 0; for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { if (num[i][j] > max){ max = num[i][j]; i_max = i; j_max = j; } } } printf("对应的行号是%d,列号是%d", i_max, j_max); return 0; }

3。选择法实现对10个整数按从大到小的顺序排序输出

int swap(int*p, int*q) { int tempt; tempt = *p; *p = *q; *q = tempt; } int* Sort(int* num) { for (int i = 0; i < 10; i++) { int max = -999, j_num = i; for (int j = i; j < 10; j++) { if (num[j] > max) { max = num[j]; j_num = j; } } swap(&num[i], &num[j_num]); } return num; } int main() { int b[10] = { 0 }; printf("请输入十个数："); for (int i = 0; i < 10; i++){ scanf("%d", &b[i]); } int* m = b; Sort(m); printf("排序后结果是："); for (int i = 0; i < 10; i++) { printf("%d ", m[i]); } return 0; }

2023年笔试题目

编程题目（一题40分）

1。给定一个字符串str，和一个长度为2的字符串substr，统计substr在str中出现的次数。

例如，字符串as asd asdf abas dadas adas中as出现的次数为6。写出函数：int sub( char *str, char *substr )

int sub(char* str, char* substr) { int init = 0, count = 0, i = 0, j = 0, time = 0; while (str[i] != '\0' && substr[j] != '\0') { if (str[i] != substr[j]) { init++; j = 0; i = init; count = 0; } else { i++; j++; count++; } if (count == 2) { time++; j = 0; count = 0; init = i; } } return time; }

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include<stdlib.h> #include<string.h> typedef struct term { char name[10]; int time; }Term; Term * search(char str[]) { static Term term[100]; int num = 0; char* now; now = strtok(str, " "); while (now!= NULL ) { int found = 0; for(int m=0;m<num;m++){ if (strcmp(now, term[m].name) == 0) { term[m].time++; found = 1; } } if(found==0){ strcpy(term[num].name, now); term[num].time = 1; num++; } now = strtok(NULL, " "); } return term; }

3. ♥♥♥♥结构体数组，二分查找，冒泡排序，指针定义

输入 n个学生的学生信息，学生信息包括：姓名、编号、成绩总分，并依据

typedef struct{ char name[10]; char index[10]; int mark; }Term; int main() { int n; scanf("%d", &n); Term *term = (Term*)malloc(n * sizeof(Term));#动态数组，要用指针来定义，因为运行时分配位置，而用数组需要提前分配位置 char name1[10], index1[10];#最好使用数组，使用指针需要定义很麻烦，不然会变成野指针 int mark1; for (int i = 0; i < n; i++) { gets(name1); gets(index1); strcpy(term[i].name, name1); strcpy(term[i].index, index1); scanf_s("%d", &mark1); term[i].mark=mark1; } Term tempt ; for (int i = 0; i < n-1; i++) { for (int j = 0; j < n-i-1; j++) {#冒泡排序 if (term[j].mark > term[j + 1].mark) { tempt = term[j]; term[j] = term[j + 1]; term[j + 1] = tempt; } } } int x; scanf("%d", &x); int l = 0, r = n - 1,mid=0; int position; while (l <= r) { #二分查找 mid = (l+r) / 2; if (x == term[mid].mark) { position = mid; break; } if (x < term[mid].mark) { r =mid - 1; } if (x >term[mid].mark) { l= mid +1; } } printf("成绩是%d的同学信息是：\n",x); printf("姓名是：%s", term[position].name); return 0; }

4.从键盘第一行输入 m，m代表小明要玩游戏的次数，接下来的输入为骰子的点数，请输出 m次游戏的排序结果。

提示：建立单链表，游戏结果的输出用 3次函数。

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include<stdlib.h> #include<string.h> typedef struct node { int data; struct node* next; }Lnode; void witch (int x, Lnode*list) { Lnode* p1=list->next,* front1=list; Lnode* p = list->next, * front = list; while (p1 != NULL) { if (p1->data == x) { p = p1; front = front1; break; } else { p1 = p1->next; front1 = front1->next; } } front->next = p->next; p->next = list->next; list->next = p; } int main() { int time; scanf("%d", &time); Lnode* list= (Lnode*)malloc(sizeof(Lnode)); Lnode* rear = list; for (int i = 1; i < 11; i++) { Lnode* p = (Lnode*)malloc(sizeof(Lnode)); p->data = i; rear->next = p; rear = p; } int num=0; for (int i = 0; i < time; i++) { scanf("%d", &num); witch(num, list); printf("本次序列是："); Lnode* p = list->next; for (int i = 0; i < 10; i++) { printf("%d ",p->data ); p = p->next; } printf("\n"); } return 0; }

简答题：

i=1; Loop: if(i>n) goto END; #循环体.... i++; goto Loop; END:

do { 语句; } while(i<=n); #等价于 Loop: #循环体 if（i<=n) goto Loop; END;

if(a>b) 语句1; else 语句2; #等价于 if(a<b) goto ELSE; #语句1 goto END; ELSE: #语句2 END：

4.

int num = 10; void main() { char* p = "CEHNGDU", q; static int snunm ; int arr[100]; char ch2; func(snunm); } void func(int m) { int n = 10; }