Problema
Pentagonal numbers are P(k) = k(3k − 1) / 2: 1, 5, 12, 22, 35, 51, 70, ... Some pairs add up to another pentagonal number, like P(4) + P(7) = 22 + 70 = 92 = P(8). Count the pairs j < k ≤ n for which P(j) + P(k) is pentagonal. A quick test helps: x is pentagonal exactly when 24x + 1 is a perfect square s² with s % 6 = 5.
Implement pentagonal_pair(n).
Input
n: The largest index k to use.
Output
Return the number of pairs (j, k) with 1 ≤ j < k ≤ n and P(j) + P(k) pentagonal.
Restricciones
1 ≤ n ≤ 1000
Ejemplos
Entrada:
n = 7
Salida esperada:
expected = 1
Entrada:
long long n = 7;
Salida esperada:
long long expected = 1;
Entrada:
long n = 7;
Salida esperada:
long expected = 1;
Explicación
Of the 21 pairs up to k = 7, only P(4) + P(7) = 92 = P(8) is pentagonal, so the answer is 1.
Entrada:
n = 1
Salida esperada:
expected = 0
Entrada:
long long n = 1;
Salida esperada:
long long expected = 0;
Entrada:
long n = 1;
Salida esperada:
long expected = 0;
Explicación
There is no pair with j < k ≤ 1, so the answer is 0.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
P(k) = k(3k − 1) / 2.
Pista 2
Check 24x + 1 for a perfect square with an integer square root, then check the root modulo 6.
Pista 3
Only pairs with j < k are counted.
Complejidad esperada
O(n²) time, O(n) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.