Codeforces-SolutionsA/Codes/1977 A - Little Nikita/1977A.cpp
ShazidMahsrafi 27b981ecba add 1977A
2024-06-02 00:53:26 +06:00

27 lines
521 B
C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
int n,m;
cin>>n>>m;
if((n+m)&1 || n<m)
cout<<"No\n";
else
cout<<"Yes\n";
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}