Switch to ruff check and ruff format

Author: kwj

python/GNUmakefile

@@ -1,5 +1,4 @@
 
-SRCS := .gitignore solve.py README.md
 SUBDIRS = euler tests
 
 .PHONY: usage
@@ -27,14 +26,11 @@ clean-all:
 
 .PHONY: lint
 lint:
-	flake8 .
-	isort --check --diff .
-	black --check --diff .
+	ruff check
 
 .PHONY: format
 format:
-	isort .
-	black .
+	ruff format --diff
 
 .PHONY: list
 list:

python/euler/bin/p0003.py

@@ -4,7 +4,8 @@
 
 
 def compute(num: int) -> str:
-    return str(factorize(num)[-1][0])  # [(b1,e1), (b2,e2), ...]  (b{i}<b{j} when i<j)
+    # [(b1,e1), (b2,e2), ...]  (b{i}<b{j} when i<j)
+    return str(factorize(num)[-1][0])
 
 
 def solve() -> str:

python/euler/bin/p0004.py

@@ -28,7 +28,7 @@ def compute(digits: int) -> str:
         if answer:
             return str(max(answer))
 
-    assert False, 'unreachable!'
+    raise RuntimeError('unreachable!')
 
 
 def solve() -> str:

python/euler/bin/p0011.py

@@ -4,7 +4,7 @@
 
 # fmt: off
 grid_arr = [
-    [ 8,  2, 22, 97, 38, 15,  0, 40,  0, 75,  4,  5,  7, 78, 52, 12, 50, 77, 91,  8],  # noqa: E201
+    [ 8,  2, 22, 97, 38, 15,  0, 40,  0, 75,  4,  5,  7, 78, 52, 12, 50, 77, 91,  8],
     [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48,  4, 56, 62,  0],
     [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30,  3, 49, 13, 36, 65],
     [52, 70, 95, 23,  4, 60, 11, 42, 69, 24, 68, 56,  1, 32, 56, 71, 37,  2, 36, 91],
@@ -18,12 +18,12 @@
     [16, 39,  5, 42, 96, 35, 31, 47, 55, 58, 88, 24,  0, 17, 54, 24, 36, 29, 85, 57],
     [86, 56,  0, 48, 35, 71, 89,  7,  5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
     [19, 80, 81, 68,  5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77,  4, 89, 55, 40],
-    [ 4, 52,  8, 83, 97, 35, 99, 16,  7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],  # noqa: E201
+    [ 4, 52,  8, 83, 97, 35, 99, 16,  7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
     [88, 36, 68, 87, 57, 62, 20, 72,  3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
-    [ 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18,  8, 46, 29, 32, 40, 62, 76, 36],  # noqa: E201
+    [ 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18,  8, 46, 29, 32, 40, 62, 76, 36],
     [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74,  4, 36, 16],
     [20, 73, 35, 29, 78, 31, 90,  1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57,  5, 54],
-    [ 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52,  1, 89, 19, 67, 48],  # noqa: E201
+    [ 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52,  1, 89, 19, 67, 48],
 ]
 # fmt: on
 
@@ -47,7 +47,7 @@ def product(row: int, col: int, dir: Dir) -> int:
             case Dir.DOWN_RIGHT:
                 v *= grid_arr[row + i][col + i]
             case _:
-                assert False, 'Direction Error'
+                raise AssertionError('Direction Error')
 
     return v
 

python/euler/bin/p0014.py

@@ -5,7 +5,8 @@ def compute(limit: int) -> str:
     cache = [0] * limit
     cache[1] = 1
 
-    for cur in range(limit // 2, limit):
+    for n in range(limit // 2, limit):
+        cur = n
         if cache[cur] != 0:
             continue
 

python/euler/bin/p0018.py

@@ -21,15 +21,13 @@
     [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57],
     [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48],
     [63, 66,  4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31],
-    [ 4, 62, 98, 27, 23,  9, 70, 98, 73, 93, 38, 53, 60,  4, 23]  # noqa
+    [ 4, 62, 98, 27, 23,  9, 70, 98, 73, 93, 38, 53, 60,  4, 23]
 ]
 # fmt: on
 
 
 def compute(fn: Callable[..., int], nums: list[list[int]]) -> str:
-    return str(
-        reduce(lambda x, y: list(map(add, map(fn, pairwise(x)), y)), reversed(nums))[0]
-    )
+    return str(reduce(lambda x, y: list(map(add, map(fn, pairwise(x)), y)), reversed(nums))[0])
 
 
 def solve() -> str:

python/euler/bin/p0021.py

@@ -6,9 +6,7 @@
 def compute(num: int) -> str:
     tbl = aliquot_sum_tbl(num - 1)
 
-    return str(
-        sum(x + tbl[x] for x in range(2, len(tbl)) if x > tbl[x] and tbl[tbl[x]] == x)
-    )
+    return str(sum(x + tbl[x] for x in range(2, len(tbl)) if x > tbl[x] and tbl[tbl[x]] == x))
 
 
 def solve() -> str:

python/euler/bin/p0026.py

@@ -28,7 +28,7 @@ def find_repetend_length(d: int) -> int:
         if pow(10, k, d) == 1:
             return k
 
-    assert False, 'unreachable!'
+    raise RuntimeError('unreachable!')
 
 
 def compute(limit: int) -> str:

python/euler/bin/p0027.py

@@ -29,9 +29,7 @@ def compute() -> str:
     max_len = 0
     max_tpl = (0, 0)
     for b in filter(lambda x: x < 1000, p_lst[1:]):
-        for a in map(
-            lambda x: x - b - 1, filter(lambda x: abs(x - b - 1) < 1000, p_lst)
-        ):
+        for a in map(lambda x: x - b - 1, filter(lambda x: abs(x - b - 1) < 1000, p_lst)):
             if (length := count_consecutive(a, b)) > max_len:
                 max_len = length
                 max_tpl = (a, b)

python/euler/bin/p0030.py

@@ -55,9 +55,7 @@ def aux(n: int) -> list[int]:
 
     # The chain.from_iterable() method is not used for readability here.
     for ndigits in range(2, 7):
-        for tpl in combinations_with_replacement(
-            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], ndigits
-        ):
+        for tpl in combinations_with_replacement([0, 1, 2, 3, 4, 5, 6, 7, 8, 9], ndigits):
             n = sum(map(lambda x: pow_tbl[x], tpl))
             if to_digit_tpl(n) == tpl:
                 acc += n