Checkpoint experiments through SWE pilot v2

results/board-interface-v2-sept8/final-export/episode-004/final-func.py

@@ -0,0 +1,55 @@
+def count_beautiful_integers(low: int, high: int, k: int) -> int:
+    """ Count the number of beautiful integers in the range [low, high].
+    
+    A number is beautiful if it meets both conditions:
+    1. The count of even digits equals the count of odd digits
+    2. The number is divisible by k
+    
+    Args:
+        low: Lower bound of the range (inclusive), 0 < low <= high <= 10^9
+        high: Upper bound of the range (inclusive)
+        k: Divisor to check, 0 < k <= 20
+    
+    Returns:
+        The count of beautiful integers in the given range
+    
+    >>> count_beautiful_integers(10, 20, 3)
+    2
+    >>> count_beautiful_integers(1, 10, 1)
+    1
+    >>> count_beautiful_integers(5, 5, 2)
+    0
+    """
+
+    def count_upto(n: int) -> int:
+        if n <= 0:
+            return 0
+        digits = list(map(int, str(n)))
+        L = len(digits)
+        from functools import lru_cache
+
+        @lru_cache(maxsize=None)
+        def dp(pos, balance, mod, started, tight):
+            if pos == L:
+                if not started:
+                    # the number 0 itself (not a positive integer)
+                    return 0
+                return 1 if (balance == 0 and mod == 0) else 0
+            limit = digits[pos] if tight else 9
+            total = 0
+            for d in range(limit + 1):
+                ntight = tight and (d == limit)
+                if not started and d == 0:
+                    total += dp(pos + 1, balance, mod, False, ntight)
+                else:
+                    if d % 2 == 0:
+                        nb = balance + 1
+                    else:
+                        nb = balance - 1
+                    nmod = (mod * 10 + d) % k
+                    total += dp(pos + 1, nb, nmod, True, ntight)
+            return total
+
+        return dp(0, 0, 0, False, True)
+
+    return count_upto(high) - count_upto(low - 1)