题目地址:http://ac.jobdu.com/problem.php?pid=1081
-
题目描述:
-
给定a0,a1,以及an=p*a(n-1) + q*a(n-2)中的p,q。这里n >= 2。 求第k个数对10000的模。
-
输入:
-
输入包括5个整数:a0、a1、p、q、k。
-
输出:
-
第k个数a(k)对10000的模。
-
样例输入:
-
20 1 1 14 5
-
样例输出:
-
8359
#include <stdio.h>
#define MOD 10000
typedef struct matrix{
int a00, a01, a10, a11;
}Matrix;
void MatrixMul(Matrix * m, Matrix * n){
Matrix tmp;
tmp.a00 = (m->a00 * n->a00 + m->a01 * n->a10) % MOD;
tmp.a01 = (m->a00 * n->a01 + m->a01 * n->a11) % MOD;
tmp.a10 = (m->a10 * n->a00 + m->a11 * n->a10) % MOD;
tmp.a11 = (m->a10 * n->a01 + m->a11 * n->a11) % MOD;
*m = tmp;
}
int main(void){
int a0, a1, p, q, k;
while (scanf ("%d%d%d%d%d",
&a0, &a1, &p, &q, &k) != EOF){
if (k == 0) {printf ("%d\n", a0 % MOD); continue;}
if (k == 1) {printf ("%d\n", a1 % MOD); continue;}
Matrix pq = {p%MOD, q%MOD, 1, 0};
Matrix ans = {1, 0, 0, 1};
--k;
while (k >= 1){
if ((k & 1) == 1)
MatrixMul (&ans, &pq);
MatrixMul (&pq, &pq);
k = k >> 1;
}
printf ("%d\n", (ans.a00*a1+ans.a01*a0) % MOD);
}
return 0;
}
参考资料: 十个利用矩阵乘法解决的经典题目