国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

poj3734Blocks(矩陣快速優化的dp)

2019-11-14 10:19:02
字體:
來源:轉載
供稿:網友

Blocks
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 6418 Accepted: 3090

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

212

Sample Output

26

Source

PKU Campus 2009 (POJ Monthly Contest – 2009.05.17), Simon


發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 九龙县| 汉寿县| 武乡县| 洛阳市| 遵化市| 台北市| 龙井市| 桦甸市| 明星| 苍梧县| 多伦县| 白玉县| 四平市| 鞍山市| 个旧市| 治多县| 合作市| 平湖市| 上杭县| 桃江县| 宁都县| 天长市| 五河县| 克山县| 乌拉特后旗| 鲁甸县| 昆明市| 明光市| 周至县| 中江县| 饶平县| 深州市| 万宁市| 乃东县| 襄汾县| 五大连池市| 井研县| 长泰县| 漠河县| 梁河县| 宜春市|