【题目】
The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one million.
【翻译】以下迭代序列定义在整数集合上:
n -> n/2 (当n是偶数时)
n -> 3n + 1 (当n是奇数时)
应用以上规则,并且以数字13开始,我们得到以下序列:
可以看出这个以13开始以1结束的序列包含10个项。虽然还没有被证明(Collatz问题),但是人们认为在这个规则下,以任何数字开始都会以1结束。
以哪个不超过100万的数字开始,能给得到最长的序列?注意: 一旦序列开始之后,也就是从第二项开始,项是可以超过100万的。
【思路】
当计算13时,由于10的结果已经计算过了,我们可以提前将13之前的所有计算过的结果暂时保存下来,这样sum[13]=3+sum[10] 。
【代码】
void test14_1()
{
int cache[1000000];
memset(cache,0,sizeof(int)*1000000);
cache[1]=1;
int Max=1;
int Answer=1;
cout<<"ok"<<endl;
for( int i=2;i<1000000;i++)
{
unsigned int n=i;
int k=0;
while(n!=1 && n>=i)
{
if(n&1)
n=3*n+1;
else
n=n/2;
k++;
}
cache[i]=k+cache[n];
if(cache[i]>Max)
{
Max=cache[i];
Answer=i;
}
}
cout<<"Answer is "<<Answer<<endl;
}
【答案】运行程序,可得本题答案为:
837799