Merge branch 'master' of https://github.com/manwar/perlweeklychallenge-club

2 files changed, 101 insertions, 0 deletions

diff --git a/challenge-270/lubos-kolouch/python/ch-1.py b/challenge-270/lubos-kolouch/python/ch-1.py
new file mode 100644
index 0000000000..08a785afbd
--- /dev/null
+++ b/challenge-270/lubos-kolouch/python/ch-1.py
@@ -0,0 +1,44 @@
+""" Perl Weekly Challenge 270 LK Task 1 Python """
+
+from typing import List
+
+
+def num_special_positions(matrix: List[List[int]]) -> int:
+    """
+    num_special_positions A position (i, j) is called special if $matrix[i][j] == 1 and all other elements in the row i and column j are 0.
+
+    Args:
+        matrix (List[List[int]]): input matrix
+
+    Returns:
+        int: count of special positions
+    """
+
+    rows = len(matrix)
+    cols = len(matrix[0])
+
+    def is_special(i: int, j: int) -> bool:
+        for x in range(rows):
+            if x != i and matrix[x][j] == 1:
+                return False
+        for y in range(cols):
+            if y != j and matrix[i][y] == 1:
+                return False
+        return True
+
+    special_count = 0
+    for i in range(rows):
+        for j in range(cols):
+            if matrix[i][j] == 1 and is_special(i, j):
+                special_count += 1
+
+    return special_count
+
+
+# Example 1
+matrix1 = [[1, 0, 0], [0, 0, 1], [1, 0, 0]]
+assert num_special_positions(matrix1) == 1
+
+# Example 2
+matrix2 = [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+assert num_special_positions(matrix2) == 3
diff --git a/challenge-270/lubos-kolouch/python/ch-2.py b/challenge-270/lubos-kolouch/python/ch-2.py
new file mode 100644
index 0000000000..23a2d5062a
--- /dev/null
+++ b/challenge-270/lubos-kolouch/python/ch-2.py
@@ -0,0 +1,57 @@
+def min_cost_to_equal_elements(ints, x, y):
+    min_cost = float("inf")
+    max_val = max(ints)
+    min_val = min(ints)
+
+    print(f"Initial array: {ints}")
+    print(f"Cost for Level 1 (x): {x}")
+    print(f"Cost for Level 2 (y): {y}")
+
+    # Try making all elements equal to every value between min_val and max_val
+    for target in range(min_val, max_val + 1):
+        cost = 0
+        print(f"\nTrying to make all elements equal to: {target}")
+
+        for num in ints:
+            diff = abs(target - num)
+            print(f"Difference for element {num} to target {target}: {diff}")
+
+            # Calculate cost using level 2 operations first, then level 1 if needed
+            if y < 2 * x:
+                # Using Level 2 operations where possible
+                level_2_ops = diff // 2
+                level_1_ops = diff % 2
+                cost_addition = (level_2_ops * y) + (level_1_ops * x)
+                print(
+                    f"Using Level 2 and Level 1. Cost to adjust {num} to {target}: {cost_addition}"
+                )
+            else:
+                # Using only Level 1 operations
+                cost_addition = diff * x
+                print(
+                    f"Using only Level 1. Cost to adjust {num} to {target}: {cost_addition}"
+                )
+
+            cost += cost_addition
+
+        print(f"Total cost to make all elements {target}: {cost}")
+        min_cost = min(min_cost, cost)
+
+    return min_cost
+
+
+# Example 1
+ints1 = [4, 1]
+x1 = 3
+y1 = 2
+print(
+    f"Minimum cost: {min_cost_to_equal_elements(ints1, x1, y1)}"
+)  # Expected Output: 9
+
+# Example 2
+ints2 = [2, 3, 3, 3, 5]
+x2 = 2
+y2 = 1
+print(
+    f"Minimum cost: {min_cost_to_equal_elements(ints2, x2, y2)}"
+)  # Expected Output: 6