作业4

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;
}

第二题

include <stdio.h>

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;
}

第三题

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;
}
第四题

include <stdio.h>

define N 100

void input(int arr[], int n);
double median(int arr[], 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 = %g\n\n", ans);
}
return 0;
}
void input(int arr[], int n) {
for (int i = 0; i < n; i++) {
scanf_s("%d", &arr[i]);
}
}
double median(int arr[], int n) {

for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
int temp = arr[j];
arr[j]= arr[j + 1];
arr[j + 1] = temp;
}
}
}
if (n % 2 == 1) {
return (double)arr[n / 2];
}
else {
return ((double)arr[n / 2 - 1] + (double)arr[n / 2]) / 2;
}
}
第五题

include <stdio.h>

define N 100

void input(int x[][N], int n);
void output(int x[][N], int n);
void rotat(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);
rotat(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("%4d", x[i][j]);
printf("\n");
}
}
void rotat(int x[][N], int n) {
int temp[N];
for (int i = 0; i < n; i++) {
temp[i] = x[i][n - 1];
}
for (int j = n - 1; j > 0; j--) {
for (int i = 0; i < n; i++) {
x[i][j] = x[i][j - 1];
}
}
for (int i = 0; i < n; i++) {
x[i][0] = temp[i];
}
}

第六题

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);
printf("\n");
dec_to_n(x, 8);
printf("\n");
dec_to_n(x, 16);
printf("\n");
}
return 0;
}
void dec_to_n(int x, int n) {
char map[] = "0123456789ABCDEFGH";
char ans[N];
int d, r;
int cnt = 0;
while (1) {
r = x % n;
d = x / n;
ans[cnt++] = map[r];
if (d == 0)
break;
x = d;
}
for (--cnt; cnt >= 0; --cnt)
printf("%c", ans[cnt]);
}