CF1809C.Sum on Subarrays
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
For an array a=[a1,a2,…,an] , let's denote its subarray a[l,r] as the array [al,al+1,…,ar] .
For example, the array a=[1,−3,1] has 6 non-empty subarrays:
- a[1,1]=[1] ;
- a[1,2]=[1,−3] ;
- a[1,3]=[1,−3,1] ;
- a[2,2]=[−3] ;
- a[2,3]=[−3,1] ;
- a[3,3]=[1] .
You are given two integers n and k . Construct an array a consisting of n integers such that:
- all elements of a are from −1000 to 1000 ;
- a has exactly k subarrays with positive sums;
- the rest 2(n+1)⋅n−k subarrays of a have negative sums.
输入格式
The first line contains one integer t ( 1≤t≤5000 ) — the number of test cases.
Each test case consists of one line containing two integers n and k ( 2≤n≤30 ; 0≤k≤2(n+1)⋅n ).
输出格式
For each test case, print n integers — the elements of the array meeting the constraints. It can be shown that the answer always exists. If there are multiple answers, print any of them.
输入输出样例
输入#1
4 3 2 2 0 2 2 4 6
输出#1
1 -3 1 -13 -42 -13 42 -3 -4 10 -2