694 - The Collatz Sequence

来源:互联网 发布:产品进入淘宝首页 编辑:程序博客网 时间:2024/05/18 17:57
#include<stdio.h>
int collatz( long long m,long long n,intcount)
{
count++;
if(m==1) return count;
if(m>n) return--count;
if(m%2==0)
collatz(m/2,n,count);
else
collatz(m*3+1,n,count);
}
int main()
{
long long m,n;
int i=0,count=0;
while(1)
{
i++;
scanf("%lld%lld",&m,&n);
if(m<0&&n<0)break;
printf("Case %d: A = %lld, limit = %lld,",i,m,n);
printf("number of terms =%d\n",collatz(m,n,count));
}
return 0;
}
uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=635
0 0