Pagini recente » Cod sursa (job #2800179) | Cod sursa (job #1328002) | Cod sursa (job #2408896) | Cod sursa (job #1560499) | Cod sursa (job #1316520)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char P[2000003];
char T[2000003];
int urm[2000003];
int rez,depl[1001];
int n,m;
void urmatorul(char *P)
{
//m = lungimea modelului
int x,k=-1;
urm[0]=0;
for(x=1;x<m;++x)
{
while(k>0 && P[k+1]!=P[x]) k=urm[k];
if(P[k+1]==P[x]) ++k;
urm[x]=k;
}
}
int main()
{
f.getline(P,2000003); m=strlen(P);
f.getline(T,2000003); n=strlen(T);
urmatorul(P);
int x=-1,i;
for(i=0;i<n;++i)
{
while(x>0 && P[x+1]!=T[i]) x=urm[x];
if(P[x+1]==T[i]) ++x;
if(x==m-1 && rez<1000) //daca am gasit tot modelul in text
{
++rez;
depl[rez]=i-m+1;
}
}
g<<rez<<'\n';
for(i=1;i<=rez;++i) g<<depl[i]<<" ";
return 0;
}