|
|
SPOJ Problem Set (classical)
515. Collatz
Problem code: CLTZ
|
Let N be a positive integer, Consider the following recurrence:
f(1) = N and
f(K) = (0.5 + 2.5 * (f(K-1) mod 2)) * f(K-1) + (f(K-1) mod 2) if K>1.
For a given N you have to compute the smallest L for which f(L)=1 (such an L always exists for N's in the input).
Input
Each line contains a positive integer N in decimal notation.
You can be sure that N and all intermediate results are not
bigger than 10^1888. Input terminated by EOF.
Output
For each number N in the input print one line with the value of L in decimal notation.
Example
Input:
1
2
321
1111111111111
111111111111111111111111111111111111111111111111111111111111
Output:
1
2
25
261
1296
| Added by: | Noszály Csaba |
| Date: | 2005-04-25 |
| Time limit: | 8s
|
| Source limit: | 18000B |
| Languages: | All except: C++ 4.3.2 C99 strict CLOJ ERL F# GO JS PERL 6 PYTH 3.1.2 SCALA TCL TECS |
| Resource: | Folklore |
|
|
|
|
RSS