Pagini recente » Cod sursa (job #1293478) | Istoria paginii runda/smunteanu_oji_2020_cl10/clasament | Cod sursa (job #2014728) | Istoria paginii runda/test_78/clasament | Cod sursa (job #1628298)
#include <iostream>
#include <cstdio>
#include <cstring>
#define nmax 2000010
using namespace std;
char a[nmax],b[nmax];
int pref[nmax],sol[1003],nrsol;
void prefix(char *s,int *p)
{
int n=strlen(s+1);
int k=0;
p[1]=0;
for(int i=2;i<=n;i++)
{
while( k>0 && s[k+1]!=s[i])
k=p[k];
if(s[i]==s[k+1]) k++;
p[i]=k;
}
}
void ver(char *s,char *s1,int *p)
{
int n=strlen(s+1);
int m=strlen(s1+1);
int k=0;
p[1]=0;
for(int i=1;i<=m;i++)
{
while(k>0 && s[k+1]!=s1[i])
k=p[k];
if(s1[i]==s[k+1]) k++;
if(k==n)
{
nrsol++;
if(nrsol<=1000) sol[nrsol]=i-n;
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(a+1);
gets(b+1);
prefix(a,pref);
ver(a,b,pref);
printf("%d\n",nrsol);
for(int i=1;i<=nrsol;i++)
{
if(i>1000) break;
printf("%d ",sol[i]);
} cout<<'\n';
fclose(stdin);
fclose(stdout);
return 0;
}