From 40125a7671e65336f2b00e5dd385015ea62d51f3 Mon Sep 17 00:00:00 2001 From: Mohammad S Anwar Date: Mon, 8 Jul 2024 14:38:44 +0100 Subject: - Added solutions by Eric Cheung. - Added solutions by Ulrich Rieke. - Added solutions by PokGoPun. - Added solutions by Niels van Dijke. - Added solutions by Mark Anderson. - Added solutions by Feng Chang. --- challenge-277/eric-cheung/python/ch-2.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100755 challenge-277/eric-cheung/python/ch-2.py (limited to 'challenge-277/eric-cheung/python/ch-2.py') diff --git a/challenge-277/eric-cheung/python/ch-2.py b/challenge-277/eric-cheung/python/ch-2.py new file mode 100755 index 0000000000..72b8faa3f6 --- /dev/null +++ b/challenge-277/eric-cheung/python/ch-2.py @@ -0,0 +1,16 @@ + +from itertools import combinations + +def IsStrongPair (arrInput): + if abs(arrInput[0] - arrInput[1]) > 0 and min(arrInput) > abs(arrInput[0] - arrInput[1]): + return True + return False + +## arrInt = [1, 2, 3, 4, 5] ## Example 1 +arrInt = [5, 7, 1, 7] ## Example 2 + +arrComb = combinations(arrInt, 2) + +arrOutput = [arrLoop for arrLoop in list(set(arrComb)) if IsStrongPair(arrLoop)] + +print (len(arrOutput)) -- cgit