[BZOJ2875][NOI2012]随机数生成器（矩阵乘法）

看到递推满足多次转移时系数不变，$n$较大，递推式是一阶等条件，就可以想到用矩阵乘法做。但注意两个细节：
1、除了$g$之外，所有的参数都是$10^{18}$级别的，所以不能相乘（爆long long），这时候可以用一个$\log$的代价，将乘法用加法代替，也就是说利用快速幂的思想，用“快速乘”防止爆long long。
2、矩阵乘法的过程中是取模$m$，最后的结果再次取模$g$。
代码：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, ZZQ, a, c, x0, PYZ;
ll prod(ll a, ll b) {
    ll res = 0;
    while (b) {
        if (b & 1) res = (res + a) % ZZQ;
        a = a * 2 % ZZQ;
        b >>= 1;
    }
    return res;
}
struct cyx {
    int n, m; ll v[6][6];
    cyx() {}
    cyx(int _n, int _m) :
        n(_n), m(_m) {memset(v, 0, sizeof(v));}
    friend inline cyx operator * (cyx a, cyx b) {
        int i, j, k; cyx res = cyx(a.n, b.m);
        for (i = 1; i <= res.n; i++) for (j = 1; j <= res.m; j++)
        for (k = 1; k <= a.m; k++)
            res.v[i][j] = (res.v[i][j] + prod(a.v[i][k], b.v[k][j])) % ZZQ;
        return res;
    }
    friend inline cyx operator ^ (cyx a, ll b) {
        int i; cyx res = cyx(a.n, a.m);
        for (i = 1; i <= res.n; i++) res.v[i][i] = 1;
        while (b) {
            if (b & 1) res = res * a;
            a = a * a;
            b >>= 1;
        }
        return res;
    }
} P, Q;
int main() {
    cin >> ZZQ >> a >> c >> x0 >> n >> PYZ; P = cyx(2, 2); Q = cyx(2, 1);
    P.v[1][1] = a; P.v[1][2] = c; P.v[2][2] = 1;
    Q.v[1][1] = x0; Q.v[2][1] = 1; P = (P ^ n) * Q;
    cout << P.v[1][1] % PYZ << endl;
    return 0;
}