[Programming Challenge #1] 3n+1 문제

조금 쉽네요..
#include <iostream> using namespace std; int Get3n1Length(int v); int main() { int x, y; int a, b; int maxLength = 0; int c; while(cin >> x >> y) { b = x > y ? x : y; a = x < y ? x : y; maxLength = 0; for(int i = a; i <= b; i++) { c = Get3n1Length(i); if(maxLength < c) maxLength = c; } cout << x << " " << y << " " << maxLength << endl; } return 0; } int Get3n1Length(int v) { int t = v; int c = 1; while(t != 1) { if(t % 2 == 1) { //홀수 t = 3*t + 1; } else { //짝수 t = t / 2; } c++; } return c; }