Divide Me Please

CodeChefOpen on judge ↗

There are some short-cut ways to check divisibility of numbers in base 10. Here are some examples: 1. Remember divisibility testing of 3 in base 10? It was simple, right? We need to add all the digits and then check if it is divisible by 3. Call this method **"1-sum"**. 2. In case of testing of 11, we need to add all digits by alternating their signs. For example, 1354379988104 = 11*123125453464

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