2019 牛客多校第五场 B generator 1

题目链接：https://ac.nowcoder.com/acm/contest/885/B

题目大意

　　略。

分析

　　十进制矩阵快速幂。

代码如下

#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // ?? x ?????? c 
#define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
#define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,inf,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}

template<typename T>
ostream &operator<<(ostream &out, vector<T> &v) {
    Rep(i, v.size()) out << v[i] << " 
"[i == v.size()];
    return out;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "
";
    return out;
}

inline int gc(){
    static const int BUF = 1e7;
    static char buf[BUF], *bg = buf + BUF, *ed = bg;
    
    if(bg == ed) fread(bg = buf, 1, BUF, stdin);
    return *bg++;
} 

inline int ri(){
    int x = 0, f = 1, c = gc();
    for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
    for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
    return x*f;
}

template<class T>
inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}

inline int toInt(string s) {
    int v;
    istringstream sin(s);
    sin >> v;
    return v;
}

//min <= aim <= max
template<typename T>
inline bool BETWEEN(const T aim, const T min, const T max) {
    return min <= aim && aim <= max;
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< int, PII > PIPII;
typedef pair< string, int > PSI;
typedef pair< int, PSI > PIPSI;
typedef set< int > SI;
typedef set< PII > SPII;
typedef vector< int > VI;
typedef vector< double > VD;
typedef vector< VI > VVI;
typedef vector< SI > VSI;
typedef vector< PII > VPII;
typedef vector< LL > VLL;
typedef vector< VLL > VVLL;
typedef map< int, int > MII;
typedef map< int, string > MIS;
typedef map< int, PII > MIPII;
typedef map< PII, int > MPIII;
typedef map< string, int > MSI;
typedef map< string, string > MSS;
typedef map< PII, string > MPIIS;
typedef map< PII, PII > MPIIPII;
typedef multimap< int, int > MMII;
typedef multimap< string, int > MMSI;
//typedef unordered_map< int, int > uMII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-8;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
LL mod = 1e9 + 7;
const int maxN = 1e6 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

struct Matrix{
    LL mat[2][2];
    
    Matrix() { ms0(mat); }
    
    // 单位阵 
    inline void E() {
        mat[1][0] = mat[0][1] = 0;
        mat[0][0] = mat[1][1] = 1;
    }
    
    inline Matrix operator* (const Matrix &x) {
        Matrix ret;
        
        Rep(k, 2) {
            Rep(i, 2) {
                if(mat[i][k] == 0) continue;
                Rep(j, 2) {
                    ret.mat[i][j] += mat[i][k] * x.mat[k][j];
                    ret.mat[i][j] %= mod;
                }
            }
        }
        return ret;
    }
};

LL x0, x1, a, b;
char N[maxN];
Matrix base;

// 矩阵快速幂，计算x^y 
inline Matrix mat_pow_mod(Matrix x, LL y) {
    Matrix ret;
    ret.E();
    while(y){
        if(y & 1) ret = ret * x;
        x = x * x;
        y >>= 1;
    }
    return ret;
}

int main(){
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    //INIT();
    scanf("%lld%lld%lld%lld", &x0, &x1, &a, &b);
    scanf("%s%lld", N, &mod);
    
    base.mat[0][0] = a;
    base.mat[0][1] = 1;
    base.mat[1][0] = b;
    base.mat[1][1] = 0;
    
    Matrix ret;
    ret.E();
    
    rFor(i, strlen(N) - 1, 0) {
        ret = ret * mat_pow_mod(base, N[i] - '0');
        base = mat_pow_mod(base, 10);
    }
    
    printf("%lld
", (x1 * ret.mat[0][1] + x0 * ret.mat[1][1]) % mod);
    return 0;
}