Fixes for issue 'Fix the LGTM issues #1024'.

Author: brunohadlich

project_euler/problem_02/sol4.py

@@ -11,7 +11,7 @@
 """
 from __future__ import print_function
 import math
-from decimal import *
+from decimal import Decimal, getcontext
 
 try:
     raw_input  # Python 2

project_euler/problem_03/sol1.py

@@ -28,18 +28,22 @@ def isprime(no):
 
 def solution(n):
     """Returns the largest prime factor of a given number n.
-    
+
     >>> solution(13195)
     29
     >>> solution(10)
     5
     >>> solution(17)
     17
+    >>> solution(0)
+    -1
     """
     maxNumber = 0
     if isprime(n):
         return n
     else:
+        if n <= 0:
+            return -1
         while n % 2 == 0:
             n = n / 2
         if isprime(n):
@@ -54,7 +58,6 @@ def solution(n):
                     elif isprime(i):
                         maxNumber = i
             return maxNumber
-    return int(sum)
 
 
 if __name__ == "__main__":

project_euler/problem_03/sol2.py

@@ -6,7 +6,6 @@
 e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17.
 """
 from __future__ import print_function, division
-import math
 
 try:
     raw_input  # Python 2

project_euler/problem_05/sol1.py

@@ -39,7 +39,6 @@ def solution(n):
             if i == 0:
                 i = 1
             return i
-            break
 
 
 if __name__ == "__main__":

project_euler/problem_07/sol2.py

@@ -7,7 +7,6 @@
 We can see that the 6th prime is 13. What is the Nth prime number?
 """
 from __future__ import print_function
-from math import sqrt
 
 try:
     raw_input  # Python 2

project_euler/problem_09/sol1.py

@@ -28,7 +28,6 @@ def solution():
                     if (a ** 2) + (b ** 2) == (c ** 2):
                         if (a + b + c) == 1000:
                             return a * b * c
-                            break
 
 
 if __name__ == "__main__":

project_euler/problem_19/sol1.py

@@ -61,4 +61,4 @@ def solution():
 
 
 if __name__ == "__main__":
-    print(solution(171))
+    print(solution())

project_euler/problem_234/sol1.py

@@ -40,7 +40,6 @@ def solution(n):
     semidivisible = []
     for x in range(n):
         l=[i for i in input().split()]
-        c1=0
         c2=1
         while(1):
             if len(fib(l[0],l[1],c2))<int(l[2]):