Pagini recente » Cod sursa (job #1753390) | Cod sursa (job #10754) | Cod sursa (job #291460) | Cod sursa (job #1874193) | Cod sursa (job #1772061)
#include <iostream>
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
int p[2000100],d[2000100],k,i,m,n,nr;
char a[2000100],b[2000100];
vector<int>s;
int main()
{
ifstream f("strmatch.in");
f>>(a+1)>>(b+1);
f.close();
n=strlen(a+1);m=strlen(b+1);
k=0;p[1]=0;
for(i=2;i<=n;++i)
{
while(k>0&&a[k+1]!=a[i])k=p[k];
if(a[k+1]==a[i])++k;
p[i]=k;
}
k=0;nr=0;--n;++m;
for(i=1;i<m;++i)
{
while(k>0&&a[k+1]!=b[i])k=p[k];
if(a[k+1]==b[i])++k;
d[i]=k;
if(k>n)
{
s.push_back(i);
}
}
k=s.size();
ofstream g("strmatch.out");
g<<k<<'\n';
k=min(1000,k);
for(i=1;i<k;++i)
{
nr=s[i]-n-1;g<<nr<<" ";
}
g.close();
return 0;
}