p2 sol2 fixed (#669)

project_euler/problem_02/sol2.py

@@ -1,12 +1,15 @@
 def fib(n):
-    a, b, s = 0, 1, 0
+    """
-    while b < n:
+    Returns a list of all the even terms in the Fibonacci sequence that are less than n.
-        if b % 2 == 0 and b < n: s += b
+    """
-        a, b = b, a+b
-    ls.append(s)
-
-T = int(input().strip())
     ls = []
-for _ in range(T):
+    a, b = 0, 1
-    fib(int(input().strip()))
+    while b < n:
-print(ls, sep = '\n')
+        if b % 2 == 0:
+            ls.append(b)
+        a, b = b, a+b
+    return ls
+
+if __name__ == '__main__':
+    n = int(input("Enter max number: ").strip())
+    print(sum(fib(n)))