Cod sursa(job #1647082)

Utilizator Vlad_lsc2008Lungu Vlad Vlad_lsc2008 Data 10 martie 2016 18:56:37
Problema Potrivirea sirurilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <iostream>
#include <cstdio>
#include <cstring>
#define nmax 2000010
using namespace std;

char a[nmax],b[nmax];
int p[nmax],sol[1003],nrsol;

void pref(char *s,int *p)
{
    int i,k,n=strlen(s+1);
    p[1]=0; k=0;
    for(i=2;i<=n;i++)
    {
        while(k && s[k+1]!=s[i])
            k=p[k];
        if(s[k+1]==s[i])
            k++;
        p[i]=k;
    }
}

void potrivire(char *s, char *s1,int *p)
{
    int n=strlen(s+1);
    int m=strlen(s1+1);
    int k=0;
    for(int i=1;i<=m;i++)
    {
        while( k && s1[i]!=s[k+1])
            k=p[k];
        if(s1[i]==s[k+1]) k++;
        if(k==n)
            if(nrsol<1000)
            {
                nrsol++; sol[nrsol]=i-n;
            }


    }
}

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    gets(a+1);
    gets(b+1);
    pref(a,p);
    potrivire(a,b,p);
    printf("%d\n",nrsol);
    for(int i=1;i<=nrsol;i++) printf("%d ",sol[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}