← All problemsSign in

1111---- !

Hari Charan was very bored in his maths class. He was able to solve each and every problem his teacher had given them. So his teacher decided to challenge him with a tricky problem. The teacher gave him a number $n$ and asked him to find out if there existed a number $m$ with all of its digits as $1$ which such that $m$ is divisible by $n$. For example if $n = 3$, $m=111$ and $m=111111$ are val

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

Sign in to chat with the tutor and save your progress.

Sign in to start