CF1339A.Filling Diamonds

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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

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

22 coverings are different if some 22 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.

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. These are the figures of the area you want to fill for n=1,2,3,4n = 1, 2, 3, 4 .

You have to answer tt independent test cases.

输入格式

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

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

输出格式

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

输入输出样例

  • 输入#1

    2
    2
    1

    输出#1

    2
    1

说明/提示

In the first test case, there are the following 22 ways to fill the area:

In the second test case, there is a unique way to fill the area:

首页