From a1a0939e3a029b61fe8d26e63a2e866f1659bb47 Mon Sep 17 00:00:00 2001
From: Paulo Custodio <pauloscustodio@gmail.com>
Date: Sun, 1 Sep 2024 12:13:18 +0100
Subject: Add Python solution to challenge 049

---
 challenge-049/paulo-custodio/python/ch-1.py | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 challenge-049/paulo-custodio/python/ch-1.py

(limited to 'challenge-049/paulo-custodio/python/ch-1.py')

diff --git a/challenge-049/paulo-custodio/python/ch-1.py b/challenge-049/paulo-custodio/python/ch-1.py
new file mode 100644
index 0000000000..edad0e1069
--- /dev/null
+++ b/challenge-049/paulo-custodio/python/ch-1.py
@@ -0,0 +1,27 @@
+#!/usr/bin/env python3
+
+# Challenge 049
+#
+# TASK #1
+# Smallest Multiple
+# Write a script to accept a positive number as command line argument and print
+# the smallest multiple of the given number consists of digits 0 and 1.
+#
+# For example:
+#
+# For given number 55, the smallest multiple is 110 consisting of digits 0 and 1.
+
+import re
+import sys
+
+def smallest_multiple(n):
+    p = 1
+    while not is_zeros_ones(n*p):
+        p += 1
+    return n*p
+
+def is_zeros_ones(n):
+    return re.search(r'^[01]+$', str(n))
+
+n = int(sys.argv[1])
+print(smallest_multiple(n))
-- 
cgit