← All problemsSign in

nth term2

Rudra is very intelligent , he always play many games there for he has sharp mind but now his mother is given a challenge to him he is given a series and he has to find $Nth$ term in the series . 3, 4, 9, 16, 27, 64, 81, 256, 243, 1024, 729 . . . ###Input: - First line will contain $T$ , number of testcases . - Each testcase contains a single line of input , integer $N$ . ###Output: For each

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

Sign in to chat with the tutor and save your progress.

Sign in to start