Divisor Sum

CodeChefOpen on judge ↗

A function F(n) for a number n is defined as sum of the divisors of n (including 1 and n) . Given an integer N calculate G(N) = F(1) + F(2) + F(3) + ..... + F(N) Input First and only line of input contains an integer N Output Output a single line containing G(N) Constraints 1 Example Input: 3 Output: 8

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