1 files changed, 28 insertions, 0 deletions
diff --git a/challenge-067/paulo-custodio/python/ch-1.py b/challenge-067/paulo-custodio/python/ch-1.py
new file mode 100644
index 0000000000..2c0021ce8f
--- /dev/null
+++ b/challenge-067/paulo-custodio/python/ch-1.py
@@ -0,0 +1,28 @@
+#!/usr/bin/env python3
+
+# Challenge 067
+#
+# TASK #1 > Number Combinations
+# Submitted by: Mohammad S Anwar
+#
+# You are given two integers $m and $n. Write a script print all possible
+# combinations of $n numbers from the list 1 2 3 ... $m.
+#
+# Every combination should be sorted i.e. [2,3] is valid combination but [3,2] is not.
+#
+# Example:
+#   Input: $m = 5, $n = 2
+#
+#   Output: [ [1,2], [1,3], [1,4], [1,5], [2,3], [2,4], [2,5], [3,4], [3,5], [4,5] ]
+
+import sys
+from itertools import combinations
+
+m, n = map(int, sys.argv[1:3])
+m_list = list(range(1, m + 1))
+out = set()
+
+for combo in combinations(m_list, n):
+    out.add(str(sorted(combo)))
+
+print("[", ", ".join(sorted(out)), "]")