Update sol1.py

Author: MaximSmolskiy

Diff for: project_euler/problem_122/sol1.py

@@ -29,14 +29,10 @@
 Find sum_{k = 1}^200 m(k).
 
 It uses the fact that for rather small n, applicable for this problem, the solution
-for each number
-can be formed by increasing the largest element.
+for each number can be formed by increasing the largest element.
 
 References:
 - https://en.wikipedia.org/wiki/Addition_chain
-
->>> solution(14)
-45
 """
 
 
@@ -71,6 +67,8 @@ def solution(n: int = 200) -> int:
     0
     >>> solution(2)
     1
+    >>> solution(14)
+    45
     >>> solution(15)
     50
     """