题解 | 矩阵相等判定

#include <stdio.h>
#define N 10
int main()
{
    int n,m;
    scanf("%d %d",&n,&m);

    int arr1[N][N];
    int i,j;
    for(i = 0; i < n; i++)
    {
        for(j = 0; j < m; j++)
        {
            scanf("%d",&arr1[i][j]);
        }
    }

    int arr2[N][N];
    for(i = 0; i < n; i++)
    {
        for(j = 0; j < m; j++)
        {
            scanf("%d",&arr2[i][j]);
        }
    }

    int count = 0;
    for(i = 0; i < n; i++)
    {
        for(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;
}