#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<list>
#include<stack>
#include<map>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;
const int maxn = 1e5 + 7, maxd = 1e6 + 7;
int x, y;
int main() {
kuaidian
cin >> x >> y;
if(x < y) {
if(x+1 == y) cout << "Yes";
else cout << "No";
}
else {
if(y == 0) {
cout << "No";
}
else if(y == 1) {
if(x == 0) cout << "Yes";
else cout << "No";
}
else {
y -= 1;
x -= y;
if(x % 2 == 0) cout << "Yes";
else cout << "No";
}
}
return 0;
}
Codeforces Round #461 (Div. 2) A - Cloning Toys
最新推荐文章于 2022-11-22 23:15:14 发布