题库练习 Find Array
← 上一题 下一题 →

A14747 | Find Array

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

题目描述

Given $n$ , find any array $a_1, a_2, \ldots, a_n$ of integers such that all of the following conditions hold:

- $1 \le a_i \le 10^9$ for every $i$ from $1$ to $n$ .
- $a_1 < a_2 < \ldots <a_n$
- For every $i$ from $2$ to $n$ , $a_i$ isn't divisible by $a_{i-1}$

It can be shown that such an array always exists under the constraints of the problem.

输入格式

The first line contains the number of test cases $t$ ( $1 \le t \le 100$ ). Description of the test cases follows.

The only line of each test case contains a single integer $n$ ( $1 \le n \le 1000$ ).

It is guaranteed that the sum of $n$ over all test cases does not exceed $10^4$ .

输出格式

For each test case print $n$ integers $a_1, a_2, \ldots, a_n$ — the array you found. If there are multiple arrays satisfying all the conditions, print any of them.

输入输出样例

输入 #1
3
1
2
7
输出 #1
1
2 3
111 1111 11111 111111 1111111 11111111 111111111
C++ 编辑器
输入
输出