Pagini recente » Cod sursa (job #3121367) | Cod sursa (job #2107106) | Cod sursa (job #125205) | dpg1 | Cod sursa (job #1471026)
#include<stdio.h>
#include<string.h>
char s[2000005],u[2000005];
int v[1005],i,t,k,m,n,j,p[2000005],q;
int main() {
freopen("strmatch.in","r",stdin),freopen("strmatch.out","w",stdout),gets(s),gets(u);
for(;(s[m]>='0'&&s[m]<='9')||(s[m]>='a'&&s[m]<='z')||(s[m]>='A'&&s[m]<='Z');m++);
for(;(u[n]>='0'&&u[n]<='9')||(u[n]>='a'&&u[n]<='z')||(u[n]>='A'&&u[n]<='Z');n++);
for(i=m;i;i--)
s[i]=s[i-1];
for(i=n;i;i--)
u[i]=u[i-1];
s[0]=u[0]=' ';
for(i=2;i<=m;i++) {
for(;k&&s[k+1]!=s[i];k=p[k]);
if(s[k+1]==s[i])
k++;
p[i]=k;
}
for(j=1;j<=n;j++) {
for(;q&&s[q+1]!=u[j];q=p[q]);
if(s[q+1]==u[j])
q++;
if(q==m) {
if(t<1000)
v[t]=j-m;
q=p[m],t++;
}
}
printf("%d\n",t);
for(i=0;i<(t<1000?t:1000);i++)
printf("%d ",v[i]);
}