FIVE ON FIVE

CodeChefOpen on judge ↗

Recently, Virat was on face time with Gennady. They both were happily discussing about cricket and maths. Gennady came up with an interesting problem to give a mental warm to Virat before next series. This is what he wants Virat to find. Count all pairs of 5-digit numbers using the digits 0 to 9 exactly once (taking both the numbers together), such that the first number divided by the second

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