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

首頁 > 學院 > 開發(fā)設計 > 正文

poj3734Blocks(矩陣快速優(yōu)化的dp)

2019-11-14 10:14:19
字體:
供稿:網(wǎng)友

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


發(fā)表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發(fā)表
主站蜘蛛池模板: 成安县| 南宫市| 麦盖提县| 原阳县| 柯坪县| 新乡市| 南城县| 徐州市| 浦城县| 龙陵县| 即墨市| 阿巴嘎旗| 安远县| 鄢陵县| 清丰县| 鸡西市| 申扎县| 三亚市| 吴川市| 宁陵县| 棋牌| 阳城县| 新昌县| 施甸县| 宝应县| 大丰市| 泸溪县| 治县。| 贡嘎县| 莫力| 策勒县| 芒康县| 泰顺县| 南和县| 汾西县| 满城县| 通城县| 绥芬河市| 睢宁县| 元江| 宜兰市|