poj 1207 3n+1

#include <stdio.h>

int count(int x)
{
	int value = 0;
	if(x == 1)
		return 1;
	else
	{
		while(x != 1)
		{
			if(x%2 == 0)
				x /=2;
			else
				x = 3*x + 1;
			value++;
		}
	}
	return value+1;
}
int main()
{
	int i,j;
	while((scanf("%d %d",&i,&j)) != EOF)
	{
		int temp_i = i,temp_j = j;
		if(i > j)
		{
			int temp;
			temp = i;
			i = j;
			j = temp;
		}
		int max_sum = -1,temp_sum = -1;
		int k;
		for(k=i;k<=j;k++)
		{
			temp_sum = count(k);
			if(temp_sum >max_sum)
				max_sum = temp_sum;
		}
		printf("%d %d %d\n",temp_i,temp_j,max_sum);
	}
	return 0;
}