generator 1

https://ac.nowcoder.com/acm/contest/885/B

总结：十进制快速幂 

坑：加多一个矩阵乘法mod会tle；

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;

#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;

ll x0,x1,a,b,mod;
char n[maxn];

struct matrix
{
    ll mat[2][2];
    void init()
    {
        mat[0][1]=mat[1][0]=0;
        mat[0][0]=mat[1][1]=1;
    }
};

matrix multi(matrix a, matrix b)
{
    matrix ret;
    for(int i=0; i<2; i++)
    {
        for(int j=0; j<2; j++)
        {
            ret.mat[i][j]=0;
            for(int k=0; k<2; k++)
            {
                ret.mat[i][j] = (ret.mat[i][j]+a.mat[i][k]*b.mat[k][j]) % mod;
            }
        }
    }
    return ret;
}

matrix Mpower(matrix temp, ll b)
{
    matrix ret;
    ret.init();
    while(b)
    {
        if(b&1)
            ret = multi(ret, temp);
        temp = multi(temp, temp);
        b >>= 1;
    }
    return ret;
}

int main()
{
    scanf("%lld %lld %lld %lld", &x0, &x1, &a, &b);
    scanf("%s", n);
    scanf("%lld", &mod);

    matrix x;
    x.mat[0][0] = a;
    x.mat[0][1] = b;
    x.mat[1][0] = 1;
    x.mat[1][1] = 0;

    matrix ans;
    ans.init();
    int len=strlen(n);
    for(int i=len-1; i>=0; i--)
    {
        int num=n[i]-'0';
        //for(int j=0;j<num;j++) ans=multi(ans,x);
        //matrix tmp;
        //tmp.init();
        //for(int j=1;j<=10;j++) tmp=multi(x,tmp);
        //x=tmp;

        ans=multi(ans,Mpower(x,num));
        x=Mpower(x,10);
    }

    ll sum = (ans.mat[1][0] * x1 % mod + ans.mat[1][1] * x0 % mod) % mod;
    printf("%lld\n", sum );
    return 0;
}