Pagini recente » Cod sursa (job #299578) | Cod sursa (job #3190572) | Cod sursa (job #2947977) | Cod sursa (job #1914771) | Cod sursa (job #787381)
Cod sursa(job #787381)
#include<fstream>
#include<string>
using namespace std;
int pi[10000],rez=0,poz[1001];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
void prefix(string s)
{
int k=-1,n,i;
n=s.size();
pi[0]=-1;
for(i=1;i<n;i++)
{
while(k>-1 && s[k+1]!=s[i])
k=pi[k];
if(s[k+1]==s[i])
k++;
pi[i]=k;
}
}
void kmp(string S,string s)
{
int i,k=-1,m,n;
m=S.size();
n=s.size();
for(i=0;i<m;i++)
{
while(k>-1 && s[k+1]!=S[i])
k=pi[k];
if(s[k+1]=S[i])
k++;
if(k==n-1)
{
rez++;
if(rez<=1000) poz[rez]=i-n+1;
}
}
}
int main()
{
string s,S;
in>>s;
in>>S;
prefix(s);
kmp(S,s);
out<<rez;
out<<endl;
for(int i=1;i<=rez;i++)
out<<poz[i]<<" ";
return 0;
}