Cod sursa(job #629479)

Utilizator cat_red20Vasile Ioana cat_red20 Data 3 noiembrie 2011 13:58:21
Problema Potrivirea sirurilor Scor 14
Compilator cpp Status done
Runda Arhiva educationala Marime 2.29 kb
#include<stdio.h>
#include<string.h>
#define p 666013
#include<vector>
using namespace std;
char a[2000001],b[2000001];
const int B=67;
int pow[2000001];
int la,nrSol,lb;
FILE *fin,*fout;
vector <int> v;
void citire()
{
    fin=fopen("strmatch.in","r");
    fscanf(fin,"%s\n%s",a,b);
}
void initializare(int n)
{
    pow[0]=1;
    for(int i=1;i<=n;i++)
    {
        pow[i]=pow[i-1]*B;
        pow[i]=pow[i]%p;
    }
}

int transformare(char s[])
{
    int nr=0;
    for(int i=0;i<=strlen(s);i++)
    {
        if('a'<=s[i] && s[i]<='z')
        {
            nr+=(((s[i]-'a')%p)*pow[i])%p;
        }
        else
        if('0'<=s[i] && s[i]<='9')
        {
            nr+=(((s[i]-'0'+27)%p)*pow[i])%p;
        }
        else
        if('A'<=s[i] && s[i]<='Z')
        {
            nr+=(((s[i]-'0'+37)%p)*pow[i])%p;
        }
        nr=nr%p;
    }
    return nr;
}


void solutie(int poz)
{
    nrSol++;
    if(nrSol<=1000)
    v.push_back(poz);
}

void verifica( char s[] , char ss[] , int poz )
{
    if(strlen(s)!=strlen(ss))
    {
        return;
    }
    for(int i=0;i<=strlen(s)-1;i++)
    {
        if(s[i]!=ss[i])
        {
            return;
        }
    }
    solutie(poz);
}

void afisare()
{
    fout=fopen("strmatch.out","w");
    fprintf(fout,"%d\n",nrSol);
    for(vector<int>:: iterator it=v.begin();it!=v.end();it++)
    {
        fprintf(fout,"%d ",*it);
    }
}

int main()
{
    citire();
    la=strlen(a);
    lb=strlen(b);
    initializare(strlen(b));
    int nra=transformare(a);
    printf("%d \n",nra);
    int x;
    char c[2000001];
    strncpy(c,b,la);
    int nrb=transformare(c);
    for(int i=1;i<=lb-la+1;i++)
    {
        printf("%d ",nrb);
        if(nrb==nra)
        {
            verifica(a,c,i);
        }
        if('a'<=b[i-1] && b[i-1]<='z')
        {
            x=(((b[i-1]-'a')%p)*pow[la])%p;
        }
        else
        if('0'<=b[i-1] && b[i-1]<='9')
        {
            x=(((b[i]-'0'+27)%p)*B*pow[la])%p;
        }
        else
        if('A'<=b[i] && b[i]<='Z')
        {
            x=(((b[i]-'0'+37)%p)*pow[la])%p;
        }
        x=x%p;
        nrb+=p;
        nrb-=x;
        nrb=(nrb*B)%p;
        nrb+=a[i+la];
    }
    afisare();
    return 0;
}