题解

认真读题，就是要求两个矩阵有多少个对应元素的个位数字相同

#include <iostream>
#include <cstdio>
using namespace std;
int a[105][105], b[105][105];
int main(){
	int n, m, ct = 0;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			a[i][j] %= 10;
		}
	}for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> b[i][j];
			b[i][j] %= 10;
			ct += (a[i][j] == b[i][j]);
		}
	}cout << ct;

	return 0;
}