Sakurako‘s Exam

A. Sakurako’s Exam

Problem

Today, Sakurako has a math exam. The teacher gave the array, consisting of a
ones and b twos.

In an array, Sakurako must place either a ‘+’ or a ‘-’ in front of each element so that the sum of all elements in the array equals 0.

Sakurako is not sure if it is possible to solve this problem, so determine whether there is a way to assign signs such that the sum of all elements in the array equals 0.

Input

The first line contains a single integer t (1≤t≤100) — the number of test cases.

The only line of each test case contains two integers a and b (0≤a,b<10) — the number of '1’s and the number of '2’s in the array.

Output

For each test case, output “Yes” if you can make the sum of the entire array equal to 0
, and “No” otherwise.

You can output each letter in any case (lowercase or uppercase). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be accepted as a positive answer.

Example

Input
5
0 1
0 3
2 0
2 3
3 1
Output
NO
NO
YES
YES
NO

Note

  • a=0, b=1: This means the array is [2] — it is impossible to add the signs ‘+’ or ‘-’ to get 0
    as a result;
  • a=0, b=3: This means the array is [2,2,2] — it is impossible to add the signs ‘+’ or ‘-’ to get 0 as a result;
  • a=2, b=0: This means the array is [1,1] — it is possible to add the signs ‘+’ or ‘-’ to get 0 as a result (+1−1=0);
  • a=2, b=3: This means the array is [1,1,2,2,2] — it is possible to add the signs ‘+’ or ‘-’ to get 0 as a result (+1+1−2−2+2=0);

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//队列
// #include <queue>//堆/优先队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器,存数组的数,表数组的长度
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
    ll t;
    cin>>t;

    while(t--)
    {
        ll a,b;
        cin>>a>>b;

        if(b&1) a-=2;
        if(a<0)
        {
            cout<<"NO"<<endl;
            continue;
        }
        
        if(a&1) cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
    
    return 0;
 }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Pretty Boy Fox

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值