Cod sursa(job #2497791)

Utilizator poparobertpoparobert poparobert Data 23 noiembrie 2019 11:11:35
Problema Potrivirea sirurilor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.86 kb
#include <fstream>
#include <string>
#include <vector>
#define pow 97
#define mod1 1000000007
#define mod2 1000000009
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
long long int x1=1,x2=1,mod,H1,H2,h1,h2;
vector<int>v;
string a,b;
void logpow(long long int &oof,long long int exp,long long int mod)
{
    long long int rez=1,okei=oof;
    while(exp)
    {
        if(exp%2==1)
        rez*=okei;
        rez%=mod;
        okei*=okei;
        okei%=mod;
        exp/=2;
    }
    oof=rez;
}
void afis(vector<int> v)
{
    cout<<v.size()<<'\n';
    for(int i=0;i<1000&&i<v.size();i++)
        cout<<v[i]<<' ';
}
int main()
{
    cin>>a>>b;
    for(int i=0;i<a.size();i++)
    {
        H1+=(a[a.size()-i-1]-'0'+1)*x1;
        H2+=(a[a.size()-i-1]-'0'+1)*x2;
        x1*=pow;
        x2*=pow;
        H1%=mod1;
        H2%=mod2;
        x1%=mod1;
        x2%=mod2;
    }
    x1=x2=1;
    for(int i=0;i<a.size();i++)
    {
        h1+=(b[a.size()-i-1]-'0'+1)*x1;
        h2+=(b[a.size()-i-1]-'0'+1)*x2;
        x1*=pow;
        x2*=pow;
        h1%=mod1;
        h2%=mod2;
        x1%=mod1;
        x2%=mod2;
    }
    long long int l=a.size()-1;
    x1=x2=pow;
    logpow(x1,l,mod1);
    logpow(x2,l,mod2);
    if(h1==H1&&h2==H2)
        v.push_back(0);
    for(int i=a.size();i<b.size();i++)
    {
        h1+=mod1;
        h1-=(b[i-a.size()]-'0'+1)*x1;
        h1%=mod1;
        h1*=pow;
        h1%=mod1;
        h1+=b[i]-'0'+1;
        h1%=mod1;
        h2+=mod2;
        h2-=(b[i-a.size()]-'0'+1)*x2;
        h2%=mod2;
        h2*=pow;
        h2%=mod2;
        h2+=b[i]-'0'+1;
        h2%=mod2;
        if(h1<0)
            h1+=mod1;
        if(h2<0)
            h2+=mod2;
        if(h1==H1&&h2==H2)
            v.push_back(i-a.size()+1);
    }
    afis(v);
    return 0;
}