题库练习 Sum of Odd Integers
← 上一题 下一题 →

A13290 | Sum of Odd Integers

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

题目描述

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
C++ 编辑器
输入
输出