Pagini recente » Cod sursa (job #2823534) | Cod sursa (job #1507322) | Cod sursa (job #406877) | Cod sursa (job #77788) | Cod sursa (job #3236833)
#include <fstream>
using namespace std;
ifstream fcin("matrix.in");
ofstream fout("matrix.out");
char c;
int n,m,x[1001][1001],f[30],nr,d1[1001][1001],d2[1001][1001],s,ss;
int main()
{
fcin>>n>>m;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
fcin>>c;
x[i][j]=c-96;
}
}
for(int i=1; i<=m; i++)
{
for(int j=1; j<=m; j++)
{
fcin>>c;
f[c-96]++;
s=s+c-96;
ss=ss+(c-96)*(c-96);
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
d1[i][j]=d1[i-1][j]+d1[i][j-1]-d1[i-1][j-1]+x[i][j];
d2[i][j]=d2[i-1][j]+d2[i][j-1]-d2[i-1][j-1]+x[i][j]*x[i][j];
}
}
for(int i=m; i<=n; i++)
{
for(int j=m; j<=n; j++)
{
int ok=0;
int l1=i-m+1;
int c1=j-m+1;
int l2=i;
int c2=j;
if(d1[l2][c2]-d1[l2][c1-1]-d1[l1-1][c2]+d1[l1-1][c1-1]!=s || d2[l2][c2]-d2[l2][c1-1]-d2[l1-1][c2]+d2[l1-1][c1-1]!=ss)
{
ok=1;
}
if(ok==0)
{
nr++;
}
}
}
fout<<nr;
return 0;
}