From 8eab2f17f4e3378995b8ccdc8f547784e046fc31 Mon Sep 17 00:00:00 2001 From: Alok Shukla Date: Tue, 13 Aug 2019 22:46:11 +0530 Subject: [PATCH] Solution for Problem Euler 56 (#1131) * Solution for Euler 56 * Adding Type and Doctest as per guideline * removing unused import * correcting the way type check works --- project_euler/problem_56/__init__.py | 0 project_euler/problem_56/sol1.py | 26 ++++++++++++++++++++++++++ 2 files changed, 26 insertions(+) create mode 100644 project_euler/problem_56/__init__.py create mode 100644 project_euler/problem_56/sol1.py diff --git a/project_euler/problem_56/__init__.py b/project_euler/problem_56/__init__.py new file mode 100644 index 000000000..e69de29bb diff --git a/project_euler/problem_56/sol1.py b/project_euler/problem_56/sol1.py new file mode 100644 index 000000000..194a7a37a --- /dev/null +++ b/project_euler/problem_56/sol1.py @@ -0,0 +1,26 @@ + + +def maximum_digital_sum(a: int, b: int) -> int: + """ + Considering natural numbers of the form, a**b, where a, b < 100, + what is the maximum digital sum? + :param a: + :param b: + :return: + >>> maximum_digital_sum(10,10) + 45 + + >>> maximum_digital_sum(100,100) + 972 + + >>> maximum_digital_sum(100,200) + 1872 + """ + + # RETURN the MAXIMUM from the list of SUMs of the list of INT converted from STR of BASE raised to the POWER + return max([sum([int(x) for x in str(base**power)]) for base in range(a) for power in range(b)]) + +#Tests +if __name__ == "__main__": + import doctest + doctest.testmod()