Submission #10039569

---

Source Code Expand

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
const long double PI = acos(-1.0L);
const long long MOD = 1000000007LL;
//const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
///////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    ll X,Y; cin >> X >> Y;
    if ((X+Y)%4!=0) {
        cout << "No" << endl;
        return 0;
    }
    ll K = (X+Y)/4;
    X -= K;
    Y -= K;
    if (X >= 0 && Y >= 0 && X%2==0 && Y%2==0) {
        cout << "Yes" << endl;
    } else cout << "No" << endl;
}

Submission Info

Judge Result