hdu 1032 The 3n + 1 problem
2014-01-03 22:56
260 查看
#include<stdio.h> int main() { int n,m,i,t,j,s; while(scanf("%d%d",&n,&m)!=EOF) { printf("%d %d ",n,m); i=n<m?n:m; m=n<m?m:n;//题目里没说输入的n,m的大小,要先判断,坑啊 for(s=0;i<=m;i++) { j=i; t=1; while(j!=1) { if(j%2) j=3*j+1; else j=j>>1; t++; } if(t>s) s=t; } printf("%d\n",s); } return 0; }
相关文章推荐
- HDU 1032 The 3n + 1 problem
- HDU-1032-The 3n + 1 problem
- HDU1032:The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- 杭电 HDU 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem (数学)
- 【HDU】1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- hdu——1032——The 3n + 1 problem
- hdu1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU1032 The 3n + 1 problem循环次数
- hdu 1032 The 3n + 1 problem
- POJ 1207 && HDU 1032 The 3n + 1 problem(水~)
- hdu-1032-The 3n + 1 problem
- UVa 100 &&HDU 1032 The 3n + 1 problem【暴力统计】