Commit 34a31c23 by Andrew Dahl

### Solved Problem 25

parent 934fed61
Showing with 55 additions and 0 deletions
 Question: The Fibonacci sequence is defined by the recurrence relation: Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1. Hence the first 12 terms will be: F1 = 1 F2 = 1 F3 = 2 F4 = 3 F5 = 5 F6 = 8 F7 = 13 F8 = 21 F9 = 34 F10 = 55 F11 = 89 F12 = 144 The 12th term, F12, is the first term to contain three digits. What is the first term in the Fibonacci sequence to contain 1000 digits? Answer: 4782
25/main.cpp 0 → 100644
 #include #include "../include/BigInteger.h" using namespace std; const int SIZE = 1000; int main() { BigInteger num ("1"); BigInteger num2 ("1"); int count = 0; for(count = 0; num.size() < SIZE && num2.size() < SIZE; count+=2) { num += num2; num2 += num; } if(num.size() >= SIZE) cout << count+1 << endl; else cout << count+2 << endl; return 0; }
 ... ... @@ -44,6 +44,11 @@ class BigInteger return *this; } int size() { return this->value.size(); } string toString() { stringstream ss; ... ...
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!