uva_100 - The 3n + 1 problem
2012-10-30 21:35
288 查看
/**这道题有一个陷阱,那就是输入的闭区间不一定是a<=b,可能a>b,而且输出时的闭区间顺序要和输入的顺序一样*/
#include <cstdio> #include <algorithm> using namespace std; int fun(int n) { int num(1); while(n>1) { num++; if(n%2!=0) { n = 3*n+1; continue; } n /= 2; } return num; } int main() { int a, b; int maxn; while(~scanf("%d %d",&a,&b)) { maxn = 0; int a1=a,b1=b; if(a>b) swap(a,b); for(int i=a; i<=b; i++) maxn = max(maxn, fun(i)); printf("%d %d %d\n",a1,b1,maxn); } return 0; }
相关文章推荐
- uva 100 The 3n + 1 problem (RMQ)
- UVa 100 - The 3n + 1 problem
- UVa 100 The 3n + 1 problem
- uva100—— The 3n + 1 problem
- uva----(100)The 3n + 1 problem
- uva100—— The 3n + 1 problem
- The 3n + 1 problem (Uva 100)
- uva 100 The 3n + 1 problem (递归)
- UVa 100 - The 3n + 1 problem(函数循环长度)
- UVa 100 / HDU 1032 / POJ 1207 The 3n + 1 problem (数论&Collatz序列周期)
- uva_100 The 3n + 1 problem( DP )
- The 3n + 1 problem UVA - 100
- UVa 100 - The 3n + 1 problem
- UVa 100 &&HDU 1032 The 3n + 1 problem【暴力统计】
- UVa——100 - The 3n + 1 problem(打表)
- UVA100 The 3n + 1 problem
- UVA - 100 - The 3n + 1 problem
- UVa 100 The 3n + 1 problem
- UVA 100 - The 3n + 1 problem
- UVA 100 - The 3n + 1 problem