Pagini recente » Cod sursa (job #738933) | Cod sursa (job #1969545) | Cod sursa (job #1138996) | Cod sursa (job #530042) | Cod sursa (job #2099358)
#include <fstream>
#include <cstring>
using namespace std;
char a[2000002],b[2000002];
int pi[2000002],d[2000002];
int main()
{
int n,m,i,k,nr=0;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in>>a>>b;
n=strlen(a);
m=strlen(b);
for(i=n;i>=1;i--)
a[i]=a[i-1];
a[0]=' ';
for(i=m;i>=1;i--)
b[i]=b[i-1];
b[0]=' ';
k=0;
pi[1]=0;
for(i=2;i<=n;i++)
{
while(k>0&&a[i]!=a[k+1])
{
k=pi[k];
}
if(a[k+1]==a[i])
{
k++;
}
pi[i]=k;
}
k=0;
for(i=1;i<=m;i++)
{
while(k>0&&b[i]!=a[k+1])
{
k=pi[k];
}
if(b[i]==a[k+1])
{
k++;
}
if(k==n)
{
d[++nr]=i-n;
}
}
out<<nr<<"\n";
for(i=1;i<=nr;i++)
{
out<<d[i]<<" ";
}
return 0;
}