Pagini recente » Cod sursa (job #1962525) | Cod sursa (job #1134456) | Cod sursa (job #671188) | Cod sursa (job #1058761) | Cod sursa (job #492945)
Cod sursa(job #492945)
/*#include<cstdio>
int nr,n,m,fr[30],spart[1005][1005];
bool ok[1005][1005];
char a[1005][1005],ss[1005];
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(a[i]+1);
for (int i=1;i<=m;++i)
{
gets(ss);
for (int i=0;i<m;++i)
fr[ss[i]-'a'+1]++;
}
}
void init()
{
for (int i=m;i<=n;++i)
for (int j=m;j<=n;++j)
ok[i][j]=true;
}
void initspart()
{
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
spart[i][j]=0;
}
int main ()
{
citire();
init();
for (int k=1;k<=26;k++)
{
initspart();
for (int i=1;i<=m;i++)
for (int j=1;j<=m;j++)
{
spart[i][j]=spart[i-1][j]+spart[i][j-1]-spart[i-1][j-1];
if (a[i][j]-'a'+1==k)
++spart[i][j];
}
for (int i=n;i<=m;i++)
for (int j=n;j<=m;j++)
if (ok[i][j] && spart[i][j]-spart[i-n][j]-spart[i][j-n]+spart[i-n][j-n]!=fr[k])
ok[i][j]=0;
}
for (int i=1;i<=m;i++)
for (int j=1;j<=m;j++)
if (ok[i][j])
++nr;
printf("%d\n",nr);
return 0;
}
*/
#include<cstdio>
int nr,m,n,k,x[31],xx[1001][1001];
char sx[1001],a[1001][1001];
bool da[1001][1001];
int main()
{
freopen("matrix.in","r",stdin);
freopen("matrix.out","w",stdout);
scanf("%d%d\n",&m,&n);
int i,j;
for(i=1;i<=m;++i)
gets(a[i]+1);
for(i=1;i<=n;++i)
{
gets(sx);
for(j=0;j<n;++j)
x[sx[j]-96]++;
}
for (i=n;i<=m;++i)
for (j=n;j<=m;++j)
da[i][j]=true;
for(k=1;k<=26;k++)
{
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
xx[i][j]=0;
for (i=1;i<=m;i++)
for (j=1;j<=m;j++)
{
xx[i][j]=xx[i-1][j]+xx[i][j-1]-xx[i-1][j-1];
if (a[i][j]-'a'+1==k)
++xx[i][j];
}
for (i=n;i<=m;i++)
for (j=n;j<=m;j++)
if (da[i][j] && xx[i][j]-xx[i-n][j]-xx[i][j-n]+xx[i-n][j-n]!=x[k])
da[i][j]=0;
}
nr=0;
for (i=1;i<=m;i++)
for (j=1;j<=m;j++)
if (da[i][j])
++nr;
printf("%d\n",nr);
return 0;
}