Added UI

Author: surrsurus

README.md

@@ -1,2 +1,20 @@
 # enterprise-fibonacci
-Find the nth value of the fibonacci series
+Find the nth value of the fibonacci series. Suitable for enterprise solutions.
+
+# How to Use
+- Run fib.py in terminal (linux) or the IDLE (windows)
+- Enter valid integer from 1 - ∞ (not inclusive of ∞)
+
+# FAQs
+
+#### Q: Why should I use this fibonacci generator?
+
+A: It is *enterprise quality*, meaning that when you run fib.py, you aren't just getting a fibonacci generator using tuple unpacking or some other dumb technology list comprehension, you're only getting the best of a tried and true robust framework suitable for production code.
+
+#### Q: Why is this repo so large? 30 Mb seems like a lot.
+
+A: As mentioned before, this isn't something thrown together in 2 seconds for Project Euler, this is a robust, modular framework for fibonacci generation. And remember: *Bigger means more enterprise*.
+
+#### Q: Is this reflective of your acutal coding ability?
+
+A: This is just a joke. I swear.

src/lib/fib/generator.py

@@ -226,7 +226,8 @@ def solve(self):
 
             elif equalToSym(s, '.'):
                 try:
-                    self.l.log(toInt(int(chr(self.d.get(self.h.get().getInt())))))
+                    if self.l.log(toInt(int(chr(self.d.get(self.h.get().getInt()))))):
+                        break
                 except:
                     pass
 

src/lib/fib/solver/logTracker.py

@@ -14,4 +14,5 @@ def log(self, integer):
         self.p = toInt(plus(self.p, self.c.getOne()))
         if equalTo(self.p, self.n):
             print(integer.getInt())
-            exit(0)
+            return True
+        return False

src/main.py

@@ -3,6 +3,6 @@
 
 def main():
     c = Const()
-    g = Generator(5)
+    g = Generator(int(input('Fibonacci: ')))
     # print('---')
     g.solve()