Sum of Odd Integers

题意翻译

### 题目描述 给定 $n,k$，求是否能用 $k$ 个不同奇数的和来表示 $n$。 ### 输入格式 第一行一个数 $t(1\leq t\leq 10^5)$。 之后 $t$ 每行两个数 $n,k(1\leq n,k \leq 10^7)$ ### 输出格式 如果有解，输出"YES"，否则输出"NO"。

题目描述

You are given two integers $ n $ and $ k $ . Your task is to find if $ n $ can be represented as a sum of $ k $ distinct positive odd (not divisible by $ 2 $ ) integers or not. You have to answer $ t $ independent test cases.

输入输出格式

输入格式

The first line of the input contains one integer $ t $ ( $ 1 \le t \le 10^5 $ ) — the number of test cases. The next $ t $ lines describe test cases. The only line of the test case contains two integers $ n $ and $ k $ ( $ 1 \le n, k \le 10^7 $ ).

输出格式

For each test case, print the answer — "YES" (without quotes) if $ n $ can be represented as a sum of $ k $ distinct positive odd (not divisible by $ 2 $ ) integers and "NO" otherwise.

输入输出样例

输入样例 #1

6
3 1
4 2
10 3
10 2
16 4
16 5

输出样例 #1

YES
YES
NO
YES
YES
NO

说明

In the first test case, you can represent $ 3 $ as $ 3 $ . In the second test case, the only way to represent $ 4 $ is $ 1+3 $ . In the third test case, you cannot represent $ 10 $ as the sum of three distinct positive odd integers. In the fourth test case, you can represent $ 10 $ as $ 3+7 $ , for example. In the fifth test case, you can represent $ 16 $ as $ 1+3+5+7 $ . In the sixth test case, you cannot represent $ 16 $ as the sum of five distinct positive odd integers.