UVA 100 && HDU 1032 The 3n+1问题 （扑街题）

链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=36

叼伱个扑街，对呢道题真系无语，，提交5次都过唔到，唔相信既话，伱地可以试下啦。。。

偶噶代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#define MAXN 10005
#define RST(N)memset(N, 0, sizeof(N))
using namespace std;

int main()
{
    int n, m, Ms, Me;
    while(~scanf("%d%d", &n, &m)) {
        int res = 0;
        Ms = n, Me = m;
        if(n > m) { Ms = m, Me = n; }
        for(int i=Ms; i<=Me; i++) {
            int Mc = i, cnt = 1;
            while(Mc != 1) {
                if(Mc%2 == 1) Mc = Mc*3+1;
                else Mc /= 2;
                cnt++;
            }
            if(cnt > res) res = cnt;
        }
        printf("%d %d %d\n", n, m, res);
    }
    return 0;
}