Prime Pattern

CodeChefOpen on judge ↗

Print the pattern by using indixes sum and $N$ value. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, one integer $N$. ### Output For each testcase, output corresponding pattern separated by a line. ### Constraints - $1 \leq T \leq 1000$ - $1 \leq index \leq N$ ### Subtasks - 30 points : $1 \leq R \leq

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