Cod sursa(job #2348816)

Utilizator TheNechizFMI Razvan Birisan TheNechiz Data 20 februarie 2019 00:13:37
Problema Potrivirea sirurilor Scor 28
Compilator c-64 Status done
Runda Arhiva educationala Marime 1.35 kb
#include<stdio.h>
#define LSir 2000010
#define NMax 1024

char A[LSir],B[LSir];
int lA,lB,Urm[LSir],Apar[NMax],nApar;

void Urmatorul( char *P , int lP)
{
    int k=-1,x;
    Urm[0]=0;
    for(x=1;x<lP;x++)
    {
        while(k>0 && P[k+1]!=P[x])
            k=Urm[k];
        if(P[k+1]==P[x]) k++;
        Urm[x]=k;
    }
}
int litera( char a )
{
    return (a>='a' && a<='z')||(a>='A'&&a<='Z');
}
int LungSir( char *s )
{
    int i;
    for(i=0;s[i];i++)
        if( !litera(s[i]) )
            break;
    s[i]='\0';
    return i;
}
int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    
    int i,x=-1;
    
    fgets(A,LSir,stdin);
    fgets(B,LSir,stdin);
    lA=LungSir(A);
    lB=LungSir(B);
    Urmatorul(A,lA);
    for(i=0;i<lB;i++)
    {
        while(x>0 && A[x+1]!=B[i])
            x=Urm[x];
        if(A[x+1]==B[i])
            x++;
        if(x==lA-1)
        {
            if( nApar < 1000 )
                Apar[nApar++]=i-lA+1;
            else
                nApar++;
            
            x=Urm[x];
        }
    }
    if( nApar <= 1000 )
    {
        printf("%d\n",nApar);
        for(i=0;i<nApar;i++)
            printf("%d ",Apar[i]);
    }
    else
    {
        printf("%d\n",nApar);
        for(i=0;i<1000;i++)
            printf("%d ",Apar[i]);
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}