Pagini recente » Cod sursa (job #285367) | Cod sursa (job #2833115) | Cod sursa (job #2906396) | Cod sursa (job #30752) | Cod sursa (job #1206240)
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#define MAXN 3000005
char buffer[MAXN],*s1,*s2;
int i=0,j=0,k=0,find[MAXN],N;
int min(long long k)
{
if (k<1000) return k;
return 1000;
}
int main() {
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(buffer);
s1=strdup(buffer);
gets(buffer);
s2=strdup(buffer);
N=strlen(s1);
for(i=0;i<=strlen(s2)-strlen(s1);i++)
if(strncmp(s1,s2+i,N)==0)
find[k++]=i;
printf("%d\n",k);
k=min(k);
for(i=0;i<k;i++)
printf("%d ",find[i]);
fclose(stdin);
fclose(stdout);
return 0;
}