Pagini recente » Cod sursa (job #2348406) | Cod sursa (job #417092) | Cod sursa (job #327754) | Cod sursa (job #967696) | Cod sursa (job #3240535)
#include<fstream>
using namespace std;
ifstream F("strmatch.in");
ofstream G("strmatch.out");
#define Z 4096
int n,i,k,q,t,p[2000001],c[1000],r=Z;
string a,b;
char s[Z];
inline char A()
{
if(r==Z)
F.read(s,Z),r=0;
return s[r++];
}
string B()
{
char c;
string s="";
for(c=A();c!='\n';s+=c,c=A());
return s;
}
int main()
{
for(a=B(),b=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(i=1;b[i];++i) {
for(;q&&a[q+1]!=b[i];q=p[q]);
if(a[q+1]==b[i])
++q;
if(q==n-1&&a[0]==b[i-n+1])
t<1000?c[t++]=i-n+1:++t;
}
for(G<<t<<'\n',i=0;i<min(t,1000);G<<c[i++]<<' ');
return 0;
}