Pagini recente » Cod sursa (job #2759055) | Cod sursa (job #2306288) | Cod sursa (job #46457) | Cod sursa (job #298177) | Cod sursa (job #3165977)
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin ("matrix.in");
ofstream fout ("matrix.out");
bitset <1001> sol[1001];
int l,fr[26],sum,i1,j1,i2,j2,n,m,i,j,s[1001][1001];
short int v[1001][1001];
char ch;
int main ()
{
fin>>n>>m;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
fin>>ch;
v[i][j]=ch-'a';
sol[i][j]=1;
}
}
for (i=1; i<=m*m; i++)
{
fin>>ch;
fr[ch-'a']++;
}
for (l=0; l<26; l++)
{
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1];
if (v[i][j]==l)
s[i][j]++;
}
}
for (i1=1; i1<=n-m+1; i1++)
{
for (j1=1; j1<=n-m+1; j1++)
{
i2=i1+m-1;
j2=j1+m-1;
sum=s[i2][j2]-s[i2][j1-1]-s[i1-1][j2]+s[i1-1][j1-1];
if (sum!=fr[l])
sol[i][j]=0;
}
}
}
sum=0;
for (i=1; i<=n-m+1; i++)
{
for (j=1; j<=n-m+1; j++)
sum+=sol[i][j];
}
fout<<sum;
return 0;
}