Submission #43418022

---

Source Code Expand

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define ff(i,s,f) for(int i=s;i<f;i++)
#define fb(i,s,f) for(int i=(s)-1;i>=f;i--)
#define ffi(i,s,f) for(int i=s;i<=f;i++)
#define fbi(i,s,f) for(int i=s;i>=f;i--)
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define ub(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

void solve(){
    ll n,k;
    cin>>n>>k;
    int klk=0;
    if(k>n){
        cout<<"No\n";
        return;
    }
    while(n>0){
        klk+=n%3;
        n/=3;
    }
    if(klk>k){
        cout<<"No\n";
        return;
    }
    if((klk&1)==(k&1)){
        cout<<"Yes\n";
    }else cout<<"No\n";
}

int main(){
    ios;
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}

Submission Info

Judge Result