🥺chore

Author: hppRC

abc171/b/main.py

@@ -1,53 +0,0 @@
-#!usr/bin/env pypy3
-from collections import defaultdict, deque
-from heapq import heappush, heappop
-from itertools import permutations, accumulate
-import sys
-import math
-import bisect
-
-
-def LI(): return [int(x) for x in sys.stdin.readline().split()]
-
-
-def I(): return int(sys.stdin.readline())
-
-
-def LS(): return [list(x) for x in sys.stdin.readline().split()]
-
-
-def S():
-    res = list(sys.stdin.readline())
-    if res[-1] == "\n":
-        return res[:-1]
-    return res
-
-
-def IR(n):
-    return [I() for i in range(n)]
-
-
-def LIR(n):
-    return [LI() for i in range(n)]
-
-
-def SR(n):
-    return [S() for i in range(n)]
-
-
-def LSR(n):
-    return [LS() for i in range(n)]
-
-
-sys.setrecursionlimit(1000000)
-
-
-def main():
-    N, K = LI()
-    A = LI()
-    A.sort()
-
-    print(sum(A[:K]))
-
-
-main()

abc177/b/main.py

@@ -19,13 +19,13 @@ def LR(n): return [L() for _ in range(n)]
 def IR(n): return [I() for _ in range(n)]
 def LIR(n): return [LI() for _ in range(n)]
 def LIR1(n): return [LI1() for _ in range(n)]
-def SR(n): return [SL() for _ in range(n)]
+def SLR(n): return [SL() for _ in range(n)]
 def LSR(n): return [LS() for _ in range(n)]
 
 def perm(n, r): return math.factorial(n) // math.factorial(r)
 def comb(n, r): return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))
 
-def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if len(args) > 0 else [default for _ in range(n)]
+def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if args else [default for _ in range(n)]
 
 dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
 dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
@@ -37,7 +37,17 @@ def make_list(n, *args, default=0): return [make_list(*args, default=default) fo
 sys.setrecursionlimit(1000000)
 
 def main():
-    N = I()
+    S = SL()
+    T = SL()
+
+    ans = INF
+    for i in range(len(S)-len(T)+1):
+        cnt = 0
+        for j in range(len(T)):
+            if S[i+j] != T[j]:
+                cnt += 1
+        ans = min(ans, cnt)
+    print(ans)
 
 if __name__ == '__main__':
     main()