Divisibility by Four

CodeChefOpen on judge ↗

You are given a non-negative integer $N$, its decimal representation consists of atmost $1000$ digits and doesn't contain any leading zeroes. You have to determine whether it is possible to remove some of the digits (possibly no digit) so that the final number is a non-negative integer containing at least a single digit, and is divisible by $4$ (the number should not contain any leading zeros). A

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