Sum Divides Product

CodeChefRating 2384Open on judge ↗

For a given positive integer N find the number of all pairs (a, b) of positive integers such that 1 and the sum a + b divides the product a * b. Input The first line contains a single positive integer T , the number of test cases. T test cases follow. The only line of each test case contains a positive integer N 9. Output For each test case, output a single line containing the answer for the c

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI