POJ 3734 Blocks

Blocks

Time Limit: 1000MS Memory Limit: 65536K

Description

Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he starts to think of a math problem of painting. Suppose there are N blocks in a line and each block can be paint red, blue, green or yellow. For some myterious reasons, Panda want both the number of red blocks and green blocks to be even numbers. Under such conditions, Panda wants to know the number of different ways to paint these blocks.

Input

The first line of the input contains an integer T(1≤T≤100), the number of test cases. Each of the next T lines contains an integer N(1≤N≤10^9) indicating the number of blocks.

Output

For each test cases, output the number of ways to paint the blocks in a single line. Since the answer may be quite large, you have to module it by 10007.

Sample Input

2
1
2

Sample Output

2
6

思路:

矩阵快速幂的模板题,难得地方就是如何确立刚开始的矩阵,所以我就列一个方程吧:设ai是偶数的个数,bi是一奇一偶的个数,ci是无偶数的个数,所以就有
ai+1 = 2ai+bi
bi+1 = 2ai+2bi+2ci
ci+1 = 2bi+2ci
这样矩阵就出来了,没有的地方就补零就行了。

#include <iostream>
#include <vector>
using namespace std;
const int mod = 10007;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat a, mat b) {
	mat c(a.size(), vec(b[0].size()));
	for (int i = 0; i < a.size(); i++) {
		for (int j = 0; j < b[0].size(); j++) {
			for (int k = 0; k < b.size(); k++) {
				c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % mod;
			}
		}
	}
	return c;
}
mat pow(mat a, int n) {
	mat b(a.size(), vec(a[0].size()));
	for (int i = 0; i < a.size(); i++) b[i][i] = 1;
	while (n) {
		if (n & 1) b = mul(a, b);
		a = mul(a, a);
		n >>= 1;
	}
	return b;
}
int main() {
	int t, n;
	scanf("%d", &t);
	while (t--) {
		mat a(3, vec(3));
		scanf("%d", &n);
		a[0][0] = 2, a[0][1] = 1, a[0][2] = 0;
		a[1][0] = 2, a[1][1] = 2, a[1][2] = 2;
		a[2][0] = 0, a[2][1] = 1, a[2][2] = 2;
		a = pow(a, n);
		printf("%d\n", a[0][0]);
	}
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值