Pagini recente » Cod sursa (job #191187) | Cod sursa (job #177054) | Cod sursa (job #1151887) | Istoria paginii monthly-2012/runda-11/clasament | Cod sursa (job #249300)
Cod sursa(job #249300)
#include <stdio.h>
#include <algorithm>
#define MAX 1024
using namespace std;
int n, m, rez;
int matAp[MAX][MAX], valid[MAX][MAX];
int apLitera[26];
char matInit[MAX][MAX];
int main()
{
freopen("matrix.in","r",stdin);
freopen("matrix.out","w",stdout);
scanf("%d %d\n", &m, &n);
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= m; j++)
{
scanf("%c", &matInit[i][j]);
valid[i][j] = 1;
}
scanf("\n");
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
char elMatrix;
scanf("%c", &elMatrix);
apLitera[elMatrix - 'a']++;
}
scanf("\n");
}
for (int lit = 0; lit < 26; lit++)
for (int i = 1; i <= m; i++)
{
int ap = 0;
for (int j = 1; j <= m; j++)
{
if (matInit[i][j] - 'a' == lit)
ap++;
if (j > n && matInit[i][j - n] - 'a' == lit)
ap--;
matAp[i][j] = matAp[i - 1][j] + ap;
if (i > n)
matAp[i][j] -= matAp[i - n][j];
if (matAp[i][j] != apLitera[lit])
valid[i][j] = 0;
}
}
for (int i = 1; i <= m; i++)
for (int j = 1; j <= m; j++)
rez += valid[i][j];
printf("%d\n", rez);
fclose(stdin);
fclose(stdout);
return 0;
}