Pagini recente » Cod sursa (job #2723939) | Cod sursa (job #1874582) | Cod sursa (job #1990771) | Cod sursa (job #1531983) | Cod sursa (job #2527170)
#include <iostream>
#include <fstream>
#include <bitset>
#define LN 1005
using namespace std;
ifstream fin ("matrix.in");
ofstream fout ("matrix.out");
char c, s[LN][LN];
int n, m, sol;
int f[130], d[LN][LN];
bitset <LN>ok[LN];
int main (){
fin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>s[i][j];
for(int i=1; i<=m; i++)
for(int j=1; j<=m; j++)
fin>>c, f[c]++;
for(char lit='a'; lit<='z'; lit++){
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++){
d[i][j] = d[i-1][j] + d[i][j-1] - d[i-1][j-1];
if(s[i][j] == lit) d[i][j]++;
}
for(int i=m; i<=n; i++)
for(int j=m; j<=n; j++)
if(d[i][j]-d[i-m][j]-d[i][j-m]+d[i-m][j-m] != f[lit])
ok[i][j]=1;
}
for(int i=m; i<=n; i++)
for(int j=m; j<=n; j++)
sol+=(1-ok[i][j]);
fout<<sol;
return 0;
}