Условие
From any positive n, the Collatz rule makes the next term n / 2 when n is even and 3n + 1 when n is odd, and the chain stops when it reaches 1. The chain for 6 is 6, 3, 10, 5, 16, 8, 4, 2, 1: nine terms. Among all starting numbers from 1 to limit, find the one with the most terms.
Implement longest_collatz_chain(limit).
Chains share their endings, so remembering the length found for each number saves a lot of work. Terms along the way can pass the limit; use 64-bit integers.
Input
limit: The largest starting number to try.
Output
Return the starting number whose chain has the most terms (counting the start and the final 1). If several tie, return the smallest of them.
Ограничения
1 ≤ limit ≤ 100,000
Примеры
Ввод:
limit = 6
Ожидаемый вывод:
expected = 6
Ввод:
long long limit = 6;
Ожидаемый вывод:
long long expected = 6;
Ввод:
long limit = 6;
Ожидаемый вывод:
long expected = 6;
Пояснение
The chain lengths for 1 to 6 are 1, 2, 8, 3, 6 and 9 terms, so the answer is 6.
Ввод:
limit = 10
Ожидаемый вывод:
expected = 9
Ввод:
long long limit = 10;
Ожидаемый вывод:
long long expected = 9;
Ввод:
long limit = 10;
Ожидаемый вывод:
long expected = 9;
Пояснение
9 gives 20 terms (9, 28, 14, 7, ...), more than any other start up to 10, so the answer is 9.
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Count the terms of one chain first, including the start and the 1.
Подсказка 2
When a chain reaches a number whose length you already know, add instead of continuing.
Подсказка 3
Only replace the best start when a length is strictly greater.
Ожидаемая сложность
O(limit × average new steps) time, O(limit) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.