From 2abf6310e945c12e3138493ac44004dc7e078196 Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 19 Apr 2021 18:21:32 -0400
Subject: 1st commit on 109_python

---
 challenge-109/stuart-little/python/ch-2.py | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100755 challenge-109/stuart-little/python/ch-2.py

(limited to 'challenge-109/stuart-little/python/ch-2.py')

diff --git a/challenge-109/stuart-little/python/ch-2.py b/challenge-109/stuart-little/python/ch-2.py
new file mode 100755
index 0000000000..c0dfbf495d
--- /dev/null
+++ b/challenge-109/stuart-little/python/ch-2.py
@@ -0,0 +1,21 @@
+#!/usr/bin/env python
+
+# run <script> <space-separated numbers>
+
+from itertools import permutations
+import string
+import sys
+
+def sumsEqNr(nr,ar,bl):
+    if (len(ar) <= 3):
+        return bl and (nr == sum(ar))
+    return sumsEqNr(nr,ar[2:],(bl and (nr == sum(ar[:3]))))
+
+def allSumsEq(ar):
+    return sumsEqNr(sum(ar[:2]),ar[1:],True)
+
+def pprnt(ar):
+    return "\nSolution: " + ", ".join([f"{c} = {v}" for (c,v) in list(zip(string.ascii_lowercase[:7],ar))]) + f"\nSum: {sum(ar[:2])}"
+
+sols = list(filter(allSumsEq,list(permutations(map(int, sys.argv[1:])))))
+print("No solution." if (not sols) else "\n".join(map(pprnt,sols)))
-- 
cgit