Easy Dissy

CodeChefOpen on judge ↗

There are $N$ friends standing in a line, 1 to $N$. Each of them have some amount of chocolates with them given by Array[i]. There are holding a competition for which they want to collect chocolate with some of the friend. Any friend $i$ can give his chocolates to any friend numbered $j$ such that $j$ is divisible by $i$. Find the maximum number of chocolate any friend can posses modulo 100

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