Pagini recente » Cod sursa (job #424078) | Cod sursa (job #2333720) | Cod sursa (job #1029901) | Cod sursa (job #3137797) | Cod sursa (job #3319984)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("matrix.in");
ofstream fout("matrix.out");
int n, m, i, j, vi[26], rasp;
char a[1002][1002], car;
bool gr[1002][1002];
int fr[1002][1002];
int main() {
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n >> m;
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) fin >> a[i][j];
}
for(i = 1; i <= m; i++) {
for(j = 1; j <= m; j++) {
fin >> car;
vi[car - 'a']++;
}
}
for(i = m; i <= n; i++) {
for(j = m; j <= n; j++) gr[i][j] = true;
}
for(int c = 0; c < 26; c++) {
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
fr[i][j] = (c == a[i][j] - 'a') + fr[i - 1][j] + fr[i][j - 1] - fr[i - 1][j - 1];
}
}
for(i = m; i <= n; i++) {
for(j = m; j <= n; j++) {
if(fr[i][j] - fr[i - m][j] - fr[i][j - m] + fr[i - m][j - m] != vi[c]) {
gr[i][j] = false;
}
}
}
}
for(i = m; i <= n; i++) {
for(j = m; j <= n; j++) {
if(gr[i][j]) rasp++;
}
}
fout << rasp;
return 0;
}