Pagini recente » Cod sursa (job #2161218) | Cod sursa (job #2592974) | Cod sursa (job #2198036) | daupentrumata | Cod sursa (job #974346)
Cod sursa(job #974346)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[200005],b[200005];
int t[200005],sol[1001];
int main()
{
f.getline(a,200005);
f.getline(b,200005);
int res=0;
t[0]=-1;
int k=0,n=strlen(a),m=strlen(b),min1;
for(int j=1;j<n;j++)
{
while(k&&a[j]!=a[k])
k=t[k-1];
if(a[j]==a[k])
k++;
t[j] = k;
}
k=0;
for(int i=0;i<m;i++)
{
while(k&&b[i]!=a[k])
k=t[k-1];
if(b[i]==a[k])
k++;
if(k==n)
{
if(res<1000)
sol[res]=i-n+1;
res++;
k=t[k-1];
}
}
min1=min(res,1000);
g<<res<<"\n";
for(int i=0;i<min1;i++)
g<<sol[i]<<" ";
return 0;
}