descriptive names

Author: kosuri-indu

project_euler/problem_095/sol1.py

@@ -4,28 +4,28 @@
 """
 
 
-def solution(n: int = 10**6) -> int:
+def solution(number : int = 10**6) -> int:
     """
     Returns the smallest member when n = 1000000
     >> 14316
     """
 
-    sum_of_div = [0] * (n + 1)
-    for i in range(1, n // 2 + 1):
-        for j in range(i * 2, n + 1, i):
+    sum_of_div = [0] * (number + 1)
+    for i in range(1, number // 2 + 1):
+        for j in range(i * 2, number + 1, i):
             sum_of_div[j] += i
 
-    checked = [False] * (n + 1)
+    checked = [False] * (number + 1)
     max_len_of_chain = 0
     result = 0
-    for i in range(2, n + 1):
+    for i in range(2, number + 1):
         possible_chain = []
         j = i
         while not checked[j]:
             checked[j] = True
             possible_chain.append(j)
             j = sum_of_div[j]
-            if j > n:
+            if j > number:
                 break
             if j in possible_chain:
                 len_of_chain = len(possible_chain) - possible_chain.index(j)