Pagini recente » Cod sursa (job #2131989) | Cod sursa (job #2493673) | Cod sursa (job #889822) | Cod sursa (job #830457) | Cod sursa (job #3000559)
#include <fstream>
#include <cstring>
#include <iostream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n , m , l , v[2000005] , p[2000005] , q , cnt = 0, k;
char a[2000005] , b[2000005];
int main()
{
f >> (a + 1);
f >> (b + 1);
n = strlen(a + 1);
m = strlen(b + 1);
p[1] = 0;
q = 0;
for ( int i = 2 ; i <= n ; i++)
{
while(q > 0 && a[q + 1] != a[i]);
q = p[q];
if(a[q + 1] == a[i])
q++;
p[i] = q;
}
q = 0;
for (int i = 1 ; i <= m ; i++)
{
while(q > 0 && a[q + 1] != b[i])
q = p[q];
if(a[q + 1] == b[i])
q++;
if(q == n)
{
cnt++;
if(cnt <= 1000)
{
k++;
v[k] = i - n;
}
}
}
g << cnt << '\n';
for ( int i = 1 ; i <= k ; i++)
{
g << v[i] << " ";
}
return 0;
}