HUSTOJ 进阶题组1 问题 K Sum of Tribonacci Numbers

题目描述

Everybody knows Fibonacci numbers, now we are talking about the Tribonacci numbers:
T[0] = T[1] = T[2] = 1;
T[n] = T[n - 1] + T[n - 2] + T[n - 3] (n >= 3)

Given a and b, you are asked to calculate the sum from the ath Fibonacci number to the bth Fibonacci number, mod 1,000,000,007, that is (T[a] + T[a + 1] + ... + T[b]) % 1,000,000,007.

输入

There are multiple cases (no more than 100).

Each case contain two non-negative integers a b(a <= b and a, b < 1,000,000,000)

输出

For each case, output the sum % 1,000,000,007.

样例输入 Copy

0 2
0 5

样例输出 Copy

3
20

/*
T[0] = T[1] = T[2] = 1;
T[n] = T[n - 1] + T[n - 2] + T[n - 3] (n >= 3)
*/
/*
0 2
0 5
*/
/*
1 1000000000
38716500
*/
#include<iostream>
#include<cstring>
#define MAX 5
#define MOD 1000000007
using namespace std;

struct matrix {
	long long value[MAX][MAX];
}A;

matrix multiply(matrix a, matrix b) {
	matrix tmp;
	memset(tmp.value, 0, sizeof(tmp.value));
	for (int i = 1; i <= 4; i++)
		for (int j = 1; j <= 4; j++)
			for (int k = 1; k <= 4; k++)
				tmp.value[i][j] = (tmp.value[i][j] % MOD + (a.value[i][k]%MOD * b.value[k][j]%MOD) % MOD) % MOD;
	return tmp;
}

matrix fast_pow(matrix a, long long n) {
	matrix res;
	memset(res.value, 0, sizeof(res.value));
	for (int i = 1; i <= 4; i++)
		res.value[i][i] = 1;

	while (n != 0) {
		if (n & 1)res = multiply(res, a);
		a = multiply(a, a);
		n >>= 1;
	}
	return res;
}

void init() {
	memset(A.value, 0, sizeof(A.value));
	A.value[1][1] = A.value[1][2] = A.value[1][3] = A.value[1][4] = A.value[2][2] = A.value[2][3] = A.value[2][4] = A.value[3][2] = A.value[4][3] = 1;
}

int main()
{
	int vector_b[5] = { 0,3,1,1,1 };
	long long sum_first_3[4] = { 1,2,3 };
	long long a, b;
	while (scanf("%lld %lld", &a, &b) == 2) {
		init();

		long long S_a = 0;
		if (a < 3) {
			if (a <= 0)
				S_a = 0;
			else {
				S_a = sum_first_3[a-1];
			}
		}
		else {
			matrix ans_a = fast_pow(A, a - 3);
			for (int i = 1; i <= 4; i++)
				S_a = (S_a+ans_a.value[1][i] * vector_b[i]) % MOD;
		}
		long long S_b = 0;
		if (b < 3) {
			if (b <= 0)
				S_b = 0;
			else {
				S_b = sum_first_3[b];
			}
		}
		else {
			matrix ans_b = fast_pow(A, b - 2);
			for (int i = 1; i <= 4; i++)
				S_b = (S_b+ans_b.value[1][i] * vector_b[i]) % MOD;

		}
		printf("%lld\n", (S_b + MOD - S_a) % MOD);
	}
}