nth Power

CodeChefOpen on judge ↗

Input a n-digit 'x'. Check if the sum of its digits raised to the nth power is equal to the inputted number(x) or not. ### Input Positive integers 0 <=x<=99999 ### Output - Yes,yes, YES - if the number satisfy the given condition. - No, no, NO - if the number doesn't satisfy the given condition. ### Constraints - $1 \leq T \leq 1000$ - $2 \leq M \leq 10^9$ ### Subtasks - 30 points : $1 \leq R

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