bzoj2875 [Noi2012]随机数生成器 [矩阵+快乘]

http://www.lydsy.com/JudgeOnline/problem.php?id=2875

Description

给出$a,c,g,mod,x0,n,x_n=(a*x_{n-1}+c)%mod$,求$x_n\%g$

Input

包含6个用空格分割的m,a,c,X0,n和g，其中a,c,X0是非负整数，m,n,g是正整数。

Output

输出一个数，即Xn mod g

Sample Input

11 8 7 1 5 3

Sample Output

2

Solution

比较裸。

#include <bits/stdc++.h>

const int MAXN = 5;

using namespace std;

long long m, a, c, x0, n, g;
struct matrix {
    long long x, y;
    matrix() {}
    matrix(long long a, long long b) : x(a), y(b) {}
}origin;

long long mult(long long a, long long b) {
    long long ans = 0;
    while (b) {
        if (b & 1) ans = (ans + a) % m;
        a = (a + a) % m;
        b >>= 1;
    }
    return ans;
}

inline matrix operator * (matrix a, matrix b) {
    return matrix(mult(a.x, b.x), (mult(a.x, b.y) + a.y) % m);
}

inline matrix pow(matrix a, long long x) {
    matrix res = a;
    x--;
    while (x) {
        if (x & 1) {
            res = res * a;
        }
        x >>= 1;
        a = a * a;
    }
    return res;
}

int main() {
    scanf("%lld %lld %lld %lld %lld %lld", &m, &a, &c, &x0, &n, &g);
    origin = matrix(a, c);
    origin = pow(origin, n);
    printf("%lld\n", (mult(origin.x, x0) + origin.y) % m % g);
    return 0;
}