题解 | 矩阵相等判定

#include <stdio.h>

int main() 
{
    int i = 0,j = 0;
    int n = 0,m = 0;
    int count = 0;
    scanf("%d %d",&n,&m);
    int arr1[n][m];
    int arr2[n][m];
    for (i = 0;i<n;i++) 
    {
        for (j = 0;j<m;j++) 
        {
            scanf("%d",&arr1[i][j]);
        }
    }
    for (i = 0;i<n;i++) 
    {
        for (j = 0;j<m;j++) 
        {
            scanf("%d",&arr2[i][j]);
        }
    }
    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");
    }
    else 
    {
        printf("No");
    }
    return 0;
}