Problema
The proper divisors of n are the positive divisors other than n itself. For 12 they are 1, 2, 3, 4 and 6. Their sum (sometimes called the aliquot sum) tells whether a number is perfect, abundant or deficient. Divisors come in pairs d and n / d, so you only need to try values of d up to the square root of n.
Implement sum_of_proper_divisors(n).
Input
n: A positive integer.
Output
Return the sum of all positive divisors of n that are less than n. For n = 1 there are none, so return 0.
Restricciones
1 ≤ n ≤ 10^12
Ejemplos
Entrada:
n = 12
Salida esperada:
expected = 16
Entrada:
long long n = 12;
Salida esperada:
long long expected = 16;
Entrada:
long n = 12;
Salida esperada:
long expected = 16;
Explicación
1 + 2 + 3 + 4 + 6 = 16.
Entrada:
n = 28
Salida esperada:
expected = 28
Entrada:
long long n = 28;
Salida esperada:
long long expected = 28;
Entrada:
long n = 28;
Salida esperada:
long expected = 28;
Explicación
1 + 2 + 4 + 7 + 14 = 28, so 28 is a perfect number.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
If d divides n, then n / d divides n too.
Pista 2
Only try d up to the square root of n, adding both members of each pair.
Pista 3
Leave n itself out, and add the square root only once when n is a perfect square.
Complejidad esperada
O(sqrt n) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.