HDU1588-Gauss Fibonacci (Rapid power of matrix + binary sum of proportional series)

Question Link

G (x) = K * x + B. F (x) is a series of Fibonacci. Evaluate F (g (x), sum the sum of numbers from x = 1 to n, and Modulo M.

Ideas:
Set a = | (1, 1), (1, 0) |
Sum = F (B) + f (K + B) + F (2 k + B )... + f (n-1) K + B) (f (x) is a Fibonacci series)
Sum = a ^ B + A ^ (K + B) + A ^ (2 k + B)... + A ^ (n-1) K + B)
Sum = a ^ B (1 + a ^ K + A ^ 2 k... + A ^ (n-1) K)
Therefore, a ^ B and a ^ K can be quickly solved using a matrix power.
Then you can set B = a ^ K
So the formula can be converted to sum = a ^ B (1 + B + B ^ 2 .. + B ^ (n-1 ))
Sum is used to solve the problem.

Code:

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;//typedef long long ll;typedef __int64 ll;const int N = 2;struct mat{    ll s[N][N];    mat(ll a = 0, ll b = 0, ll c = 0, ll d = 0) {        s[0][0] = a;        s[0][1] = b;        s[1][0] = c;        s[1][1] = d;    }     mat operator * (const mat& c) {         mat ans;         memset(ans.s, 0, sizeof(ans.s));        for (int i = 0; i < N; i++)            for (int j = 0; j < N; j++)                ans.s[i][j] = (s[i][0] * c.s[0][j] + s[i][1] * c.s[1][j]);        return ans;    }    mat operator % (int mod) {        for (int i = 0; i < N; i++)            for (int j = 0; j < N; j++)                s[i][j] %= mod;         return *this;    }    mat operator + (const mat& c) {        mat ans;         memset(ans.s, 0, sizeof(ans.s));        for (int i = 0; i < N; i++)            for (int j = 0; j < N; j++)                ans.s[i][j] = s[i][j] + c.s[i][j];        return ans;     }    void put() {        for (int i = 0; i < N; i++) {            for (int j = 0; j < N; j++)                printf("%I64d ", s[i][j]);            printf("\n");        }     }}c(1, 1, 1, 0), tmp(1, 0, 0, 1);ll k, b, n, M;mat pow_mod(int n, mat c) {    if (n == 0)        return tmp;    if (n == 1)        return c;    mat a = pow_mod(n / 2, c);    mat ans = a * a % M;    if (n % 2)        ans = ans * c % M;    return ans;}mat sum(int n, mat a) {    if (n == 1)        return a;    if (n & 1)        return (pow_mod(n, a) + sum(n - 1, a)) % M;     else        return (((pow_mod(n / 2, a) + tmp) % M) * sum(n / 2, a) % M);}int main() {    while (scanf("%I64d%I64d%I64d%I64d", &k, &b, &n, &M) != EOF) {        mat A = pow_mod(b, c);         mat B = pow_mod(k, c);         mat C = sum(n - 1, B) + tmp;        C = C * A;        printf("%I64d\n", C.s[0][1] % M);    }    return 0;}

HDU1588-Gauss Fibonacci (Rapid power of matrix + binary sum of proportional series)