题解 | 矩阵相等判定

#include <stdio.h>

int main() {
    int n, m = 0;
    int arr1[10][10] = {0};
    int arr2[10][10] = {0};
    int flag = 1;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            scanf("%d", &arr1[i][j]);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            scanf("%d", &arr2[i][j]);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (arr1[i][j] != arr2[i][j]) {
                flag = 0;
                break;
            }
        }
    }
    if (flag) {
        printf("Yes\n");
    }
    else {
        printf("No\n");
    }
    return 0;
}