Pagini recente » Cod sursa (job #2644053) | Cod sursa (job #636572) | Cod sursa (job #2456694) | Cod sursa (job #81509) | Cod sursa (job #2435480)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream fi("strmatch.in" );
ofstream fo("strmatch.out");
char a[25];
char b[25];
int l[25];
int n,m;
int nr;
void cit()
{
fi>>a>>b;
n=strlen(a);
m=strlen(b);
}
void lps()
{
int i,j;
while(j<n)
{
if(a[i]==a[j])
{
i++;
l[j]=i;
j++;
}
else
if(i!=0)
i=l[i-1];
else
{
l[j]=0;
j++;
}
}
}
void kmp()
{
int i,j;
i=j=0;
while(i<m)
{if(b[i]==a[j])
{i++;
j++;}
if(j==n)
{
nr++;
cout<<i-j<<" ";
j=l[j-1];
}
else
if(i<m&&a[j]!=b[i])
{
if(j!=0)
j=l[j-1];
else
i++;
}}
cout<<endl<<nr;
}
int main()
{
cit();
cout<<a<<" "<<b;
for(int i=0;i<n;i++)
cout<<l[i]<<" ";
cout<<'\n';
lps();
kmp();
return 0;
}