Pagini recente » Cod sursa (job #135863) | Cod sursa (job #2868937) | Cod sursa (job #674739) | Cod sursa (job #721024) | Cod sursa (job #1745569)
#include <bits/stdc++.h>
#define nmax 2000002
#define pb push_back
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[nmax],b[nmax];
int n,m,i,k,j;
int pi[nmax],f;
vector<int>sol;
void prefix()
{
k=0;
pi[1]=0;
for(i=2;i<=n;i++)
{
while(k && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])k++;
pi[i]=k;
}
}
int main()
{
fin>>(a+1)>>(b+1);
n=strlen(a+1);
m=strlen(b+1);
prefix();
k=0;
for(i=1;i<=m;i++)
{
while(k && a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i])k++;
if(k==n)
{
f++;
if(sol.size()<1000)sol.pb(i-k);
}
}
fout<<f<<"\n";
for(i=0;i<sol.size();i++)fout<<sol[i]<<" ";
return 0;
}