Pagini recente » Cod sursa (job #564770) | Cod sursa (job #1107963) | Cod sursa (job #1836090) | Cod sursa (job #1040253) | Cod sursa (job #2414990)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("matrix.in");
ofstream fout("matrix.out");
const int NMAX = 1005;
int frecv[30];
int a[NMAX][NMAX],sump[NMAX][NMAX];
bool rasp[NMAX][NMAX];
int main()
{
int n,m;
fin >> m >> n;
char c;
for(int i=1;i<=m;i++)
for(int j=1;j<=m;j++)
{
fin >> c;
a[i][j]=c-'a'+1;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
fin >> c;
frecv[c-'a'+1]++;
}
for(int i=1;i<=m;i++)
for(int j=1;j<=m;j++)
rasp[i][j]=1;
for(int ch=1;ch<='z'-'a'+1;ch++)
{
for(int i=1;i<=m;i++)
{
for(int j=1;j<=m;j++)
{
sump[i][j]=sump[i-1][j]+sump[i][j-1]-sump[i-1][j-1];
if(a[i][j]==ch) sump[i][j]++;
if(i>=n and j>=n)
{
if(sump[i][j]+sump[i-n][j-n]-sump[i-n][j]-sump[i][j-n]!=frecv[ch])
rasp[i][j]=0;
}
}
}
}
int afis=0;
for(int i=n;i<=m;i++)
for(int j=n;j<=m;j++)
afis+=rasp[i][j];
fout << afis;
return 0;
}