题解 | 矩阵相等判定

#include <stdio.h>

int main() {
    int n = 0; 
    int m = 0; 
    int count = 0;
    int arr1[10][10] = {0};
    int arr2[10][10] = {0}; 
    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])
            {
                count++;
            }
        }
    }
    if (count == (n * m))
    {
        printf("Yes\n");
    }
    else 
    {
        printf("No\n");
    }
    return 0;
}