Submission #43433923

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll epow(ll a, ll k) {
    ll ans = 1;
    while (k > 0) {
        if (k & 1) ans = ans * a;
        a = a * a;
        k >>= 1;
    }
    return ans;
}
bool isPossible(ll N, ll K, ll currentSum, ll currentTerm) {
    if(N == K) return true;
    if (currentSum == N && currentTerm == K) {
        return true;
    }
    if (currentSum > N || currentTerm > K) {
        return false;
    }
    for (int m = 0; m <= N; m++) {
        int newSum = currentSum + epow(3, m);
        int newTerm = currentTerm + 1;
        if (isPossible(N, K, newSum, newTerm)) {
            return true;
        }
    }
    return false;
}

int main() {
    int T;cin>>T;
    while(T--){
        ll n,k;cin>>n>>k;
        if(isPossible(n,k,0LL,0LL)) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}

Submission Info

Judge Result