#include #include #include #include using namespace std; typedef long long ll; typedef pair P; typedef pair T; typedef pair Ps; typedef pair Pb; const ll INF = 1e18; const ll fact_table = 3200008; long double Pi = 3.1415926535897932384626; priority_queue pql; priority_queue

pqp; priority_queue

bag; //big priority queue priority_queue , greater > pqls; priority_queue , greater

> pqps; //small priority queue //top pop ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1}; //↓,→,↑,← #define endl "\n" #ifdef ENJAPMA #undef endl #endif #define p(x) cout<>= 1;}(x *= a) %= mod; b--;} return x;} void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;} void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;} void line() { p("--------------------"); return;} /* ll fact[fact_table + 5], rfact[fact_table + 5]; void c3_init() { fact[0] = rfact[0] = 1; for (ll i = 1; i <= fact_table; i++) { fact[i] = (fact[i - 1] * i) % mod; } rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod); for (ll i = fact_table; i >= 1; i--) { rfact[i - 1] = rfact[i] * i; rfact[i - 1] %= mod; } return; } ll c3(ll n, ll r) { return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod; } */ struct Timer { int64_t start; const int64_t CYCLES_PER_SEC = 2800000000; Timer() { reset(); } void reset() { start = getCycle(); } inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; } inline int64_t getCycle() { uint32_t low, high; __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high)); return ((int64_t)low) | ((int64_t)high << 32); } }; bool multicase = false; ll n, m, k, w, a, b, c, d, e, h, q, ans, sum, l; typedef vector vec; typedef vector> mat; ll tpow(ll n, ll m) { if (m == 0) return 1ll; if (m == 1) return n; if (n > 1 && m > 1) return INF; if (m % 2 == 0) { ll tmp = tpow(n, m / 2ll); return tmp * tmp; } else { return tpow(n, m - 1ll) * n; } return -1ll; } void solve() { ll z; cin >> n >> z; ll maxi = tpow(z, n); assert(maxi <= tpow(10ll, 6ll)); for (ll i = 1; tpow(i, n) <= maxi; i++) { for (ll j = 1; tpow(j, n) <= maxi; j++) { if (tpow(i, n) + tpow(j, n) == maxi) { p("Yes"); return; } } } p("No"); return; return; } int main() { // init(); ios::sync_with_stdio(false); cin.tie(nullptr); ll q, testcase = 1; if (multicase) { cin >> q; } else { q = 1; } while (q--) { // pu("Case ");pu("#");pu(testcase);pu(": "); solve(); testcase++; } // solve(); return 0; }