시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 512 MB | 7 | 3 | 3 | 42.857% |
You are given an integer $K$ such that $1 \le K \le 10^6$. Construct any array $A$ of numbers for which the following properties hold:
It can be shown that, under the constraints above, such array $A$ always exists.
The first line contains a single integer $t$ ($1 \le t \le 1000$), the number of test cases.
Each of the next $t$ lines contains a single integer $K$ ($1 \le K \le 10^6$).
For each test case, on the first line, output a single integer $N$ ($1 \le N \le 30$), the size of your array.
On the second line, output $N$ integers $A_1, A_2, \ldots, A_N$ ($-10^{16} \le A_i \le 10^{16}$), the elements of the array.
2 3 16
5 2021 -1000 -1021 -2000 -21 4 0 0 0 0
Note that the elements of the array don't have to be distinct.