2019牛客暑期多校训练营（第五场）----B- generator 1

首先发出题目链接：
链接：https://ac.nowcoder.com/acm/contest/885/B
来源：牛客网
涉及：十进制矩阵快速幂

点击这里回到2019牛客暑期多校训练营解题—目录贴

---

题目如下：



代码如下：

#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 2e5+5;
ll mod;
ll x0, x1, a, b;
string n;
struct Max{
    ll a[5][5];
    Max operator*(const Max &m){
        Max M;
        for(int i = 1; i <= 2; i++){
            for(int j = 1; j <= 2; j++){
                ll sum = 0;
                for(int k = 1; k <= 2; k++){
                    sum = (sum + this->a[i][k] * m.a[k][j] % mod) % mod;
                }
                M.a[i][j] = sum;
            }
        }
        return M;
    }
    Max(){
        this->a[1][1] = this->a[2][2] = 1;
        this->a[1][2] = this->a[2][1] = 0;
    }
};
Max qpow(Max a, string s){
	Max m;
	int n = s.size() - 1;
	while(n >= 0){
		int b = s[n] - '0';
		for(int i = 1; i <= b; i++)
			m = m * a;
		a = a * a;
		Max y = a * a;
		Max z = y * y;
		a = a * z;
		n--;
	}
	return m;
}
int main(){
	scanf("%lld%lld%lld%lld", &x0, &x1, &a, &b);
	cin >> n;
	scanf("%lld", &mod);
	Max m;
	m.a[1][1] = a;
	m.a[1][2] = b;
	m.a[2][1] = 1;
	m.a[2][2] = 0;
	m = qpow(m, n);
	cout << (m.a[2][1] * x1 % mod + m.a[2][2] * x0 % mod) % mod;
}