题解 | 矩阵相等判定

#include<bits/stdc++.h>
using namespace std;
int arr1[10][10];
int arr2[10][10];
int main() {
	int n, m;
	cin >> n >> m;
	int check = 1;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> arr1[i][j];
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> arr2[i][j];
			if (check) {
				if (arr1[i][j] != arr2[i][j])check = 0;
			}
		}
	}
	if (!check)cout << "No\n";
	else cout << "Yes\n";
	return 0;
}