题库练习 A-characteristic
← 上一题 下一题 →

A15927 | A-characteristic

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

题目描述

Consider an array $a_1, a_2, \dots, a_n$ consisting of numbers $1$ and $-1$ . Define $A$ -characteristic of this array as a number of pairs of indices $1 \le i < j \le n$ , such that $a_i \cdot a_j = 1$ .

Find any array $a$ with given length $n$ with $A$ -characteristic equal to the given value $k$ .

输入格式

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

The only line of each test case contains two integers $n$ and $k$ ( $2 \le n \le 100$ ; $0 \le k \le \frac{(n-1) n}{2}$ ) — the length of required array and required $A$ -characteristic.

输出格式

For each test case, if there is no array $a$ with given $A$ -characteristic $k$ , print NO.

Otherwise, print YES and $n$ numbers $1$ and $-1$ , which form the required array $a$ . If there are multiple answers, print any of them.

输入输出样例

输入 #1
7
2 0
2 1
3 1
3 2
3 3
5 4
5 5
输出 #1
YES
1 -1 
YES
1 1 
YES
1 -1 1 
NO
YES
1 1 1 
YES
-1 1 -1 1 1 
NO
C++ 编辑器
输入
输出