Yet Another Expression

CodeChefOpen on judge ↗

Given a positive integer $A$, find the total number of ordered pairs $(B,C)$ such that $A + B^{2C}$ is any perfect square, where $B$ and $C$ are positive integers ranging between $1$ to $10^5$. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each test case contains a single number $A$. ###Output: For each testcase, output in a single line answer i.e.

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