题意:
给一个递推公式 f(i) = f(i-1) + 2 * f(i-2) + i^4,求第n项的值。
思路:
根据递推公式构造矩阵,并且利用快速幂计算结果。算一算矩阵就出来了。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 2147493647;
struct mat{
ll p[10][10], sz;
mat operator + (const mat &x) {
mat tp; tp.sz = sz;
for (int i = 1; i <= sz; i++)
for (int j = 1; j <= sz; j++)
tp.p[i][j] = (p[i][j] + x.p[i][j]) % MOD;
return tp;
}
mat operator * (const mat &x) {
mat tp; tp.sz = sz;
for (int i = 1; i <= sz; i++)
for (int j = 1; j <= sz; j++) {
tp.p[i][j] = 0;
for (int k = 1; k <= sz; k++)
tp.p[i][j] = (tp.p[i][j] + p[i][k] * x.p[k][j] % MOD) % MOD;
}
return tp;
}
}unit, Am;
mat pow_mod(mat a, ll n) {
mat res = unit;
while (n) {
if (n & 1) res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
void init() {
memset(&unit, 0, sizeof(unit));
unit.sz = 7;
for (int i = 1; i <= 7; i++) unit.p[i][i] = 1;
}
int main() {
//freopen("in", "r", stdin);
init();
int T;
scanf("%d", &T);
while (T--) {
ll n, a, b;
scanf("%lld%lld%lld", &n, &a, &b);
if (n == 1) {
printf("%lld\n", a);
continue;
}
if (n == 2) {
printf("%lld\n", b);
continue;
}
memset(&Am, 0, sizeof(Am));
Am.sz = 7;
Am.p[1][1] = 1; Am.p[1][2] = 2; Am.p[1][3] = 1;
Am.p[2][1] = 1;
Am.p[3][3] = 1; Am.p[3][4] = 4; Am.p[3][5] = 6; Am.p[3][6] = 4; Am.p[3][7] = 1;
Am.p[4][4] = 1; Am.p[4][5] = 3; Am.p[4][6] = 3; Am.p[4][7] = 1;
Am.p[5][5] = 1; Am.p[5][6] = 2; Am.p[5][7] = 1;
Am.p[6][6] = 1; Am.p[6][7] = 1;
Am.p[7][7] = 1;
Am = pow_mod(Am, n - 2);
ll ans = (Am.p[1][1] * b % MOD + Am.p[1][2] * a % MOD + Am.p[1][3] * 81 % MOD) % MOD;
ans = (ans + Am.p[1][4] * 27 % MOD + Am.p[1][5] * 9 % MOD + Am.p[1][6] * 3 % MOD + Am.p[1][7]) % MOD;
printf("%lld\n", ans);
}
return 0;
}