Problem
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.
Constraints
1 ≤ n ≤ 1000
Examples
Input:
n = 7
Expected output:
expected = 1
Input:
long long n = 7;
Expected output:
long long expected = 1;
Input:
long n = 7;
Expected output:
long expected = 1;
Explanation
Of the 21 pairs up to k = 7, only P(4) + P(7) = 92 = P(8) is pentagonal, so the answer is 1.
Input:
n = 1
Expected output:
expected = 0
Input:
long long n = 1;
Expected output:
long long expected = 0;
Input:
long n = 1;
Expected output:
long expected = 0;
Explanation
There is no pair with j < k ≤ 1, so the answer is 0.
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
P(k) = k(3k − 1) / 2.
Hint 2
Check 24x + 1 for a perfect square with an integer square root, then check the root modulo 6.
Hint 3
Only pairs with j < k are counted.
Expected complexity
O(n²) time, O(n) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.