Pagini recente » Cod sursa (job #2495428) | Istoria paginii runda/delay/clasament | simulare_oji2015 | Istoria paginii runda/a2cos12min2003/clasament | Cod sursa (job #1857580)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005],b[2000005];
int lga,lgb,i,p[2000005],pos,n,x,t[1005];
int main()
{
f>>(a+1)>>(b+1);
lga=strlen(a+1);
lgb=strlen(b+1);
x=0;
for (i = 2; i <= lga; ++i)
{
while (x && a[x+1] != a[i])
x = p[x];
if (a[x+1] == a[i])
++x;
p[i] = x;
}
// g<<p[3];
x=0;
for(i=1;i<=lgb;i++)
{ while (x && a[x+1] != b[i])
x = p[x];
if (a[x+1] == b[i])
++x;
if(x==lga){ x=p[lga];
n++;
if (n <= 1000)
t[n] = i-lga;
}
}
g<<n<<'\n';
for(i=1;i<=n;i++)
g<<t[i]<<" ";
}