题意:
有一个序列是这样定义的:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
给出A,B和N,求f(n)的值。
Input
输入3个数:A,B,N。数字之间用空格分割。(-10000 <= A, B <= 10000, 1 <= N <= 10^9)
Output
输出f(n)的值。
Input示例
3 -1 5
Output示例
6
思路:
矩阵水题,只为了贴个模板
代码:
#include <bits/stdc++.h>
using namespace std;
const int mod = 7;
struct mat{
int p[3][3], 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] = (p[i][k] * X.p[k][j] % mod + tp.p[i][j]) % mod;
}
return tp;
}
}unit, Am;
mat quick_pow(mat a, int k) { // 矩阵快速幂
mat ret = unit;
while(k){
if(k & 1)
ret = ret * a;
k >>= 1;
a = a * a;
}
return ret;
}
void init() {
unit.sz = 2;
memset(unit.p, 0, sizeof(unit.p));
unit.p[1][1] = unit.p[2][2] = 1;
}
int main() {
init();
int a, b, n;
scanf("%d%d%d", &a, &b, &n);
if (n <= 2) {
puts("1");
return 0;
}
Am.sz = 2;
Am.p[1][1] = a; Am.p[1][2] = b;
Am.p[2][1] = 1; Am.p[2][2] = 0;
Am = quick_pow(Am, n - 2);
int ans = (Am.p[1][1] + Am.p[1][2]) % 7;
if (ans < 0) ans += 7;
printf("%d\n", ans);
return 0;
}