Pagini recente » Cod sursa (job #2632398) | Cod sursa (job #2309932) | Cod sursa (job #897720) | Cod sursa (job #636639) | Cod sursa (job #554231)
Cod sursa(job #554231)
#include <cstdio>
#include <cstring>
const int N=1005;
int n,m,sol,k,l,f[27],frecv[27],cnt;
char a[N][N],s[N];
void citire()
{
freopen("matrix.in","r",stdin);
freopen("matrix.out","w",stdout);
scanf("%d%d\n",&n,&m);
for (int i=1;i<=n;++i)
{
gets(s);
for (int j=0;j<n;++j)
a[i][j+1]=s[j];
}
for(int i=0;i<m;++i)
{
gets(s);
for(int j=0;j<m;++j)
++frecv[s[j]-'a'];
}
}
void work()
{
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
memset(f,0,sizeof(f));
bool ok=false;
for(int k=i;k<=i+m-1 && !ok;++k)
for(int l=j;l<=j+m-1 && !ok;++l)
{
++f[a[k][l]-'a'];
if(frecv[a[k][l]-'a']!=f[a[k][l]-'a'])
ok=true;
}
if(!ok)
++cnt;
}
printf("%d\n",cnt);
}
int main()
{
citire();
work();
return 0;
}