CodeForces - 1608A Find Array水题

Posted 2022-05-17 海岛Blog

A. Find Array
time limit per test1 second
memory limit per test256 megabytes

Given n, find any array a1,a2,…,an of integers such that all of the following conditions hold:

1≤ai≤10⁹ for every i from 1 to n.

a1<a2<…<an
For every i from 2 to n, ai isn’t divisible by ai−1
It can be shown that such an array always exists under the constraints of the problem.

Input
The first line contains the number of test cases t (1≤t≤100). Description of the test cases follows.

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

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

Output
For each test case print n integers a1,a2,…,an — the array you found. If there are multiple arrays satisfying all the conditions, print any of them.

Example
input
3
1
2
7
output
1
2 3
111 1111 11111 111111 1111111 11111111 111111111

Note
In the first test case, array [1] satisfies all the conditions.

In the second test case, array [2,3] satisfies all the conditions, as 2<3 and 3 is not divisible by 2.

In the third test case, array [111,1111,11111,111111,1111111,11111111,111111111] satisfies all the conditions, as it’s increasing and a_i isn’t divisible by a_i−1 for any i from 2 to 7.

问题链接：CodeForces - 1608A Find Array
问题简述：（略）
问题分析：（略）

AC的C语言程序如下：

/* CodeForces - 1608A Find Array */

#include <stdio.h>

int main()

    int t, n;
    scanf("%d", &t);
    while (t--) 
        scanf("%d", &n);
        for (int i = 2; i < n + 2; i++)
            printf("%d ", i);
        printf("\\n");
    

    return 0;