Pagini recente » Cod sursa (job #2906688) | Cod sursa (job #2430320) | Cod sursa (job #2142536) | Cod sursa (job #1175570) | Cod sursa (job #756725)
Cod sursa(job #756725)
#include<cstdio>
const int maxn = 1005 ;
const int maxl = 26 ;
int n,m ;
bool ok[maxn][maxn] ;
char map[maxn][maxn],line[maxn] ;
int frecv[maxl],ap[maxn][maxn] ;
int main()
{
freopen("matrix.in","r",stdin);
freopen("matrix.out","w",stdout);
scanf("%d%d\n",&n,&m);
for(int i=1;i<=n;++i)
fgets(map[i]+1,1002,stdin);
for(int i=1;i<=m;++i)
{
fgets(line,1002,stdin);
for(int j=0;j<m;++j)
++ frecv[ line[j]-'a' ] ;
}
for(int i=0;i<25;++i)
{
for(int j=1;j<=n;++j)
{
for(int k=1;k<=n;++k)
{
bool val = ( map[j][k] - 'a' == i ) ;
ap[j][k] = ap[j-1][k] + ap[j][k-1] - ap[j-1][k-1] + val ;
}
}
for(int j=m;j<=n;++j)
for(int k=m;k<=n;++k)
if( frecv[i] != ap[j][k] - ap[j][k-m] - ap[j-m][k] + ap[j-m][k-m] )
ok[j][k] = 1 ;
}
int rez = 0 ;
for(int i=m;i<=n;++i)
for(int j=m;j<=n;++j)
if( !ok[i][j] )
++rez ;
printf("%d\n",rez);
return 0;
}