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