Pagini recente » Cod sursa (job #2042839) | Cod sursa (job #1378834) | Cod sursa (job #3230637) | Cod sursa (job #193319) | Cod sursa (job #477774)
Cod sursa(job #477774)
#include <fstream>
using namespace std;
int n, m;
char a[1005][1005], vax[1005];
short s[1005][1005][26];
int tot, frv[26], fr[26];
bool cmp()
{
for (int i = 0; i < 26; ++i)
if (fr[i] != frv[i])
return false;
return true;
}
int main()
{
ifstream fin("matrix.in");
ofstream fout("matrix.out");
fin >> n >> m;
fin.getline(a[0], 1002);
for (int i = 1; i <= n; ++i)
{
fin.getline(a[i], 1002);
for (int j = 0; j < n; ++j)
{
for (int k = 0; k < 26; ++k)
s[i][j + 1][k] = s[i - 1][j + 1][k] + s[i][j][k] - s[i - 1][j][k];
++s[i][j + 1][a[i][j] - 'a'];
}
}
for (int i = 1; i <= m; ++i)
{
fin.getline(vax, 1002);
for (int j = 0; j < m; ++j)
++frv[vax[j] - 'a'];
}
for (int i = m; i <= n; ++i)
for (int j = m; j <= n; ++j) // COR = s[i][j] - s[i - m][j] - s[i][j - m] + [i - m][j - m]
{
for (int k = 0; k < 26; ++k)
fr[k] = s[i][j][k] - s[i - m][j][k] - s[i][j - m][k] + s[i - m][j - m][k];
if (cmp()) ++tot;
}
fout << tot;
fin.close();
fout.close();
}