A15349 | $Beautiful Array$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Stanley defines the beauty of an array $a$ of length $n$ , which contains non-negative integers, as follows: $$$$\sum\limits_{i = 1}^{n} \left \lfloor \frac{a_{i}}{k} \right \rfloor, $$ which means that we divide each element by $k$ , round it down, and sum up the resulting values.</p><p>Stanley told Sam the integer $k$ and asked him to find an array $a$ of $n$ non-negative integers, such that the beauty is equal to $b$ and the sum of elements is equal to $s$$$. Help Sam — find any of the arrays satisfying the conditions above.

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 1000$ ). Description of the test cases follows. The first line of each test case contains integers $n$ , $k$ , $b$ , $s$ ( $1 \leq n \leq 10^{5}$ , $1 \leq k \leq 10^{9}$ , $0 \leq b \leq 10^{9}$ , $0 \leq s \leq 10^{18}$ ). It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$ .

For each test case print $-1$ if such array $a$ does not exist. Otherwise print $n$ non-negative integers $a_1, a_2, \ldots, a_n$ ( $0 \leq a_{i} \leq 10^{18}$ ) — the answer.

输入 #1

8
1 6 3 100
3 6 3 12
3 6 3 19
5 4 7 38
5 4 7 80
99978 1000000000 100000000 1000000000000000000
1 1 0 0
4 1000000000 1000000000 1000000000000000000

输出 #1

-1
-1
0 0 19
0 3 3 3 29
-1
-1
0
0 0 0 1000000000000000000

C++ 编辑器

输入

输出