Cod sursa(job #147877)

Utilizator Sorin_IonutBYSorynyos Sorin_Ionut Data 3 martie 2008 18:00:07
Problema Potrivirea sirurilor Scor 14
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <iostream.h>
#include <fstream.h>
#include <string.h>

#define IN "strmatch.in"
#define OUT "strmatch.out"
#define maxx 2000005

ifstream fin(IN);
ofstream fout(OUT);

char a[maxx],b[maxx];
int v[maxx];
long sol;
long c,lung,lungg;
int k[1003];

int cat(char a);
void citire();
void calc();
int verif(int i);

int main()
{
 citire();
  fin.close();

 calc();

 lung=strlen(b);
 lungg=strlen(a);

 for(long i=lungg-1;i<=lung-1;i++)
  if(v[i]==c && b[i]==a[lungg-1])
   if(verif(i))
   {
    sol++;
    k[sol]=i;
   }

 int j;
 
  fout<<sol<<endl;
   for(j=1;(j<=sol && j<=1000);j++)
    fout<<k[j]<<" ";
   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(int i)
{
 long j;
 long z=lungg-1;

 for(j=i;j>=i-lungg+1;j--)
  if(b[j]!=a[z--])
   return 0;

return 1;
}

int cat(char a)
{
 return a;
}