变色龙题解！！！

#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
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 e = 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]) {
                    e++;
                }
            }
        }
        if (e == 1) {
            count++;
        }
    }
}
cout << count << endl;
return 0;

}