UVA100

//100#include"iostream"#include"algorithm"#include"vector"#include"map"#include"string"#include"cctype"#include"deque"#include"queue"#include"stack"#include"cstdio"#include"cmath"#include"set"#include"sstream"using namespace std;int main() //这题也是够了。。。{//freopen("a.txt","r",stdin);int s,t;while(scanf("%d%d",&s,&t)==2){int ss=s,tt=t; //输出时候按原样输出if(s>t)      //交换 他给的数据不一定按顺序swap(s,t);int k;int i;int man=0;for(i=s;i<=t;i++){k=0;++k;long long int per=i;//防止溢出while(per!=1){if(per%2){per=3*per+1;++k;}else {per/=2;++k;}}if(k>man) man=k;}printf("%d %d %d\n",ss,tt,man);}return 0;}/*1 10100 200201 210900 1000*/