Pagini recente » Cod sursa (job #344484) | Cod sursa (job #930155) | Cod sursa (job #1113761) | Cod sursa (job #1662651) | Cod sursa (job #904214)
Cod sursa(job #904214)
#include<fstream>
#include<cstdio>
using namespace std;
const int NM=1002;
char a[NM][NM],b[NM][NM];
int c0[27],l0[27],t[27],g[27],t0[27],NR;
void verify(){
for(int i=0;i<26;++i)if(t[i]!=g[i])return;
++NR;
}
int main(){
freopen("matrix.in","r",stdin);
freopen("matrix.out","w",stdout);
int N,M,i,j,q,k;
scanf("%d%d\n",&N,&M);
for(i=1;i<=N;++i)gets(a[i]);
for(i=1;i<=M;++i)gets(b[i]);
for(i=1;i<=M;++i)
for(j=0;j<M;++j){ g[b[i][j]-'a']++; t[a[i][j]-'a']++; }
for(i=0;i<26;++i) t0[i]=t[i];
for(i=1;i<=N-M+1;++i)
{
if(i!=1){
for(q=0;q<26;++q)t[q]=t0[q];
for(q=0;q<M;++q){ t[a[i+M-1][q]-'a']++; t[a[i-1][q]-'a']--; }
for(q=0;q<26;++q)t0[q]=t[q];
}
verify();
for(j=M;j<N;++j)
{
for(k=i;k<=M+i-1;++k)
{ t[a[k][j]-'a']++; t[a[k][j-M]-'a']--; }
verify();
}
}
printf("%d",NR);
return 0;
}