From 92d854cdca3019c5f60a81f23bef6bfeea97afa2 Mon Sep 17 00:00:00 2001
From: JoaoFelipe3 <109555243+JoaoFelipe3@users.noreply.github.com>
Date: Mon, 17 Oct 2022 11:01:24 -0300
Subject: Solved task 2 in Python

---
 challenge-187/joaofel/python/ch-2.py | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 challenge-187/joaofel/python/ch-2.py

(limited to 'challenge-187/joaofel/python/ch-2.py')

diff --git a/challenge-187/joaofel/python/ch-2.py b/challenge-187/joaofel/python/ch-2.py
new file mode 100644
index 0000000000..da55f3a25a
--- /dev/null
+++ b/challenge-187/joaofel/python/ch-2.py
@@ -0,0 +1,17 @@
+n = [2, 4, 3]
+maxsum = sum(sorted(n)[-3:])
+trips = []
+for ia, a in enumerate(n):
+    for ib, b in enumerate(n):
+        for ic, c in enumerate(n):
+            if ia == ib or ia == ic or ib == ic:
+                continue
+            l = [a + b, a + c, b + c, a + b + c]
+            if l[0] > c and l[1] > b and l[2] > a and maxsum == a + b + c:
+                trips.append([a, b, c])
+for trip in trips:
+    if trip[0] >= trip[1] >= trip[2]:
+        print(trip)
+        break
+else:
+    print([])
-- 
cgit