Pagini recente » Cod sursa (job #2325503) | Cod sursa (job #2208007) | Cod sursa (job #1022486) | Cod sursa (job #1629952) | Cod sursa (job #2547721)
#include <fstream>
#define dim 1010
using namespace std;
char a[dim][dim];
char b[dim][dim];
char f[30];
char l;
int ok[dim][dim];
int d[dim][dim];
int i,j,n,m,sol;
int main() {
ifstream fin("matrix.in"); ///sunt 26 de litere in alfabet
ofstream fout("matrix.out");
fin>>n>>m;
for (i=1;i<=n;i++) {
for (j=1;j<=n;j++) {
fin>>a[i][j];
ok[i][j]=1;
}
}
for (i=1;i<=m;i++) {
for (j=1;j<=m;j++) {
fin>>b[i][j];
f[b[i][j]]++;
}
}
for (l='a';l<='z';l++) {
for (i=1;i<=n;i++) {
for (j=1;j<=n;j++) {///d este o matrice de sume partiale pentru fiecare litera
d[i][j]=d[i-1][j]+d[i][j-1]-d[i-1][j-1]+(a[i][j]==l);
}
}
for (i=m;i<=n;i++) {
for (j=m;j<=n;j++) {
if (d[i][j]-d[i-m][j]-d[i][j-m]+d[i-m][j-m]!=f[l]) ok[i][j]=0;
}
}
}
for (i=m;i<=n;i++) {
for (j=m;j<=n;j++) {
if (ok[i][j]==1) sol++;
}
}
fout<<sol;
/* for (i=1;i<=m;i++) {
for (j=1;j<=m;j++) fout<<b[i][j]<<" ";
fout<<"\n";
} */
return 0;
}