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