We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8b244c0 commit e2a1efcCopy full SHA for e2a1efc
maths/sum_big_numbers.py
@@ -0,0 +1,12 @@
1
+def sum_big_numbers(first_number: int, second_number: int):
2
+ """
3
+ >>> sum_big_numbers(1234567891011121314151617181920, 2019181716151413121110987654321)
4
+ 3253749607162534435262604836241
5
6
+ return first_number + second_number
7
+
8
9
+if __name__ == "__main__":
10
+ from doctest import testmod
11
12
+ testmod()
maths/sum_to_n_recursion.py
@@ -0,0 +1,16 @@
+def sum_to_n_recursion(number: int) -> int:
+ >>> sum_to_n_recursion(0)
+ 0
+ >>> sum_to_n_recursion(10)
+ 55
+ >>> sum_to_n_recursion(100)
+ 5050
+ return 0 if number == 0 else number + sum_to_n_recursion(number - 1)
13
14
15
16
0 commit comments