Pagini recente » Cod sursa (job #1634827) | Cod sursa (job #1093754) | Cod sursa (job #274413) | Cod sursa (job #322301) | Cod sursa (job #2549909)
#include <iostream>
#include <fstream>
using namespace std;
char c;
char a[1001][1001];
int sol, i, j, n, m, f[200];
int x[1001][1001];
int v[1001][1001];
int main ()
{
ifstream fin ("perm2.in");
ofstream fout("perm2.out");
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>>c;
f[c] ++;
}
for (i=m; i<=n; i++)
for (j=m; j<=n; j++)
v[i][j] = 1;
for (c = 'a'; c <= 'z'; c++)
{
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if(a[i][j]==c)
x[i][j] = 1 + x[i-1][j] + x[i][j-1] - x[i-1][j-1];
else
x[i][j] = 0 + x[i-1][j] + x[i][j-1] - x[i-1][j-1];
for (i=m; i<=n; i++)
for (j=m; j<=n; j++)
if (x[i][j] - x[i-m][j] - x[i][j-m] + x[i-m][j-m] != f[c])
v[i][j] = 0;
}
for (i=m; i<=n; i++)
for (j=m; j<=n; j++)
sol += v[i][j];
fout<<sol;
return 0;
}