hdoj-1032-The 3n + 1 problem(坑题)

 题目链接

//巨坑的一道题，输入的m,n要判断大小，输出还要按照原来的顺序，范围还是i<=n<=j

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int alro(int x) {
    int ct = ;
    while (x != ) {
        if (x & ) x = *x+;
        else x = x/;
        ct++;
    }
    return ct;
}
int main() {
    int m,n;
    while (cin>>m>>n) {
        int sm = min(m ,n);
        int lar = max(m ,n);
        int maxn = ;
        for (int i=sm; i<=lar; i++) {
            maxn = max(alro(i), maxn);
        }
        printf("%d %d %d\n", m, n, maxn);
    }
    return ;
}