Pagini recente » Cod sursa (job #1401099) | Cod sursa (job #1518178) | Cod sursa (job #2536063) | Cod sursa (job #2496494) | Cod sursa (job #1487925)
#include<fstream>
#include<cstring>
using namespace std;
int n, m, i, L, p[2000003], nrsol, sol[1003];
char a[2000003], b[2000003];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main()
{
in>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
for(i=2; i<=n; i++)
{
while(L!=0 && a[i]!=a[L+1])
L=p[L];
if(a[i]==a[L+1])
L++;
p[i]=L;
}
L=0;
for(i=1; i<=m; i++)
{
while(L!=0 && b[i]!=a[L+1])
L=p[L];
if(b[i]==a[L+1])
{
L++;
if(L==n){
L=p[L];
nrsol++;
if(nrsol<1001)
sol[nrsol]=i-n;
}
}
}
out<<nrsol<<"\n";
for(i=1; i<=min(nrsol, 1000); i++)
out<<sol[i]<<" ";
return 0;
}