1032 The 3n + 1 problem

#include<iostream>
#include<vector>
using namespace std;

int main()
{
	int i, j, num, max,n;
	vector<int> v;
	while (cin >> i >> j)
	{
		num = 0;
		for (int g = i; g <= j; ++g)
		{
			n = g;
		eros: num++;
			if (n == 1)
			{
				v.push_back(num);
				num = 0;
				continue;
			}
			if (n % 2 == 1)
				n = 3 * n + 1;
			else n = n/2;
			goto eros;
		}
		max = v[0];
		for (int m = 1; m <= v.size() - 1; ++m)
		{
			if (v[m] > max)
				max = v[m];
		}
		cout << i << ' ' << j << ' ' << max << endl;
		v.clear();
	}
	return 0;
}