Again Primes

CodeChefOpen on judge ↗

Princess only loves beautiful numbers. A beautiful number is a number whose digits can be shuffled to make a prime number. Now, Princess's birthday is here, so DiguJ want to gift her with a beautiful number. Help DiguJ find beautiful number. So, You are given a number $N$, you are supposed to the largest beautiful number$ \leq N$. ###Input: - First line will contain $T$, number of testcases. T

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