👕 fix lint

algorithm_libraries/python/basic/bit_full_search.py

@@ -11,9 +11,9 @@ def bit_full_search(max_bit: int) -> Iterator[List[int]]:
     Yields:
         Iterator[List[int]]: max_bitの長さの0/1の組み合わせ
     """
-    for i in range(2 ** max_bit):
+    for i in range(2**max_bit):
         bit_list = [0 for _ in range(max_bit)]
         for j in range(max_bit):
-            if i & (2 ** j) > 0:
+            if i & (2**j) > 0:
                 bit_list[max_bit - j - 1] = 1
         yield bit_list

algorithm_libraries/python/basic/sample_generator.py

@@ -1,11 +1,11 @@
 import random
 
 MIN0 = 0
-MIN5 = -(10 ** 5)
-MIN9 = -(10 ** 9)
-MAX5 = 10 ** 5
-MAX9 = 10 ** 9
-MAX18 = 10 ** 18
+MIN5 = -(10**5)
+MIN9 = -(10**9)
+MAX5 = 10**5
+MAX9 = 10**9
+MAX18 = 10**18
 
 
 def int_generator(min_value: int = MIN0, max_value: int = MAX5) -> int:
@@ -21,9 +21,9 @@ def pair_generator(
 if __name__ == "__main__":
     f = open("sample.txt", "w", encoding="UTF-8")
     datalist = []
-    n = int_generator(1, 5 * 10 ** 5)
+    n = int_generator(1, 5 * 10**5)
     k = int_generator(1, n)
-    q = int_generator(1, 5 * 10 ** 5)
+    q = int_generator(1, 5 * 10**5)
     datalist.append(f"{n} {k} {q}\n")
     for _ in [0] * q:
         x, y = pair_generator(1, n, 0, MAX9)

algorithm_libraries/python/data_structure/RMQ.py

@@ -53,7 +53,7 @@ def query_min(self, p: int, q: int) -> int:
         return res
 
 
-e = (2 ** 31) - 1
+e = (2**31) - 1
 rmq = RMQ(n, e)
 
 for _ in range(q):

algorithm_libraries/python/data_structure/predecessor_problem.py

@@ -5,8 +5,8 @@ class SegTree:
     def __init__(self, n: int, mode: str = "min") -> None:
         self.mode = mode
         unit_elements = {
-            "min": 10 ** 13,
-            "max": -(10 ** 13),
+            "min": 10**13,
+            "max": -(10**13),
         }
         self.e = unit_elements[self.mode]  # 単位元
         self.tree_size = 2 ** (n - 1).bit_length()  # n以上の最小の2のべき乗数

algorithm_libraries/python/data_structure/segtree.py

@@ -6,8 +6,8 @@ class SegTree:
     def __init__(self, n: int, mode: str = "min") -> None:
         self.mode = mode
         unit_elements = {
-            "min": 10 ** 13,
-            "max": -(10 ** 13),
+            "min": 10**13,
+            "max": -(10**13),
             "sum": 0,
             "mul": 1,
             "gcd": 0,
@@ -17,7 +17,7 @@ def __init__(self, n: int, mode: str = "min") -> None:
         self.tree_value = [self.e] * 2 * self.tree_size
 
     def __str__(self) -> str:
-        if self.tree_size > 2 ** 4:
+        if self.tree_size > 2**4:
             return "Segtree size too big"
         out = ""
         i = 0

algorithm_libraries/python/data_structure/segtree_kai.py

@@ -7,20 +7,20 @@ def __init__(self, n: int, mode: str = "min") -> None:
         self.n = n
         self.mode = mode
         unit_elements = {
-            "min": 2 ** 31 - 1,
-            "max": -(10 ** 13),
+            "min": 2**31 - 1,
+            "max": -(10**13),
             "sum": 0,
             "mul": 1,
             "gcd": 0,
         }
         self.e = unit_elements[self.mode]  # 単位元
         self.lv = (self.n - 1).bit_length()
-        self.tree_size = 2 ** self.lv  # n以上の最小の2のべき乗数
+        self.tree_size = 2**self.lv  # n以上の最小の2のべき乗数
         self.tree_value = [self.e] * (2 * self.tree_size)
         self.tree_lazy = [None] * (2 * self.tree_size)
 
     def __str__(self) -> str:
-        if self.tree_size > 2 ** 4:
+        if self.tree_size > 2**4:
             return "Segtree size too big"
         out = ""
         i = 0

algorithm_libraries/python/dp/traveling_salesman.py

@@ -1,5 +1,6 @@
 def traveling_salesman_dp(positions):
     INF = float("inf")
+
     def cost(pos1, pos2):
         x1, y1, z1 = pos1
         x2, y2, z2 = pos2
@@ -13,5 +14,7 @@ def cost(pos1, pos2):
         for j in range(n):
             for k in range(n):
                 if i & (1 << k) == 0:
-                    dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + cost(positions[j], positions[k]))
-    return dp[-1][0]
+                    dp[i | (1 << k)][k] = min(
+                        dp[i | (1 << k)][k], dp[i][j] + cost(positions[j], positions[k])
+                    )
+    return dp[-1][0]

algorithm_libraries/python/graph/bfs.py

@@ -3,7 +3,7 @@
 
 
 class BreadthFirstSearch:
-    """ 幅優先探索 """
+    """幅優先探索"""
 
     def __init__(
         self,

algorithm_libraries/python/graph/dfs.py

@@ -1,11 +1,11 @@
 import sys
 from typing import List, Tuple
 
-sys.setrecursionlimit(10 ** 7)
+sys.setrecursionlimit(10**7)
 
 
 class DepthFirsSearch:
-    """ 深さ優先探索 """
+    """深さ優先探索"""
 
     def __init__(
         self,

algorithm_libraries/python/graph/dinic.py

@@ -1,5 +1,6 @@
 from collections import deque
 
+
 class Dinic:
     # V: 頂点数, E: 辺数
     # O(V^2E)
@@ -49,7 +50,7 @@ def dfs(self, v: int, t: int, f: int) -> int:
 
     def flow(self, s: int, t: int) -> int:
         flow = 0
-        INF = 10 ** 9 + 7
+        INF = 10**9 + 7
 
         while self.bfs(s, t):
             (*self.it,) = map(iter, self.G)

algorithm_libraries/python/graph/ford_fulkerson.py

@@ -1,4 +1,6 @@
 INF = float("inf")
+
+
 class FordFulkerson:
     # Ford-Fulkerson algorithm
     # E: 辺の数,　F: 最大流量
@@ -39,7 +41,7 @@ def flow(self, s, t):
         f = INF
         N = self.N
         while f:
-            self.used = [0]*N
+            self.used = [0] * N
             f = self.dfs(s, t, INF)
             flow += f
-        return flow
+        return flow

algorithm_libraries/python/math/catalan_number.py

@@ -1,6 +1,6 @@
 class Facts:
     # O(max_num)
-    def __init__(self, max_num: int = 10 ** 5, p: int = 10 ** 9 + 7) -> None:
+    def __init__(self, max_num: int = 10**5, p: int = 10**9 + 7) -> None:
         self.p = p
         self.max_num = max_num * 2
         self.fact = [1] * (self.max_num + 1)

algorithm_libraries/python/math/combination.py

@@ -1,9 +1,9 @@
-MOD = 10 ** 9 + 7
+MOD = 10**9 + 7
 
 
 class Facts:
     # O(max_num)
-    def __init__(self, max_num: int = 10 ** 5, p: int = 10 ** 9 + 7) -> None:
+    def __init__(self, max_num: int = 10**5, p: int = 10**9 + 7) -> None:
         self.p = p
         self.max_num = max_num
         self.fact = [1] * (self.max_num + 1)

algorithm_libraries/python/math/counting_primes.py

@@ -4,8 +4,8 @@ def counting_primes(n: int) -> int:
         return 0
     elif n <= 3:
         return 2
-    v = int(n ** 0.5) - 1
-    while v ** 2 <= n:
+    v = int(n**0.5) - 1
+    while v**2 <= n:
         v += 1
     v -= 1
     smalls = [(i + 1) // 2 for i in range(v + 1)]

algorithm_libraries/python/math/fact_comb_perm.py

@@ -1,9 +1,9 @@
-MOD = 10 ** 9 + 7
+MOD = 10**9 + 7
 
 
 class Facts:
     # O(max_num)
-    def __init__(self, max_num: int = 10 ** 5, p: int = 10 ** 9 + 7) -> None:
+    def __init__(self, max_num: int = 10**5, p: int = 10**9 + 7) -> None:
         self.p = p
         self.max_num = max_num
         self.fact = [1] * (self.max_num + 1)

algorithm_libraries/python/math/flt.py

@@ -4,7 +4,7 @@ class FLT:
     a^(-1) = a^(m-2) mod p
     """
 
-    def __init__(self, mod: int = 10 ** 9 + 7) -> None:
+    def __init__(self, mod: int = 10**9 + 7) -> None:
         self.mod = mod
 
     def rep_sqr(self, base: int, k: int) -> int:
@@ -17,5 +17,5 @@ def rep_sqr(self, base: int, k: int) -> int:
         return ans
 
     def inv(self, a: int) -> int:
-        """ 逆元を取る """
+        """逆元を取る"""
         return self.rep_sqr(a, self.mod - 2)

algorithm_libraries/python/math/lcm_list_mod.py

@@ -10,7 +10,7 @@ class LCM_mod:
     因数の積を逐次余りに置き換えて最小公倍数を導出する.
     """
 
-    def __init__(self, max_num: int, p: int = 10 ** 9 + 7) -> None:
+    def __init__(self, max_num: int, p: int = 10**9 + 7) -> None:
         self.max_num = max_num + 1
         self.p = p
         self.prime = [0 for _ in range(self.max_num)]

algorithm_libraries/python/math/rep_pow.py

@@ -1,4 +1,4 @@
-def rep_pow(a: int, k: int, p: int = 10 ** 9 + 7) -> int:
+def rep_pow(a: int, k: int, p: int = 10**9 + 7) -> int:
     # calculate exponentiation: a^k mod p
     # O(log(p))
     ans = 1

algorithm_libraries/python/math/sieve_of_eratosthenes.py

@@ -8,7 +8,7 @@ def sieve_of_eratosthenes(
     is_prime_list = [True] * (n + 1)
     is_prime_list[0] = False
     is_prime_list[1] = False
-    for i in range(2, int(n ** 0.5) + 1):
+    for i in range(2, int(n**0.5) + 1):
         if not is_prime_list[i]:
             continue
         for j in range(i * 2, n + 1, i):

algorithm_libraries/test/sample_generator/data_structure/union_find.py

@@ -54,8 +54,8 @@ def group_count(self) -> int:
 
     sample_size = 10
 
-    n = random.randint(1, 2 * 10 ** 5)
-    q = random.randint(1, 2 * 10 ** 5)
+    n = random.randint(1, 2 * 10**5)
+    q = random.randint(1, 2 * 10**5)
     out = [f"{n} {q}"]
     ans = []
     for _ in range(q):

aoj/library/dpl/1/a.py

@@ -1,7 +1,7 @@
 n, m = map(int, input().split())
 c = list(map(int, input().split()))
 
-INF = 10 ** 9
+INF = 10**9
 MAX = n + 1
 dp = [INF for _ in range(MAX)]
 dp[0] = 0

aoj/library/dpl/1/d.py

@@ -3,7 +3,7 @@
 n = int(input())
 a = [int(input()) for _ in range(n)]
 
-INF = 10 ** 9
+INF = 10**9
 dp = [INF for _ in range(n)]
 dp[0] = a[0]
 

aoj/library/dpl/1/f.py

@@ -3,7 +3,7 @@
 vw = [(int(x[0]), int(x[1])) for x in vw]
 v_max = sum([x[0] for x in vw])
 
-INF = 10 ** 9 + 1
+INF = 10**9 + 1
 pdp = [INF for _ in range(v_max + 1)]
 cdp = [INF for _ in range(v_max + 1)]
 pdp[0] = 0

aoj/library/dsl/f.py

@@ -14,20 +14,20 @@ def __init__(self, n: int, mode: str = "min") -> None:
         self.n = n
         self.mode = mode
         unit_elements = {
-            "min": 2 ** 31 - 1,
-            "max": -(10 ** 13),
+            "min": 2**31 - 1,
+            "max": -(10**13),
             "sum": 0,
             "mul": 1,
             "gcd": 0,
         }
         self.e = unit_elements[self.mode]  # 単位元
         self.lv = (self.n - 1).bit_length()
-        self.tree_size = 2 ** self.lv  # n以上の最小の2のべき乗数
+        self.tree_size = 2**self.lv  # n以上の最小の2のべき乗数
         self.tree_value = [self.e] * (2 * self.tree_size)
         self.tree_lazy = [None] * (2 * self.tree_size)
 
     def __str__(self) -> str:
-        if self.tree_size > 2 ** 4:
+        if self.tree_size > 2**4:
             return "Segtree size too big"
         out = ""
         i = 0

aoj/library/ntl/1/b.py

@@ -1,4 +1,4 @@
-def rep_pow(a, k, p=10 ** 9 + 7):
+def rep_pow(a, k, p=10**9 + 7):
     # calculate exponentiation: a^k mod p
     ans = 1
     while k > 0:

atcoder/AGC/AGC043/a.py

@@ -2,7 +2,7 @@
 
 h, w = map(int, input().split())
 s = [[i for i in list(str(input()))] for i in range(h)]
-INF = 10 ** 9
+INF = 10**9
 dp = [[INF for _ in range(w)] for _ in range(h)]
 
 

atcoder/AGC/agc029/b.py

@@ -5,7 +5,7 @@
 
 candidates = []
 for i in range(1, 32):
-    candidates.append(2 ** i)
+    candidates.append(2**i)
 candidates.sort(reverse=True)
 
 counter = defaultdict(int)

atcoder/AGC/agc036/agc036_b.py

@@ -1,7 +1,7 @@
 n, k = map(int, input().split())
 a = list(map(int, input().split()))
-a_idx = [-1] * (2 * 10 ** 5)
-ans = [0] * (2 * 10 ** 5)
+a_idx = [-1] * (2 * 10**5)
+ans = [0] * (2 * 10**5)
 idx = 0
 for i in range(n * k):
     a_i = a[i % n]

atcoder/AGC/agc062/c.py

@@ -5,7 +5,7 @@
 
 
 def solve1(n, k, a):
-    max_a = 10 ** 5
+    max_a = 10**5
     dp = [[False] * (max_a) for _ in range(n + 1)]
     # dp[i][j] := i番目までの数を使ってjを作れるか
     dp[0][0] = True

atcoder/AGC/agc063/a.py

@@ -1,9 +1,10 @@
 from collections import deque
+
 n = int(input())
 s = list(input())
 a_list = []
 b_list = []
-INF = 10 ** 10
+INF = 10**10
 for i in range(len(s)):
     s_i = s[i]
     if s_i == "A":
@@ -44,4 +45,4 @@
     else:
         ans.append("Bob")
 
-print(*ans, sep="\n")
+print(*ans, sep="\n")