6 人解决，21 人已尝试。
6 份提交通过，共有 57 份提交。
8.4 EMB 奖励。
1939. Tiling a Grid With Dominoes
单点时限: 2.0 sec
内存限制: 256 MB
We wish to tile a grid 4 units high and N units long with rectangles (dominoes) 2 units by one unit (in either orientation). For example, the figure shows the five different ways that a grid 4 units high and 2 units wide may be tiled.
Write a program that takes as input the width, W, of the grid and outputs the number of different ways to tile a 4-by-W grid.
输入格式
The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.
Each dataset contains a single decimal integer, the width, W, of the grid for this problem instance.
输出格式
For each problem instance, there is one line of output: The problem instance number as a decimal integer (start counting at one), a single space and the number of tilings of a 4-by-W grid. The values of W will be chosen so the count will fit in a 32-bit integer.
样例
Input
3 2 3 7
Output
1 5 2 11 3 781
题目标签