Cod sursa(job #2208596)

Utilizator Iulia14iulia slanina Iulia14 Data 30 mai 2018 17:12:45
Problema Potrivirea sirurilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 3.47 kb
#include <cstdio>
#include <cstring>
#include<iostream>
#define p1 666013
#define p2 673039
using namespace std;
///ifstream cin ("strmatch.in");
///ofstream cout ("strmatch.out");
char s1[2000005],s2[2000005],s[2000005];
int sol[1005];
int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    long long val,i,v,p11=1,p22=1,p33=1,p3=722369,n1,n2,val1,val2,val3,val11,val22,val33;
    ///cin>>s1+1;
    scanf("%s",s1+1);
    val1=val2=val3=val11=val22=val33=0;
    n1=strlen(s1+1);
    for (i=n1;i>=1;i--)
    {
        if (s1[i]>='0'&&s1[i]<='9')
            v=s1[i]-'0';
        else
        if (s1[i]>='A'&&s1[i]<='Z')
            v=10+s1[i]-'A';
        else
        if (s1[i]>='a'&&s1[i]<='z')
            v=36+s1[i]-'a';
        val1=(val1+(v*p11)%p1)%p1;
        val2=(val2+(v*p22)%p2)%p2;
        ///val3=(val3+(v*p33)%p3)%p3;
        p11=p11*62;
        p11=p11%p1;
        p22=p22*62;
        p22=p22%p2;
        ///p33=p33*62;
        ///p33=p33%p3;
    }
    ///cin>>s2+1;
    scanf("%s",s2+1);
    n2=strlen(s2+1);
    p11=p22=p33=1;
    ///codificare
    for (i=1;i<=n2;i++)
    {
        if (s2[i]>='0'&&s2[i]<='9')
            s[i]=s2[i]-'0';
        else
        if (s2[i]>='A'&&s2[i]<='Z')
            s[i]=s2[i]-'A'+10;
        else
        if (s2[i]>='a'&&s2[i]<='z')
            s[i]=s2[i]-'a'+36;
    }
    ///prima secventa
    for (i=n1;i>=1;i--)
    {
      /*  if (s2[i]>='0'&&s2[i]<='9')
            v=s2[i]-'0';
        else
        if (s2[i]>='A'&&s2[i]<='Z')
            v=10+s2[i]-'A';
        else
        if (s2[i]>='a'&&s2[i]<='z')
            v=36+s2[i]-'a';*/
        v=s[i];
        val11=(val11+(v*p11)%p1)%p1;
        val22=(val22+(v*p22)%p2)%p2;
        //val33=(val33+(v*p33)%p3)%p3;
        p11=p11*62;
        p11=p11%p1;
        p22=p22*62;
        p22=p22%p2;
        ///p33=p33*62;
        ///p33=p33%p3;
    }
    long long nr=0;
    if (val11==val1&&val22==val2)
    {
        nr++;
        sol[1]=0;
    }
    p11=p22=p33=1;
    i=1;
    while(i<n1)
    {
        p11=p11*62;
        p11=p11%p1;
        p22=p22*62;
        p22=p22%p2;
        /*p33=p33*62;
        p33=p33%p3;
        */
        i++;
    }
    for (i=n1+1;i<=n2;i++)
    {
       /* if (s2[i-n1]>='0'&&s2[i-n1]<='9')
            v=s2[i-n1]-'0';
        else
        if (s2[i-n1]>='A'&&s2[i-n1]<='Z')
            v=10+s2[i-n1]-'A';
        else
        if (s2[i-n1]>='a'&&s2[i-n1]<='z')
            v=36+s2[i-n1]-'a';*/
        v=s[i-n1];
        val=(v*p11)%p1;
        val11=(val11-val+p1)%p1;
        val=(v*p22)%p2;
        val22=(val22-val+p2)%p2;
        ///val=(v*p33)%p3;
        ///val33=(val33-val+p3)%p3;
       /* if (s2[i]>='0'&&s2[i]<='9')
            v=s2[i]-'0';
        else
        if (s2[i]>='A'&&s2[i]<='Z')
            v=10+s2[i]-'A';
        else
        if (s2[i]>='a'&&s2[i]<='z')
            v=36+s2[i]-'a';*/
        v=s[i];
        val11=(val11*62)%p1;
        val22=(val22*62)%p2;
        ///val33=(val33*62)%p3;
        val11=(val11+v)%p1;
        val22=(val22+v)%p2;
        ///val33=(val33+v)%p3;
        if (val11==val1&&val22==val2)
        {
            nr++;
            if (nr<=1000)
                sol[nr]=i-n1;
        }
    }
    cout<<nr<<endl;
    if (nr>1000)
    {for (i=1;i<=1000;i++)
        cout<<sol[i]<<" ";}
    else
    {
        for (i=1;i<=nr;i++)
            cout<<sol[i]<<" ";
    }
    return 0;
}