From 6e22b3bdd5926fff57ff7b823fd872ce24e403a7 Mon Sep 17 00:00:00 2001 From: "joan.rosellr" Date: Wed, 7 Oct 2020 14:10:46 +0200 Subject: [PATCH 1/4] fix code style in problem 76 Signed-off-by: joan.rosellr --- project_euler/problem_76/sol1.py | 23 ++++++++++++----------- 1 file changed, 12 insertions(+), 11 deletions(-) diff --git a/project_euler/problem_76/sol1.py b/project_euler/problem_76/sol1.py index ed0ee6b507e9..fdae983a19b2 100644 --- a/project_euler/problem_76/sol1.py +++ b/project_euler/problem_76/sol1.py @@ -16,25 +16,26 @@ """ -def partition(m): - """Returns the number of different ways one hundred can be written as a sum +def solution(m=100) -> int: + """ + Returns the number of different ways one hundred can be written as a sum of at least two positive integers. - >>> partition(100) + >>> solution(100) 190569291 - >>> partition(50) + >>> solution(50) 204225 - >>> partition(30) + >>> solution(30) 5603 - >>> partition(10) + >>> solution(10) 41 - >>> partition(5) + >>> solution(5) 6 - >>> partition(3) + >>> solution(3) 2 - >>> partition(2) + >>> solution(2) 1 - >>> partition(1) + >>> solution(1) 0 """ memo = [[0 for _ in range(m)] for _ in range(m + 1)] @@ -51,4 +52,4 @@ def partition(m): if __name__ == "__main__": - print(partition(int(str(input()).strip()))) + print(solution()) From 323453966eee22d95d77bb20629692a3f7917bdd Mon Sep 17 00:00:00 2001 From: Dhruv Date: Wed, 7 Oct 2020 18:56:02 +0530 Subject: [PATCH 2/4] Update sol1.py --- project_euler/problem_76/sol1.py | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/project_euler/problem_76/sol1.py b/project_euler/problem_76/sol1.py index fdae983a19b2..43e92845c507 100644 --- a/project_euler/problem_76/sol1.py +++ b/project_euler/problem_76/sol1.py @@ -1,6 +1,6 @@ """ Counting Summations -Problem 76 +Problem 76: https://projecteuler.net/problem=76 It is possible to write five as a sum in exactly six different ways: @@ -16,10 +16,10 @@ """ -def solution(m=100) -> int: +def solution(m: int = 100) -> int: """ - Returns the number of different ways one hundred can be written as a sum - of at least two positive integers. + Returns the number of different ways the number m can be written as a + sum of at least two positive integers. >>> solution(100) 190569291 From 1a13262580c39b6766479637b87968a2aee62b84 Mon Sep 17 00:00:00 2001 From: Dhruv Date: Wed, 7 Oct 2020 18:59:05 +0530 Subject: [PATCH 3/4] Update sol1.py --- project_euler/problem_76/sol1.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/project_euler/problem_76/sol1.py b/project_euler/problem_76/sol1.py index 43e92845c507..4cee6d7f6c3f 100644 --- a/project_euler/problem_76/sol1.py +++ b/project_euler/problem_76/sol1.py @@ -52,4 +52,4 @@ def solution(m: int = 100) -> int: if __name__ == "__main__": - print(solution()) + print(solution(int(input("Enter a number: ").strip()))) From a7d2d0402c292701d31a6991cca159e676328af3 Mon Sep 17 00:00:00 2001 From: Dhruv Date: Wed, 7 Oct 2020 19:00:48 +0530 Subject: [PATCH 4/4] Remove trailing whitespace --- project_euler/problem_76/sol1.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/project_euler/problem_76/sol1.py b/project_euler/problem_76/sol1.py index 4cee6d7f6c3f..60bb87089e7e 100644 --- a/project_euler/problem_76/sol1.py +++ b/project_euler/problem_76/sol1.py @@ -18,7 +18,7 @@ def solution(m: int = 100) -> int: """ - Returns the number of different ways the number m can be written as a + Returns the number of different ways the number m can be written as a sum of at least two positive integers. >>> solution(100)