Lines on square

CodeChefOpen on judge ↗

You are given a square, and you want to know the maximum number of regions you create by drawing $n$ straight lines. Calculate this for $T$ testcases. ###Input: - The first line contains an integer $T$ representing the number of testcases. - Next $T$ lines contain a single integer denoting $n$ for that testcase. ###Output: Output $T$ lines $i^{th}$ line containing the result of $i^{

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