POJ - 3734 Blocks 指数生成函数

传送门

题意：

一段长度为$n$的序列，你有红黄蓝绿四种颜色的砖块，问你铺砖的方案数，每块砖长度为$1$，其中红黄颜色个数必须为偶数。

思路：

考虑多重集合排列数：

所以我们构造四种颜色的指数生成函数，并转换成封闭式：
$f_{红}(x)=f_{黄}(x)=1+\frac{x^2}{2!}+\frac{x^4}{4!}+...=\frac{e^x+e^{-x}}{2}$
$f_{蓝}(x)=f_{绿}(x)=1+\frac{x}{1!}+\frac{x^2}{2!}+...=e^x$

将其乘起来得封闭式
$G=e^{2x}\ast \frac{e^{2x}+e^{-2x}+2}{4}=\frac{e^{4x}+2e^{2x}+1}{4}$。
再将封闭式展开
由$e^x={\sum }_{i\ge 0}\frac{x^i}{i!}$，得$e^{kx}={\sum }_{i\ge 0}\frac{k^i{x}^i}{i!}$，即$G=\frac{1}{4}+\frac{{\sum }_{i\ge 0}(4^i+2^{i+1})\ast \frac{x^i}{i!}}{4}$，取指数为$n$的项，得系数$\frac{4^n+2^{n+1}}{4\ast n!}$，可以将常数项忽略，再乘上多重集合排列数的分子$n!$得$\frac{4^n+2^{n+1}}{4}=4^{n-1}+2^{n-1}$，答案即为$4^{n-1}+2^{n-1}$，快速幂直接算一下即可。

// Problem: Blocks
// Contest: Virtual Judge - POJ
// URL: https://vjudge.net/problem/POJ-3734
// Memory Limit: 65 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<cassert>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid ((tr[u].l+tr[u].r)>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;

//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int N=1000010,mod=10007,INF=0x3f3f3f3f;
const double eps=1e-6;

LL qmi(LL a,LL b) {
	LL ans=1;
	while(b) {
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans%mod;
}

int main()
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);	

	int _; cin>>_;
	while(_--) {
		int n; cin>>n;
		cout<<((1ll*qmi(4,n-1)+qmi(2,n-1))%mod)<<endl;
	}




	return 0;
}
/*

*/