aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMohammad S Anwar <Mohammad.Anwar@yahoo.com>2022-10-17 17:13:52 +0100
committerGitHub <noreply@github.com>2022-10-17 17:13:52 +0100
commit877e277d2da6212cbba657d1489deb2ec04b2b1d (patch)
tree1d5fcd5b30d5c877b03878ffcef4e2438634237c
parenta6e88ee09499cb083634a20c13f10f3dbc7ad73e (diff)
parent92d854cdca3019c5f60a81f23bef6bfeea97afa2 (diff)
downloadperlweeklychallenge-club-877e277d2da6212cbba657d1489deb2ec04b2b1d.tar.gz
perlweeklychallenge-club-877e277d2da6212cbba657d1489deb2ec04b2b1d.tar.bz2
perlweeklychallenge-club-877e277d2da6212cbba657d1489deb2ec04b2b1d.zip
Merge pull request #6925 from JoaoFelipe3/master
Solved task 2 in Python
-rw-r--r--challenge-187/joaofel/python/ch-2.py17
1 files changed, 17 insertions, 0 deletions
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([])