Pagini recente » Cod sursa (job #15762) | Cod sursa (job #2979985) | Cod sursa (job #2186898) | Cod sursa (job #1134067) | Cod sursa (job #2886951)
#include <fstream>
#include <string>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
string a, b;
int p[4000001];
int main()
{
int n, m, i, j, rasp[1001] = {};
fin >> a >> b;
n = a.size();
m = b.size();
a = a + "#" + b;
for (i = 1; i<=n+m; i++)
{
j = p[i-1];
while (j > 0 && a[i] != a[j])
j = p[j-1];
if (a[i] == a[j])
j++;
p[i] = j;
if (p[i] == n)
{
rasp[0]++;
if (rasp[0] <= 1000)
rasp[rasp[0]] = i-2*n;
}
}
fout << rasp[0] << '\n';
for (i = 1; i<=min (rasp[0], 1000); i++)
fout << rasp[i] << ' ';
return 0;
}