Pagini recente » Cod sursa (job #2960180) | Cod sursa (job #337019) | Cod sursa (job #419640) | Cod sursa (job #2554540) | Cod sursa (job #256850)
Cod sursa(job #256850)
#include <stdio.h>
#include <string.h>
#define IN "strmatch.in"
#define OUT "strmatch.out"
#define maxx 2000005
#define max2 2002
FILE *fin=fopen(IN,"r");
FILE *fout=fopen(OUT,"w");
char a[maxx],b[maxx];
long v[maxx];
long poz[max2];
long sol;
long c,lung,lungg;
void calc();
int verif(long i);
int main()
{
long long i;
fscanf(fin,"%s %s",&a,&b);
fclose(fin);
calc();
lung=strlen(b);
lungg=strlen(a);
for(i=lungg-1;i<=lung-1;i++)
if(v[i]==c && b[i]==a[lungg-1] && b[i-lungg+1]==a[0])
if(verif(i)==1)
{
if(sol<=1000)
{
sol++;
poz[sol]=i-lungg+1;
}
else
sol++;
}
fprintf(fout,"%d\n",sol);
for(i=1;i<=1000;i++)
fprintf(fout,"%d ",poz[i]);
fclose(fout);
return 0;
}
void calc()
{
long i;
long auxa=strlen(a);
long auxb=strlen(b);
c=0;
for(i=0;i<auxa;i++)
c=c+a[i];
v[0]=b[0];
for(i=1;i<auxa;i++)
v[i]=v[i-1]+b[i];
for(i=auxa;i<auxb;i++)
v[i]=v[i-1]+b[i]-b[i-auxa];
}
int verif(long i)
{
long j;
long z=lungg-1;
for(j=i;j>=i-lungg+1;j--)
if(b[j]!=a[z--])
return 0;
return 1;
}