uva100 3+1

最新推荐文章于 2022-01-16 16:13:21 发布

BEconfidence

最新推荐文章于 2022-01-16 16:13:21 发布

阅读量507

点赞数

分类专栏： UVA

本文链接：https://blog.csdn.net/a197p/article/details/43454127

版权

UVA 专栏收录该内容

232 篇文章 2 订阅

订阅专栏

#include<iostream>
#include<map>
using namespace std;
std::map<int, int> g_Tb1;

int CycleLength(int n){
    int &cl = g_Tb1[n];
    if(cl == 0){
        n = (n % 2 == 0) ? (n / 2) : (3 * n + 1);
        cl = 1 + CycleLength(n);
    }
    return cl;
}

int main()
{
    g_Tb1[1] = 1;
    for(int nBeg, nEnd; cin >> nBeg >> nEnd;) {
        int nOrgBeg = nBeg, nOrgEnd = nEnd, nMaxLen = 1;
        if(nBeg > nEnd) swap(nBeg, nEnd);
        for(int i = nBeg, nLen; i <= nEnd; ++i, nLen = 1) {
            nLen = CycleLength(i);
            if(nLen > nMaxLen) nMaxLen = nLen;
        }
        cout << nOrgBeg << " " << nOrgEnd << " " << nMaxLen << endl;
    }
    return 0;
}