← All problemsSign in

Divisible By 8

CodeChefRating 1660Open on judge ↗

You are given a positive integer $N$. Note that $N$ may exceed the range of a 64-bit integer. Find a positive integer $M$ (without leading zeroes) divisible by $8$, formed by changing **minimum** number of digits in $N$. Note that the number of digits in $M$ must be equal to the number of digits in $N$. If there are multiple answers, you may print any one of them. ### Input - The first line o

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