Beautiful Sequence

CodeChefOpen on judge ↗

Suppose we have the following sequences: $1$ $1, 2$ $1, 2, 3$ $1, 2, 3, 4$ and so on. If we join these sequences, we get $1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, ...$ Such a sequence is called a beautiful sequence. Given an integer $n$, your task is to find the position where it first occurs in the beautiful sequence. Input: - First line will contain $T$, number of testcases. The

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