POJ1207 UVA100 The 3n+1 problem

//2_4_2:	The 3n+1 problem NP问题 POJ1207 UVA100
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
	int a,b,i,j,min,max,ans,time;
	while(scanf("%d %d",&a,&b) != EOF)
	{
		if(a > b)
		{
			max = a;
			min = b;
		}
		else 
		{
			max = b;
			min = a;
		}
		ans = 0;
		for(i = min;i <= max;i ++)
		{
			j = i;
			time = 1;
			while(j != 1)
			{
				if(j % 2 == 0)	j /= 2;
				else			j = j * 3 + 1;
				time ++;
			}
			if(time > ans)	ans = time;
		}
		printf("%d %d %d\n",a,b,ans);
	}
	return 0;
}
/*测试结果：通过POJ1207 UVA100检测
1 2
1 2 2
1 10
1 10 20
100 200
100 200 125
201 210
201 210 89
900 1000
900 1000 174
^Z
请按任意键继续. . .
*/