实验4C语言数组应用编程
task1
源代码
#include<stdio.h> #define N 4 #define M 2 void test1() { int x[N] = { 1,9,8,4 }; int i; printf("sizeof(x)=%d\n", sizeof(x)); for (i = 0; i < N; ++i) printf("%p:%d\n", &x[i], x[i]); printf("x=%p\n", x); } void test2() { int x[M][N] = { {1,9,8,4},{2,0,4,9} }; int i, j; printf("sizeof(x)=%d\n", sizeof(x)); for (i = 0; i < M; ++i) for (j = 0; j < N; ++j) printf("%p:%d\n", &x[i][j], x[i][j]); printf("\n"); printf("x=%p\n", x); printf("x[0]=%p\n", x[0]); printf("x[1]=%p\n", x[1]); printf("\n"); } int main() { printf("测试1:int型一维数组\n"); test1(); printf("\n测试2:int型二维数组\n"); test2(); return 0; }
问题1:是连续存放的,数组名x和&x[0]对应的值一样
问题2:是按行连续存放的,其值在字面上一样,相差16
task2
源代码
#define N 100 void input(int x[], int n); double compute(int x[], int n); int main() { int x[N]; int n, i; double ans; while (printf("Enter n:"), scanf_s("%d", &n) != EOF) { input(x, n); ans = compute(x, n); printf("ans=%.2f\n\n", ans); } return 0; } void input(int x[], int n) { int i; for (i = 0; i < n; ++i) scanf_s("%d", &x[i]); } double compute(int x[], int n) { int i, high, low; double ans; high = low = x[0]; ans = 0; for(i=0;i<n;++i){ ans += x[i]; if (x[i] > high) high = x[i]; else if (x[i] < low) low = x[i]; } ans = (ans - high - low) / (n - 2); return ans; }
程序运行截图
问题:input函数的功能是输入数组所含数据的个数和数据,compute函数的功能是计算数组中除去最大值和最小值后数据的平均值
task3
源代码
#include<stdio.h> #define N 100 void output(int x[][N], int n); void init(int x[][N], int n, int value); int main() { int x[N][N]; int n, value; while (printf("Enter n and value:"), scanf_s("%d %d", &n, &value) != EOF) { init(x, n, value); output(x, n); printf("\n"); } return 0; } void output(int x[][N], int n) { int i, j; for (i = 0; i < n; ++i) { for (j = 0; j < n; ++j) printf("%d", x[i][j]); printf("\n"); } } void init(int x[][N], int n, int value) { int i,j; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) x[i][j] = value; }
程序运行截图
问题1:第二维的大小不能省略
问题2:output函数功能是按行和列格式速出一个n*n的二维数组,init函数功能是初始化一个n*n的二维数组
task4
源代码
#include<stdio.h> #define N 100 void input(int x[], int n); double median(int x[], int n); int main() { int x[N]; int n; double ans; while (printf("Enter n:"), scanf_s("%d", &n) != EOF) { input(x, n); ans = median(x, n); printf("ans=%.1f\n\n", ans); } return 0; } void input(int x[], int n) { printf("Enter %d numbers:", n); for (int i = 0; i < n; ++i) { scanf_s("%d", &x[i]); } } double median(int x[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (x[j] > x[j + 1]) { int temp = x[j]; x[j] = x[j + 1]; x[j + 1] = temp; } } } if (n % 2 == 1) { return x[n / 2]; } else { return(x[n / 2 - 1] + x[n / 2] )/ 2.0; } }
程序运行截图
task5
源代码
#include<stdio.h> #define N 100 void input(int x[][N], int n); void output(int x[][N], int n); void rotate_to_right(int x[][N], int n); int main() { int x[N][N]; int n; printf("Enter n:"); scanf_s("%d", &n); input(x, n); printf("原始矩阵:\n"); output(x, n); rotate_to_right(x, n); printf("变换后的矩阵:\n"); output(x, n); return 0; } void input(int x[][N], int n) { int i, j; for (i = 0; i < n; ++i) { for (j = 0; j < n; ++j) scanf_s("%d", &x[i][j]); } } void output(int x[][N], int n) { int i, j; for (i = 0; i < n; ++i) { for (j = 0; j < n; ++j) printf("%d", x[i][j]); printf("\n"); } } void rotate_to_right(int x[][N], int n) { int temp[N]; int i, j; for (i = 0; i < n; ++i) { temp[i] = x[i][n - 1]; } for (j = n - 1; j > 0; --j) { for (i = 0; i < n; ++i) { x[i][j] = x[i][j - 1]; } } for (i = 0; i < n; ++i) { x[i][0] = temp[i]; } }
程序运行截图
task6
源代码
#include<stdio.h> #define N 100 void dec_to_n(int x, int n); int main() { int x; while (printf("输入十进制整数:"), scanf_s("%d", &x) != EOF) { dec_to_n(x, 2); dec_to_n(x, 8); dec_to_n(x, 16); printf("\n"); } return 0; } void dec_to_n(int x, int n) { char digits[N]; int i = 0; int remainder; int original_x = x; if (x == 0) { printf("0\n"); return; } if (x < 0) { x = -x; } while (x > 0) { remainder = x % n; if (remainder < 10) { digits[i] = remainder + '0'; } else { digits[i] = remainder - 10 + 'A'; } x = x / n; i++; } if (original_x < 0) { printf("-"); } for (int j = i - 1; j >= 0; j--) { printf("%c", digits[j]); } printf("\n"); }
程序运行截图
task7
源代码
#include<stdio.h> int main() { for (int num = 1; num < 100000; num++) { int square = num * num; int cube = num * num * num; long combined = 0; int temp = square; while (temp > 0) { combined = combined * 10 + temp % 10; temp /= 10; } temp = cube; while (temp > 0) { combined = combined * 10 + temp % 10; temp /= 10; } int digits[10] = { 0 }; int valid = 1; long check = combined; while (check > 0) { int digit = check % 10; digits[digit]++; if (digits[digit] > 1) { valid = 0; break; } check /= 10; } if (valid) { for (int i = 0; i < 10; i++) { if (digits[i] != 1) { valid = 0; break; } } } if (valid) { printf("找到符合条件的数字:%d\n", num); printf("平方:%d,立方:%d\n", square, cube); return 0; } } printf("没有找到。\n"); return 0;
程序运行截图