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