From 1fba61b1b3b2804a16ab2f4052a8b67a01490dcf Mon Sep 17 00:00:00 2001 From: Mohammad S Anwar Date: Tue, 21 Nov 2023 10:59:23 +0000 Subject: - Added solutions by Eric Cheung. - Added solutions by Laurent Rosenfeld. - Added solutions by Ulrich Rieke. - Added solutions by E. Choroba. - Added solutions by Luca Ferrari. - Added solutions by Niels van Dijke. - Added solutions by W. Luis Mochan. - Added solutions by David Ferrone. - Added solutions by Peter Meszaros. - Added solutions by Steven Wilson. - Added solutions by Thomas Kohler. - Added solutions by Adam Russell. - Added solutions by Humbeto Massa. - Added solutions by Mark Anderson. - Added solutions by Dave Jacoby. - Added solutions by PokGoPun. - Added solutions by Matthew Neleigh. --- challenge-244/eric-cheung/python/ch-2.py | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100755 challenge-244/eric-cheung/python/ch-2.py (limited to 'challenge-244/eric-cheung/python/ch-2.py') diff --git a/challenge-244/eric-cheung/python/ch-2.py b/challenge-244/eric-cheung/python/ch-2.py new file mode 100755 index 0000000000..637dcacca2 --- /dev/null +++ b/challenge-244/eric-cheung/python/ch-2.py @@ -0,0 +1,19 @@ + +## Ref. +## https://stackoverflow.com/questions/1482308/how-to-get-all-subsets-of-a-set-powerset + +from itertools import chain, combinations + +def GetPowerSet(arrInput): + return list(chain.from_iterable(combinations(arrInput, rLoop) for rLoop in range(1, len(arrInput) + 1))) + +arrNum = [2, 1, 4] ## Example 1 + +nSum = 0 + +for arrLoop in GetPowerSet(arrNum): + nMax = max(arrLoop) + nMin = min(arrLoop) + nSum = nSum + nMax * nMax * nMin + +print (nSum) -- cgit