题解 | 矩阵相等判定

#include <stdio.h>

int main() 
{
    int n = 0;
    int m = 0;
    while (scanf("%d %d", &n, &m) == 2)
    {
        int arr1[n][m];
        int arr2[n][m];
        int i = 0;
        int j = 0;
        int flag = 0;
        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])
                {
                    printf("No\n");
                    goto next;
                }
            }
        }
        if (i == n )
        {
            printf("Yes\n");
        }
        next: ;
    }
    return 0;
}