Pagini recente » Cod sursa (job #462249) | Cod sursa (job #3237128) | Cod sursa (job #2473987) | Cod sursa (job #2736044) | Cod sursa (job #2794628)
#include <bits/stdc++.h>
using namespace std;
/**
3 2
acb
bda
acb
ab => 1 + 4 + 9 + 16
cd
aa => 1+1+16+16
dd
sume partiale pe ambele matrice
a = 1, b=2, ..., z=26
sume partiale a elementelor la patrat pe ambele matrice
aabc
bbaa
aaba
bbbb
ab
ab
*/
ifstream fin("matrix.in");
ofstream fout("matrix.out");
int s[1002][1002], sp[1002][1002], n, m;
int A, B;
int main()
{
int i, j, c, cnt = 0, x, y;
char w[1002];
fin >> n >> m;
for (i = 1; i <= n; i++)
{
fin >> (w + 1);
for (j = 1; j <= n; j++)
{
c = w[j] - 'a' + 1;
s[i][j] = c + s[i][j-1] + s[i-1][j] - s[i-1][j-1];
sp[i][j] = c * c + sp[i][j-1] + sp[i-1][j] - sp[i-1][j-1];
}
}
for (i = 1; i <= m; i++)
{
fin >> (w + 1);
for (j = 1; j <= m; j++)
{
c = w[j] - 'a' + 1;
A = A + c;
B = B + c * c;
}
}
for (i = m; i <= n; i++)
for (j = m; j <= n; j++)
{
x = s[i][j] - s[i-m][j] - s[i][j-m] + s[i-m][j-m];
y = sp[i][j] - sp[i-m][j] - sp[i][j-m] + sp[i-m][j-m];
if (x == A && y == B) cnt++;
}
fout << cnt << "\n";
fout.close();
fin.close();
return 0;
}