Weird Algorithm

CSESIntroductory ProblemsOpen on judge ↗

Consider an algorithm that takes n: if n is even divide by 2, if odd multiply by 3 and add 1, repeat until n=1. Print the sequence.

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