-
Notifications
You must be signed in to change notification settings - Fork 2
/
Equal_Coins.cpp
65 lines (61 loc) · 1.22 KB
/
Equal_Coins.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
//SHYAMAL PRAJAPATI
// https://www.codechef.com/NOV21C/problems/EQUALCOIN
#define int long long
#define nl "\n"
const int M = 1e9 + 7;
typedef vector<int> vi;
#define f(i, a, n) for (int i = a; i < n; i++)
#define rf(i, a, n) for (int i = n - 1; i >= a; i--)
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cin.tie(0); \
cout.tie(0);
#define read(arr, n) \
for (int i = 0; i < n; i++) \
cin >> arr[i];
#define pr(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i];
#define in cin >>
#define out cout <<
#define first fr
#define second sc
void solve()
{
int n, k, i, p, q, r, count = 0, j, flag, ans = 0;
int x, y;
cin >> x >> y;
ans = x + y;
if (x % 2 == 1)
{
cout << "NO\n";
return;
}
if (x % 2 == 0 && y % 2 == 0)
{
cout << "YES\n";
return;
}
if (x > 1)
{
cout << "YES\n";
return;
}
else
{
cout << "NO\n";
return;
}
}
int32_t main()
{
FIO int t;
t = 1;
in t;
while (t--)
solve();
return 0;
}