euler14

为正整数集合定义了以下迭代序列：

n → n /2 ( n是偶数)
n → 3 n + 1 ( n是奇数)

使用上面的规则并从 13 开始，我们生成以下序列：

13→40→20→10→5→16→8→4→2→1
可以看出，这个序列（从13开始到1结束）包含10项。虽然还没有被证明（Collat​​z 问题），但认为所有的起始数字都以 1 结束。

100 万以下的哪个起始数字产生最长的链？

注意：一旦链开始，条款就可以超过一百万。

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:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
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.

#include<iostream>
using namespace std;

int func(long long x){
	if(x == 1){
		return 1;
	} else if(x % 2 == 0){
		return func(x / 2) + 1;
	} else {
		return func(3 * x + 1) + 1;
	}
}

int main(){
	int ans, col = 1;
	for(int i = 2; i < 1000000; i++){
		int t = func(i);
		if( t > col){
			ans = i;
			col = t;
		}
	}
	cout << ans << "的序列是" << col << endl;
	return 0;
}