Pagini recente » Cod sursa (job #1780604) | Cod sursa (job #2658070) | Cod sursa (job #1618804) | Monitorul de evaluare | Cod sursa (job #3328977)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,m,lps[2000001],nr,k;
char a[2000001],b[2000001],v[2000001];
void calc()
{
k=0;
for(int i=0;i<=n-1;++i)
{
while(k && a[k]!=a[i-1]) k=lps[k];
if(a[k]==a[i-1]) k++;
lps[i]=k;
}
}
void gasire()
{
k=0;
for(int i=0;i<=m-1;++i)
{
while(k && a[k]!=b[i-1]) k=lps[k];
if(a[k]==b[i-1]) k++;
if(k==n) v[++nr]==i;
}
}
void afisare()
{g<<nr<<'\n';
for(int i=1;i<=nr;++i)
g<<v[i]<<" ";
}
int main()
{
cin>>a;
cin>>b;
calc();
gasire();
return 0;
}