View Code of Problem 331

#include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int n,m;
	int a[10002];
	for(int i=1;i<=10000;i++){
		int d=0,k=i;
		while(k!=1){
			if(k%2==0)
			k/=2;
			else
			k=k*3+1;
			d++;
		}
		a[i]=d+1;
	}
	while(cin>>n>>m){
		int f=0;
		if(n>m){
			swap(n,m);
			f=1;
		}
		int minx=0;
		for(int i=n;i<=m;++i)
		if(a[i]>minx)
		minx=a[i];
		if(f)
		swap(n,m);
		printf("%d %d %d\n",n,m,minx);
	}
}