Pagini recente » Cod sursa (job #227982) | Cod sursa (job #1230954) | Cod sursa (job #2289333) | Cod sursa (job #2747339) | Cod sursa (job #1226595)
#include <fstream>
#include<string>
using namespace std;
#define MX 2000010
ifstream f1("strmatch.in");
ofstream f2("strmatch.out");
string a,b;
int pi[MX], k, i, n,m, ns, sol[MX] ;
int main()
{
f1>>a>>b;
n=a.length();
m=b.length();
a=' '+a;
b=' '+b;
k=0;
pi[1]=0;
for (i=2; i<=n; i++ )
{ while (k>0 && a[k+1]!=a[i] )
k=pi[k];
if (a[k+1]==a[i] )
k++;
pi[i]=k; }
k=0;
for (i=1; i<=m ; i++)
{ while (k>0 && a[k+1]!=b[i] )
k=pi[k];
if (a[k+1]==b[i] )
k++;
if (k==n)
sol[++ns]=i-n;
}
f2<<ns<<"\n";
for (i=1; i<=ns && i<=1000; i++)
f2<<sol[i]<<" ";
f2.close();
return 0;
}