hdu-1032-The 3n + 1 problem
2013-08-19 21:40
302 查看
#include<string.h>
int c[10000];
void fin(int t,int m,int a,int b)
{
int i,j,n,max;
memset(c,0,sizeof(c));
for(j=0,i=t;i<=m;i++)
{
n=i;
while(n!=1)
{
if(n&1)
n=3*n+1;
else n>>=1;
c[j]++;
}
j++;
}
max=0;
for(i=0;i<j;i++)
if(c[i]>max)
max=c[i];
printf("%d %d %d\n",a,b,max+1);
}
int main()
{
int a,b,t,m;
while(scanf("%d%d",&a,&b)!=EOF)
{
t=a<b?a:b;
m=a>=b?a:b;
fin(t,m,a,b);
}
return 0;
}
相关文章推荐
- 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(C++&学英语&水题)
- hdu 1032 && uva 100 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(水题,暴力)
- HDU 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem(水题)
- HDU1032-The 3n + 1 problem-水题压惊
- hdu 1032 The 3n + 1 problem (打表)