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