100 - The 3n + 1 problem

#一開始設定一個function, 如果n != 1 的時候，一直進行while ，當 n==1 就break
#輸入n 和 m以後要按大小排列
#for i=n i<=m i++， 從n 到m 裡面，找出哪一個數字的 func(i) 是最大的，取最大值 max, 然後print

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<sstream>
using namespace std;
int cal(int n) {
	int answer = 1;
	while (n != 1) {
		if (n == 1) {
			break;
		}
		if (n % 2 == 1) {
			n = 3 * n + 1;
		}
		else {
			n = n / 2;
		}
		answer++;
	}
	return answer;
}
int main() {
	int a, b;
	while (cin >> a >> b) {
		cout<<a<<" "<<b<<" ";
		if (a > b) {
			swap(a, b);
		}
		int answer = 0, max = 0;
		for (int i = a; i <= b; i++) {
			answer = cal(i);
			if (answer > max) {
				max = answer;
			}
		}
		cout <<max << endl;
	}
}