Pagini recente » Cod sursa (job #2265321) | Cod sursa (job #1878651) | Cod sursa (job #1766038) | Cod sursa (job #2098285) | Cod sursa (job #3121921)
#include<fstream>
using namespace std;
ifstream F("strmatch.in");
ofstream G("strmatch.out");
string a,b;
int n,i,k,p[2000000],t,v[1000];
int main()
{
for(F>>a>>b,n=a.size(),i=2;i<n;p[i++]=k) {
for(;k&&a[k+1]!=a[i];k=p[k]);
if(a[k+1]==a[i])
++k;
}
for(k=0,i=1;b[i];++i) {
for(;k&&a[k+1]!=b[i];k=p[k]);
if(a[k+1]==b[i])
++k;
if(k==n-1&&a[0]==b[i-k])
t<1000?v[t++]=i-k:++t;
}
for(G<<t<<'\n',i=0;i<min(1000,t);G<<v[i++]<<' ');
return 0;
}