题库练习 Filling Diamonds
← 上一题 下一题 →

A13429 | Filling Diamonds

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You have integer $n$ . Calculate how many ways are there to fully cover belt-like area of $4n-2$ triangles with diamond shapes.

Diamond shape consists of two triangles. You can move, rotate or flip the shape, but you cannot scale it.

$2$ coverings are different if some $2$ triangles are covered by the same diamond shape in one of them and by different diamond shapes in the other one.

Please look at pictures below for better understanding.

![](/uploads/luogu/CF1339A/13939933dc7d3e630430763f7020234fec4c2bc3_d84f5fc30689.png) On the left you can see the diamond shape you will use, and on the right you can see the area you want to fill.![](/uploads/acgo/image/21df2b499214beea_c9088b01f3e9.jpeg) These are the figures of the area you want to fill for $n = 1, 2, 3, 4$ .

You have to answer $t$ independent test cases.

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 10^{4}$ ) — the number of test cases.

Each of the next $t$ lines contains a single integer $n$ ( $1 \le n \le 10^{9}$ ).

输出格式

For each test case, print the number of ways to fully cover belt-like area of $4n-2$ triangles using diamond shape. It can be shown that under given constraints this number of ways doesn't exceed $10^{18}$ .

输入输出样例

输入 #1
2
2
1
输出 #1
2
1
C++ 编辑器
输入
输出