The Last One

CodeChefOpen on judge ↗

Analyze the following pattern and print the $Nth$ Term. 10,37,82,145..... ### Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, an integers $N$. ### Output: For each testcase, output in a single line answer Nth Term of the Above Series. ### Constraints - $1 \leq T \leq 1000$ - $1 \leq N \leq 100$ ### Samp

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