Pagini recente » Cod sursa (job #679672) | Cod sursa (job #123257) | Cod sursa (job #225850) | Cod sursa (job #3168075) | Cod sursa (job #218370)
Cod sursa(job #218370)
#include <cstdio>
#include <cstring>
#define MAXIMUS 2000002
using namespace std;
char s[MAXIMUS],s1[MAXIMUS];
int nr,poz[MAXIMUS],k,sol[1001],zz;
void pref(char s[])
{
for(unsigned int i=1;i<strlen(s);i++)
{
while(k && s[k]!=s[i])
k=poz[k];
if(s[k]==s[i])
k++;
poz[i+1]=k;
}
}
void cauta()
{
k=0;
for(unsigned int i=0;i<strlen(s1);i++)
{
while(k && s[k]!=s1[i])
k=poz[k];
if(s[k]==s1[i])
k++;
if(k==strlen(s))
{
nr++;
if(zz<1000)
sol[zz++]=i-strlen(s)+1;
k=poz[k];
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n%s",s,s1);
pref(s);
cauta();
printf("%d\n",nr);
for(int i=0;i<zz;i++)
printf("%d ",sol[i]);
fclose(stdin);
fclose(stdout);
return 0;
}