問題
The Fibonacci sequence starts F(1) = 1, F(2) = 1, and each next term is the sum of the two before it: 1, 1, 2, 3, 5, 8, 13, 21, ... Find where the sequence first reaches n decimal digits. The terms soon outgrow 64-bit integers, so add them as digit arrays if your language has no big integers.
Implement fibonacci_with_n_digits(n).
Input
n: The number of digits.
Output
Return the index i of the first term F(i) with at least n digits. For n = 1 the answer is 1.
制約
1 ≤ n ≤ 1000
例
入力:
n = 2
期待される出力:
expected = 7
入力:
long long n = 2;
期待される出力:
long long expected = 7;
入力:
long n = 2;
期待される出力:
long expected = 7;
解説
F(6) = 8 has one digit and F(7) = 13 has two, so the answer is 7.
入力:
n = 4
期待される出力:
expected = 17
入力:
long long n = 4;
期待される出力:
long long expected = 17;
入力:
long n = 4;
期待される出力:
long expected = 17;
解説
F(16) = 987 and F(17) = 1597, so the answer is 17.
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Keep only the last two terms.
ヒント 2
Store each term as digits and add them with carries.
ヒント 3
Count the index as you go, starting from F(1) = 1.
目安の計算量
O(n²) time, O(n) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。