uva-100.py

#!/usr/bin/python3

# accepted

import sys


ll = 1000001
arr = [0] * ll
arr[0], arr[1] = 0, 1


def cycle_length(a, count=1):
    if a == 1:
        return count
    if a < ll and arr[a]:
        return count+arr[a]-1
    if not (a & 1):
        return cycle_length(a//2, count+1)
        
    return cycle_length((3*a)+1, count+1)


for i in range(2, ll):
    if not arr[i]:
        c = cycle_length(i)
        arr[i] = c
        p = i + i
        while (p < ll):
            c += 1
            # if not arr[p]:  arr[p] = c
            arr[p] = c
            p += p


for line in sys.stdin:
    i, j = map(int, line.split())
    maxim = -1
    for p in range(min(i,j), max(i,j)+1):
        maxim = max(maxim, arr[p])
    print(i, j, maxim)