pattern type-1

CodeChefOpen on judge ↗

For given size of N print the following pattern ### Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, one integers $N$. ### Output: For each testcase, output is a pattern ### Constraints - $1 \leq T \leq 1000$ - $2 \leq N \leq 10^3$ ### Sample Input: 1 4 ### Sample Output: 1 2*3 4*5*6

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