Pagini recente » Cod sursa (job #2435071) | Cod sursa (job #1837849) | Cod sursa (job #2858868) | Cod sursa (job #298814) | Cod sursa (job #1650531)
#include<fstream>
#include<cstring>
using namespace std;
int n, m, i, L, p[2000005], sol[1005], nrap;
char a[2000005], b[2000005];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main()
{
in>>a+1;
in>>b+1;
n=strlen(a+1);
m=strlen(b+1);
for(i=2; i<=n; i++)
{
while(L!=0 && a[L+1]!=a[i])
L=p[L];
if(a[L+1]==a[i])
L++;
p[i]=L;
}
L=0;
for(i=1; i<=m; i++)
{
while(L!=0 && a[L+1]!=b[i])
L=p[L];
if(a[L+1]==b[i])
L++;
if(L==n)
{
nrap++;
if(nrap<=1000)
sol[nrap]=i-n;
L=p[L];
}
}
out<<nrap<<"\n";
for(i=1; i<=nrap; i++)
out<<sol[i]<<" ";
return 0;
}