Triangle Series

CodeChefOpen on judge ↗

There is a series which represents the levels of triangle. 1 3 6 10 15 21 28...... and so on. Suppose there is triangle of level 1 and it can be formed by 1 star("*"), Triangle of level 2 is formed by 3 stars, similarly the Triangle of level 5 can be formed by using 15 stars. Your job to find the least number from the series which can have n(input) factors excluding the number itself. For Example:

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