Pagini recente » Cod sursa (job #1973306) | Cod sursa (job #1905830) | Cod sursa (job #2548467) | Cod sursa (job #34007) | Cod sursa (job #2733029)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("matrix.in");
ofstream fout("matrix.out");
int n,m;
char a[1003][1003];
char b[1003][1003];
int dp[1003][1003][27];
int ap[27];
int rasp;
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>a[i][j];
for(int i=1; i<=m; i++)
for(int j=1; j<=m; j++)
{
char ch;
fin>>ch;
ap[ch-'a']++;
}
for(char c='a'; c<='z'; c++)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(c==a[i][j]) dp[i][j][c-'a']=dp[i][j-1][c-'a']+dp[i-1][j][c-'a']-dp[i-1][j-1][c-'a']+1;
else dp[i][j][c-'a']=dp[i][j-1][c-'a']+dp[i-1][j][c-'a']-dp[i-1][j-1][c-'a'];
}
}
}
for(int i=m; i<=n; i++)
{
for(int j=m; j<=n; j++)
{
short flag=1;
for(char c='a'; c<='z'; c++)
{
if(dp[i][j][c-'a']-dp[i][j-m][c-'a']-dp[i-m][j][c-'a']+dp[i-m][j-m][c-'a'] !=ap[c-'a']) flag=0;
}
rasp+=flag;
}
}
fout<<rasp;
return 0;
}