POJ 3734 Blocks

手算了一下有三个和四个的情况，，然后找到规律是2^n*(1+2^n)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<string.h>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<vector>
#include<ctime>
#include<queue>
#define hash hashh
using namespace std;
typedef long long ll;
#define mod 10007

#define sp  system("pause")
#define lchild(i)  2*i
#define rchild(i)  2*i+1
#define getmid(x,y) ((x+y)/2)
#define PB    push_back


int main()
{
	int T;
	cin>>T;
	ll n;
	while(T--)
	{
		cin>>n;
		ll ans=1;
		ll k=n-1;
		ll ch=2;
		while(k)
		{
			if(k&1)ans*=ch,ans%=mod;
			ch*=ch;ch%=mod;
			k>>=1;
		}
		ans=((1+ans)*ans)%mod;
		cout<<ans<<endl;
	}
	return 0;
}