Convergence

CodeChefOpen on judge ↗

Description Collatz conjecture states that a number $n$ converges to 1 on repeatedly performing the following operations a) $n \rightarrow n/2$ if n is even b) $n \rightarrow 3n+1$ if n is odd Input: A single integer $n$ Output: The number of steps taken for $n$ to converge to 1 by Collatz conjecture Constraints: $1 \leq n \leq 100$

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