p1207.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
using namespace std;
int F(int x){
    int res = 1;
    while(x != 1){
        if(x & 1) x = 3 * x + 1;
        else x >>= 1;
        ++res;
    }
    return res;
}
int main(){
    int f[10001];
    memset(f,0,sizeof(f));
    for(int i = 1;i <= 10000;++i)
        f[i] = F(i);
    int s,t;
    while(scanf("%d%d",&s,&t) != EOF){
        int ans(0);
        for(int i = min(s,t);i <= max(s,t);++i) ans = max(ans,f[i]);
        printf("%d %d %d\n",s,t,ans);
    }
}