题解 | #矩阵相等判定#
矩阵相等判定
https://www.nowcoder.com/practice/2f058b1e89ae43f7ab650c0fd0b71fa8
#include <stdio.h>
int main() {
int n = 0;
int m = 0;
scanf("%d%d", &n, &m);
int arr1[n][m];
int arr2[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]){
printf("No\n");
return 0;
}
}
}
printf("Yes\n");
return 0;
}