Merge branch 'project-euler' of https://github.com/Iqrar99/Python into project-euler

Author: Iqrar99

project_euler/problem_49/sol1.py

@@ -26,8 +26,8 @@
 3 nested loops since we know the answer will be 12 digits.
 """
 
-from math import sqrt, floor
 from itertools import permutations
+from math import floor, sqrt
 
 
 def is_prime(number: int) -> bool:
@@ -107,10 +107,14 @@ def solution():
         for i in range(length):
             for j in range(i + 1, length):
                 for k in range(j + 1, length):
-                    if abs(candidate[i] - candidate[j]) == abs(candidate[j] - candidate[k]) \
-                            and len(set([candidate[i], candidate[j], candidate[k]])) == 3:
+                    if (
+                        abs(candidate[i] - candidate[j])
+                        == abs(candidate[j] - candidate[k])
+                        and len(set([candidate[i], candidate[j], candidate[k]])) == 3
+                    ):
                         passed.append(
-                            sorted([candidate[i], candidate[j], candidate[k]]))
+                            sorted([candidate[i], candidate[j], candidate[k]])
+                        )
                         found = True
 
                     if found:

project_euler/problem_50/sol1.py

@@ -25,7 +25,7 @@
 Then, use sliding window to get the answer.
 """
 
-from math import sqrt, floor
+from math import floor, sqrt
 
 
 def is_prime(number: int) -> bool:
@@ -56,20 +56,20 @@ def solution():
     997651
     """
 
-    prime_list = [2] + [x for x in range(3, 10**6, 2) if is_prime(x)]
+    prime_list = [2] + [x for x in range(3, 10 ** 6, 2) if is_prime(x)]
 
     cumulative_sum = []
     tmp = 0
     for x in prime_list:
         tmp += x
-        if tmp < 10**6:
+        if tmp < 10 ** 6:
             cumulative_sum.append(tmp)
         else:
             break
 
     upper_limit_idx = 0
     for i in range(len(prime_list)):
-        if prime_list[i] < 10**6:
+        if prime_list[i] < 10 ** 6:
             upper_limit_idx = i
         else:
             break
@@ -96,5 +96,5 @@ def solution():
     return answer
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     print(solution())