Multiples

CodeChefOpen on judge ↗

Our hero Popeye has been thrown a new challenge by Bluto. Bluto has asked Popeye a very complicated problem for which Popeye has turned to you, his faithful programmer. You have to write a program that given a natural number N, and M distinct decimal digits X1,X2...XM (at least one), finds the smallest strictly positive multiple of N that has no other digits besides X1,X2...XM (Such a multiple wil

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