CT399

Tara Counts the abacus beads

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Morning light hits the otter slides of Sleekwater as Tara unrolls the day's manifest of abacus beads. The tally will decide the next shipment. Task: Print the sum of all positive divisors of n. Input format: One line with a single integer n. Output format: Print the divisor sum. Constraints: 1 <= n <= 1000000000.

Example 1:

Input: 697448978
Output: 1055457216

Example 2:

Input: 962377259
Output: 1018987704

Example 3:

Input: 121733187
Output: 167989248

Constraints:

1 <= n <= 1000000000.

Loading...
Test Cases:No test cases
No test cases available.