SPY NUMBER

CodeChefOpen on judge ↗

A number $N$ is called [SPY number](https://www.google.com/search?q=SPY+number) if the sum and product of its digits are equal. ###Input: - First line consists $T$ of number of test cases. - Each of the next $T$ lines contain an integer $N$. ###Output: - For each test case print $YES$ for SPY number else print $NO$, in new line. ###Constrains: - $1 \leq T \leq 100$ - $1 \leq N \leq 10^9$ ##

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