Pagini recente » Cod sursa (job #1133085) | Cod sursa (job #2491043) | Cod sursa (job #121105) | Cod sursa (job #2169183) | Cod sursa (job #241318)
Cod sursa(job #241318)
#include <iostream.h>
#include <fstream.h>
#include <string.h>
#define IN "strmatch.in"
#define OUT "strmatch.out"
#define maxx 2000005
#define max2 2002
ifstream fin(IN);
ofstream fout(OUT);
char a[maxx],b[maxx];
long v[maxx];
long poz[max2];
long sol;
long c,lung,lungg;
inline int cat(char a);
void citire();
void calc();
int verif(long i);
int main()
{
long long i;
citire();
fin.close();
calc();
lung=strlen(b);
lungg=strlen(a);
for(i=lungg-1;i<=lung-1;i++)
if(v[i]==c && b[i]==a[lungg-1])
if(verif(i))
{
sol++;
if(sol<2000)
poz[sol]=i-lungg+1;
}
fout<<sol<<endl;
if(sol>1000)
sol=1000;
for(i=1;i<=sol;i++)
fout<<poz[i]<<" ";
fout.close();
return 0;
}
void citire()
{
fin>>a>>b;
}
void calc()
{
long i;
long auxa=strlen(a);
long auxb=strlen(b);
c=0;
for(i=0;i<auxa;i++)
c=c+cat(a[i]);
v[0]=cat(b[0]);
for(i=1;i<auxa;i++)
v[i]=v[i-1]+cat(b[i]);
for(i=auxa;i<auxb;i++)
v[i]=v[i-1]+cat(b[i])-cat(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;
}
inline int cat(char a)
{
return a;
}