Problema
Triangular numbers count the dots in a triangle of rows 1, 2, 3, ...: T(1) = 1, T(2) = 3, T(3) = 6, and T(k) = k(k + 1) / 2. Walk through them in order and stop at the first one with at least d positive divisors (1 and the number itself count).
Implement highly_divisible_triangular(d).
Counting divisors one by one is too slow for the larger cases. Factor the number instead: if n = p^a × q^b × ..., it has (a + 1)(b + 1)... divisors. Since k and k + 1 share no factor, you can factor them separately.
Input
d: The number of divisors needed.
Output
Return the first triangular number with at least d divisors.
Restricciones
1 ≤ d ≤ 300
Ejemplos
Entrada:
d = 4
Salida esperada:
expected = 6
Entrada:
long long d = 4;
Salida esperada:
long long expected = 6;
Entrada:
long d = 4;
Salida esperada:
long expected = 6;
Explicación
1 has one divisor and 3 has two, but 6 has four (1, 2, 3, 6), so the answer is 6.
Entrada:
d = 9
Salida esperada:
expected = 36
Entrada:
long long d = 9;
Salida esperada:
long long expected = 36;
Entrada:
long d = 9;
Salida esperada:
long expected = 36;
Explicación
28 has six divisors and 36 = 2² × 3² has 3 × 3 = 9 (1, 2, 3, 4, 6, 9, 12, 18, 36), so the answer is 36.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
T(k) = k(k + 1) / 2, and k and k + 1 have no common factor.
Pista 2
Halve whichever of k and k + 1 is even, then count the divisors of each part.
Pista 3
The divisor count of a product of coprime numbers is the product of their counts.
Complejidad esperada
O(K √K) time for K triangular numbers tried, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.