CF1814A.Coins

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

In Berland, there are two types of coins, having denominations of $2$ and $k$ burles.

Your task is to determine whether it is possible to represent $n$ burles in coins, i. e. whether there exist non-negative integers $x$ and $y$ such that $2 \cdot x + k \cdot y = n$ .

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.

The only line of each test case contains two integers $n$ and $k$ ( $1 \le k \le n \le 10^{18}$ ; $k \ne 2$ ).

输出格式

For each test case, print YES if it is possible to represent $n$ burles in coins; otherwise, print NO. You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).

输入输出样例

输入#1
```
4
5 3
6 1
7 4
8 8
```
输出#1
```
YES
YES
NO
YES
```

说明/提示

In the first test case, you can take one coin with denomination $2$ and one coin with denomination $k = 3$ .

In the second test case, you can take three coins with denomination $2$ . Alternatively, you can take six coins with denomination $k = 1$ .

In the third test case, there is no way to represent $7$ burles.

In the fourth test case, you can take one coin with denomination $k = 8$ .

首页