hdu 1005 Number Sequence 构造矩阵 + 矩阵快速幂

HDU 1005

题解:  F(n) = a * F(n - 1) + b *  F(n - 2) 可以用矩阵乘法{F(n - 1), F(n  - 2)} * {{a, 1}, {b , 0}} = {F(n), F(n - 1)};

如此类推{F(n), F(n - 1)} = {F(1), F(2)} *  {{a, 1}, {b , 0}}^(n - 2);

且F(1) = F(2) = 1, 所以最后只要求矩阵幂的第一列列两个元素的加和模7就可.

code:

/*
adrui's submission 
Language : C++
Result : Accepted
Love : ll
Favorite : Dragon Balls

Standing in the Hall of Fame
*/



#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

#define debug 0
#define LL long long
#define mod 7
#define M(a, b) memset(a, b, sizeof(a))

const int maxn = 20 + 5;
int a, b, n;

struct Matrix {
	int mat[2][2];
	void init() {
		M(mat, 0);
		for (int i = 0; i < 2; i++)
			mat[i][i] = 1;
	}
};

Matrix operator * (Matrix a, Matrix b) {				//矩阵乘法
	Matrix c;
	M(c.mat, 0);

	for (int i = 0; i < 2; i++)
		for (int j = 0; j < 2; j++)
		{
			for (int k = 0; k < 2; k++)
				c.mat[i][j] += (a.mat[i][k] * b.mat[k][j]) % mod;
			c.mat[i][j] %= mod;
		}

	return c;
}
Matrix operator ^ (Matrix tmp, int b) {					//快速幂
	Matrix res;
	res.init();

	while (b) {
		if (b & 1) res = res * tmp;
		tmp = tmp * tmp;
		b >>= 1;
	}

	return res;
}
int main() {
#if debug
	freopen("in.txt", "r", stdin);
#endif //debug
	

	while (~scanf("%d%d%d", &a, &b, &n), a + b + n) {
		Matrix tmp;
		M(tmp.mat, 0);										//构造底数矩阵
		tmp.mat[0][0] = a;								
		tmp.mat[0][1] = 1;
		tmp.mat[1][0] = b;

		if (n == 1)											//n为1直接输出
			puts("1");
		else{
			Matrix res = tmp ^ (n - 2);						//快速幂，单位矩阵也是符合这题结果的所以n==2时也可以加进去
			printf("%d\n", (res.mat[0][0] + res.mat[1][0]) % mod);	//幂矩阵第一列加和取模
		}
	}
	return 0;
}