Pagini recente » Cod sursa (job #705884) | Cod sursa (job #2009443) | Cod sursa (job #1413764) | Cod sursa (job #437940) | Cod sursa (job #2298386)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,m;
char s[2000001],s1[2000001];
int pi[2000001],v[2001],k,i,d[2000001],nr;
int main()
{
f.getline(s,2000001);
f.getline (s1,2000001);
n=strlen(s);
pi[0]=0;
k=0;
for (i=1;i<n;i++)
{
k=pi[i-1];
while (k>0&&(s[i]!=s[k]))
{
k=pi[k-1];
}
if (s[i]==s[k])
{
k=k+1;
}
pi[i]=k;
}
m=strlen(s1);
d[i]=0;
k=0;
for (i=1;i<m;i++)
{
k=d[i-1];
while (k>0&&(s1[i]!=s[k]))
{
k=pi[k-1];
}
if (s1[i]==s[k])
{
k=k+1;
}
d[i]=k;
}
for (i=0;i<m;i++)
{
if (d[i]==n)
{
nr++;
if (nr<=1000)
{
v[nr]=i;
}
}
}
g<<nr<<'\n';
for (i=1;i<=min(nr,1000);i++)
{
g<<v[i]-n+1<<' ';
}
return 0;
}