Express differently

CodeChefOpen on judge ↗

You need to find if a number can be expressed as sum of two perfect powers. That is, given x find if there exists non negative integers a, b, m, n such that am + bn = x. Input First line of the input contains number of test cases T. It is followed by T lines, each line contains a single number x. Output For each test case, print "Yes" (without quotes) if the number can be expressed as sum

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI