Problema
A Harshad number (also called a Niven number) is a positive integer that is divisible by the sum of its own digits. For example, 18 has digit sum 1 + 8 = 9, and 18 ÷ 9 = 2 with no remainder, so 18 is a Harshad number.
Implement harshad_number(n).
Input
n: The number to test.
Output
Return true if n is divisible by the sum of its decimal digits, otherwise false.
Restricciones
1 ≤ n ≤ 10^18
Ejemplos
Entrada:
n = 156
Salida esperada:
expected = True
Entrada:
long long n = 156;
Salida esperada:
bool expected = true;
Entrada:
long n = 156;
Salida esperada:
bool expected = true;
Explicación
The digit sum is 1 + 5 + 6 = 12, and 156 = 12 × 13, so the answer is true.
Entrada:
n = 19
Salida esperada:
expected = False
Entrada:
long long n = 19;
Salida esperada:
bool expected = false;
Entrada:
long n = 19;
Salida esperada:
bool expected = false;
Explicación
The digit sum is 1 + 9 = 10, and 19 is not a multiple of 10, so the answer is false.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Add up the digits first, using a copy of n.
Pista 2
n is Harshad when the remainder of n divided by the digit sum is 0.
Pista 3
The digit sum of a positive number is never 0, so the division is safe.
Complejidad esperada
O(d) time for d digits, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.