Pagini recente » Cod sursa (job #1166037) | Cod sursa (job #1802067) | Cod sursa (job #575360) | Cod sursa (job #2358978) | Cod sursa (job #2315781)
#include <fstream>
#include <cstring>
using namespace std;
char a[2000002],b[2000002];
int pi[2000002],d[2000002];
int main()
{
int n,m,i,k,c;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
k=0;
for(i=2;i<=n;i++)
{
while(a[i]!=a[k+1]&&k>0)
{
k=pi[k];
}
if(a[i]==a[k+1])
{
k++;
}
pi[i]=k;
}
c=0;
k=0;
for(i=1;i<=m;i++)
{
while(b[i]!=a[k+1]&&k>0)
{
k=pi[k];
}
if(b[i]==a[k+1])
{
k++;
}
d[i]=k;
if(k==n)
c++;
}
out<<c<<"\n";
c=min(c,1000);
for(i=1;i<=m;i++)
{
if(d[i]==n&&c>0)
{
c--;
out<<i-n<<" ";
}
}
return 0;
}