Power of 3

CodeChefOpen on judge ↗

Taru has a special affection for number **3**. So, she gives Tan two numbers **N** and **K**. Tan has to create the **k**th largest **N** digit number divisible by **3**. ### Input - First-line will contain an integer N (the length of the number). - Second-line will contain an integer K. - K will be such that the answer will always exist. ### Output Print a single integer representing the **K**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