实验四

实验1

#define _CRT_SECURE_NO_WARNINGS
#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;
}

问题一：一维数组x在存放中是连续存放。x和&x[0]相同

问题二：二维数组x在内存中不是按行连续存放，x和x[0][0]和x[0]相同，x[0]和x[1]差16，差值的含义是列也要占据内存字节，而差的16个字节正好是第0行的1，2，3，4列所占的字节。

实验2：

#define _CRT_SECURE_NO_WARNINGS
#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("%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("%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;
}

问题1：形参：x[],n。实参：以第一组数据为例：5；1，9，8，4，2

问题2：input的作用是输入x[]和n的具体值，compute的作用是去掉最高分与最低分求剩余平均值

实验3：

#define _CRT_SECURE_NO_WARNINGS
#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("%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：形参：x[][N],n。实参：5，42。

问题2：不可以，机器将无法计算矩阵大小。

问题3：output作用是输出矩阵，init的作用是将value的值赋给矩阵。

实验4：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define N 100
void input(int x[],int n);
double medium(int x[], int n);
int i;
int main() {
    int x[N];
    int n;
    double ans;
    while (printf("Enter n:"), scanf("%d",&n) != EOF) {
        input(x, n);
        ans = medium(x, n);
        printf("ans=%g\n\n", ans);
    }
    return 0;
}
void input(int x[], int n) {
    
    for (i = 0; i < n; ++i)
        scanf("%d", &x[i]);
}
double medium(int x[], int n) {
    double ans ;
    int i, j;
    int t;
    for(i=0;i<n-1;++i)
        for (j = 0; j<n-i-1 ;j++) {
            if (x[j] > x[j + 1]) {
                t = x[j];
                x[j] = x[j + 1];
                x[j + 1] = t;
            }

        }
    if (n % 2 == 0)
        ans =(1.0* x[n / 2] + 1.0*x[n / 2 - 1])/2;
    else if (n % 2 != 0)
        ans = 1.0*x[(n + 1) / 2 - 1];
    return ans;
}

实验5：

#define _CRT_SECURE_NO_WARNINGS
#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("%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("%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 rotate_to_right(int x[][N], int n) {
    int i, j;
    int t;
    for (i = 0; i < n; ++i) {
        t = x[i][n - 1];
        for (j = n - 1; j >0; j--) {
            x[i][j] = x[i][j-1];
            
        }
        x[i][0] = t;
        printf("%d", x[i][j]);
        printf("\n");
    }

}

 实验6：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define N 100
void dec_to_n(int x, int n); 
int main() {
    int x;
    while (printf("输入十进制整数: "), scanf("%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) {
    int i = 0, j, k = 0, h, m = 0, t, b;
    int a[N], y[N], z[N];    
    if (n == 2) {
        if (x == 0) {
            printf("0");
        }
        while (x > 0) {
            a[i] = x % 2;
            x = x / 2;
            i++;
        }
        for (j = i - 1; j >= 0; j--)
            printf("%d", a[j]);
    }printf("\n");
    if (n == 8) {
        if (x == 0) {
            printf("0");
        }
        while (x > 0) {
            y[k] = x % 8;
            x = x / 8;
            k++;
        }
        for (h = k - 1; h >= 0; h--)
            printf("%d", y[h]);
    }printf("\n");
    if (n == 16) {
        if (x == 0) {
            printf("0");
        }
        while (x > 0) {
            z[m] = x % 16;
            x = x / 16;
            m++;
        }
        for (t = m - 1; t >= 0; t--) {
            b = z[t];
            if (b == 10) {
                printf("A");
            }
            else if (b == 11) {
                printf("B");
            }
            else if (b == 12) {
                printf("C");
            }
            else if (b == 13) {
                printf("D");
            }
            else if (b == 14) {
                printf("E");
            }
            else if (b == 15) {
                printf("F");
            }
            else
            printf("%d", b);
        }
    }
}

 实验7：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define N 100
void input(int x[][N], int n);
void output(int x[][N], int n);
int is_magic(int x[][N], int n);
int main() {
    int x[N][N];
    int n;
    while (printf("输入n:"), scanf("%d", &n) != EOF) {
        printf("输入方阵：\n");
        input(x, n);
        printf("输出方阵：\n");
        output(x, n);
        if (is_magic(x, n))
            printf("是魔方矩阵\n\n");
        else
            printf("是不魔方矩阵\n\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("%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");
    }
}
int is_magic(int x[][N], int n) {
    int s;
    int i, j, k, l, ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0,ans5=0;
    int q, w;
    s = n * (n * n + 1) / 2;
    for (i = 0; i < n; ++i) {
        for (j = 0; j < n; ++j) {
            ans1 = ans1 + x[i][j];
        }
    }
    for (k = 0; k < n; ++k) {
        for (l = 0; l < n; ++l) {
            ans2 = ans2 + x[l][k];
        }
    }
    for (q = 0; q < n; ++q)
        ans4 += x[q][q];
    for (w = n - 1; w >= 0; w--)
        ans5 += x[w][w];
    if (ans1 / n == s && ans2 / n == s && ans4 == s && ans5 == s)
        return 1;
    return 0;
}

 实验8：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define N 100
int same(int k[N]);
void comput(int x, int a[]);
void order(int d[],int m);
void tog(int z[], int x1[],int x2[],int q, int w);
int cnt(int l);
void move(int arr[], int size);
int main() {
    int i=1;
    int s, m;
    int p = 0, q = 0;
    int a[N], b[N];
    int c[N];
    for (i = 1;; i++) {
        s = i * i;
        m = i * i * i;
        comput(s, a);
        comput(m, b);
        order(a, cnt(s));
        order(b, cnt(m));
        tog(c, a, b, cnt(s),cnt(m));
        order(c, cnt(s)+ cnt(m));
        move(c, cnt(s) + cnt(m));
        if (same(c)) {
            printf("%d", i);
            break;
        }


    }
}
int same(int k[N]) {
    int x[N] = { 0,1,2,3,4,5,6,7,8,9 };
    int i = 0;
    int j = 0;
    for (i = 0, j = 0; i < 10&& j < 10; ++i, ++j) {
        if (k[j] != x[i])
            return 0;
    }
    return 1;
}
void comput(int x, int a[]) {
    int i = 0;
    while (x != 0) {
        a[i] = x % 10;
        x = x / 10;
        i++;
    }
}
void order(int d[], int n) {
    int i, j, t;
    for (i = 0; i < n - 1; ++i)
        for (j = 0; j < n - i - 1; ++j) {
            if (d[j] > d[j + 1]) {
                t = d[j];
                d[j] = d[j + 1];
                d[j + 1] = t;
            }
        }
}
int cnt(int l) {
    int i=0;
    while (l != 0) {
        i++;
        l = l / 10;
    }return i;
}
void tog(int z[], int x1[],int x2[],int q, int w) {
    for (int i = 0; i < q; i++) {
        z[i] = x1[i];
    }
    for (int i = 0; i < w; i++)
        z[i + q] = x2[i];
}
void move(int arr[], int size) {
    int j = 0;
    for (int i = 0; i < size - 1; i++) {
        if (arr[i] != arr[i + 1])
            arr[j++] = arr[i];
    }
    arr[j] = arr[size - 1];
    
}