ADITYA AND ANUSHMAN CONFESSION
CodeChefOpen on judge ↗
Years later, Aditya and Anshuman finally manage to trace their childhood crush - Geet. Since both confess their feelings to her, Geet gets confused and decides to test their love with an interesting divisor problem. We know that, Any non-negative integer can be written as a product of several prime numbers. She asks them to find the sum of all divisors of the divisors of a positive integer $N$. Y
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.
Sign in to chat with the tutor and save your progress.
Sign in to start