Pagini recente » Cod sursa (job #258950) | Cod sursa (job #1713246) | Cod sursa (job #103515) | Cod sursa (job #657140) | Cod sursa (job #2547831)
#include <fstream>
using namespace std;
int a[1001][201][26], i, j, sol[26], ii, jj, t, m, n, ok, SOL;
char c;
int main ()
{
ifstream fin ("matrix.in");
ofstream fout ("matrix.out");
fin>>m>>n;
for (i=1; i<=m; i++)
for (j=1; j<=m; j++)
{
fin>>c;
for (int t=0; t<='z'-'a'; t++)
a[i][j][t]=a[i][j-1][t]+a[i-1][j][t]-a[i-1][j-1][t]+(t==c-'a');
}
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
fin>>c;
sol[c-'a']++;
}
for (i=1; i<=m-n+1; i++)
for (j=1; j<=m-n+1; j++)
{
ii=i+n-1;
jj=j+n-1;
ok=1;
for (t=0; t<='z'-'a'; t++)
if (a[ii][jj][t]-a[i-1][jj][t]-a[ii][j-1][t]+a[i-1][j-1][t]!=sol[t])
{
ok=0;
break;
}
SOL+=ok;
}
fout<<SOL;
}