解:
2025-03-31 00:10:25
发布于:广东
10阅读
0回复
0点赞
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
vector<string> B(n);
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int count = 0;
for (int x = 0; x <= n - m; x++) {
for (int y = 0; y <= n - m; y++) {
int diff = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (A[x + i][y + j] != B[x + i][y + j]) {
diff++;
}
}
}
if (diff == 1) {
count++;
}
}
}
cout << count << endl;
return 0;
}
请记得开心
这里空空如也
有帮助,赞一个