From 301c90737674b9724be03fe7d25e5314cf406a04 Mon Sep 17 00:00:00 2001
From: Daniel Ingram <ingramds@appstate.edu>
Date: Wed, 14 Mar 2018 14:55:07 -0400
Subject: [PATCH] Dynamic programming solution to Problem 25

---
 Project Euler/Problem 25/sol1.py | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 Project Euler/Problem 25/sol1.py

diff --git a/Project Euler/Problem 25/sol1.py b/Project Euler/Problem 25/sol1.py
new file mode 100644
index 000000000..67185774d
--- /dev/null
+++ b/Project Euler/Problem 25/sol1.py	
@@ -0,0 +1,26 @@
+from __future__ import print_function
+
+def fibonacci(n):
+	if n == 1 or type(n) is not int:
+		return 0
+	elif n == 2:
+		return 1
+	else:
+		sequence = [0, 1]
+		for i in xrange(2, n+1):
+			sequence.append(sequence[i-1] + sequence[i-2])
+
+		return sequence[n]
+
+def fibonacci_digits_index(n):
+	digits = 0
+	index = 2
+
+	while digits < n:
+		index += 1
+		digits = len(str(fibonacci(index)))
+
+	return index
+
+if __name__ == '__main__':
+	print(fibonacci_digits_index(1000))
\ No newline at end of file