• 如果喜欢本站，您可以按CTRL+D收藏本站，方便下次访问。

• 欢迎来自五湖四海的朋友，期待为您分享有价值的资源

# POJ 3734-Blocks 生成函数

10年前 (2010-08-31) 212次浏览
Blocks Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 720 Accepted: 201

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

Source

#include <iostream>
using namespace std;
const int mod=10007;
int pow(int n)
{
if(n==0)
return 1;
if(n&1)
{
return (pow(n-1)<<1)%mod;
}
else
{
int temp=pow(n>>1);
return (temp*temp)%mod;
}
}

int main(int argc, char *argv[])
{
int t,n,temp;
cin>>t;
while(t--)
{
cin>>n;
temp=pow((n-1)%(mod-1));
cout<<(temp*(temp+1))%mod<<endl;
}

return 0;
}

====
• 版权声明

本站的文章和资源来自互联网或者站长的原创，按照 CC BY-NC-SA 4.0 CN协议发布和共享，转载或引用本站文章应保留来源网址，并遵循相同协议。如果有侵犯版权的资源请尽快联系站长，我们会在24H内删除有争议的资源。
• 网站驱动

• 友情链接

• 支持一下