problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02571 | s866321066 | Accepted |
def process():
s = input()
t = input()
ls, lt = len(s), len(t)
minchanges = float("inf")
for i in range(ls-lt+1):
changes = 0
for j in range(lt):
changes += 0 if s[i+j] == t[j] else 1
if changes > minchanges:
break
if changes == 0:
return 0
#print(i, changes)
minchanges = min(minchanges, changes)
return minchanges
print(process()) |
p02571 | s746738294 | Accepted | s = input()
t = input()
ans = 100000
n = len(s)
m = len(t)
for i in range(n - m + 1):
temp = s[i:i + m]
count = 0
for a, b in zip(temp, t):
if a != b:
count += 1
ans = min(count, ans)
print(ans)
|
p02571 | s716998200 | Accepted | s=input()
t=input()
ans=10**10
for i in range(len(s)-len(t)+1):
ss=s[i:i+len(t)]
m=0
for j in range(len(t)):
if ss[j]!=t[j]:
m+=1
ans=min(ans,m)
print(ans) |
p02571 | s687753770 | Accepted | S = input()
T = input()
itch = 0
for i in range(len(S)-len(T)+1):
tmp = 0
for j in range(len(T)):
if S[i+j] == T[j]:
tmp += 1
itch = max(tmp, itch)
tmp = 0
print(len(T)-itch) |
p02571 | s213387235 | Accepted | s = input()
t = input()
min = len(t)
for i in range(len(s) - len(t) + 1):
a = 0
for j in range(len(t)):
if(s[i+j] != t[j]):
a += 1
if(a >= min):
break
if(a < min):
min = a
print(min)
|
p02571 | s411868260 | Accepted | def diff(a, b):
ret = 0
for c1, c2 in zip(a, b):
if c1 != c2:
ret += 1
return ret
S = input()
T = input()
l = len(T)
ans = 10 ** 9
for i in range(len(S) - l + 1):
# print(S[i:i+l])
ans = min(ans, diff(S[i:i+l], T))
print(ans) |
p02571 | s567934310 | Accepted | S = input()
T = input()
ans = 1000000 # 適当に1001以上を初期値にしておきます
# Tが1文字のときlen(S)回、2文字のときlen(S) - 1回 …… なので、
# len(S) - len(T) + 1 回です
for i in range(len(S) - len(T) + 1):
score = 0
U = S[i:i + len(T)] # Sのi文字目から連続するlen(T)文字を、Uとします
for j in range(len(T)):
if U[j] != T[j]:
score += 1
ans = min(ans, score)
print(ans) |
p02571 | s782041078 | Accepted | def solve(l_1,l_2):
result = 0
for i,j in zip(l_1,l_2):
if i != j:
result += 1
return result
s = input()
t = input()
n_s = len(s)
n_t = len(t)
ans = 10**5
for i in range(0,n_s-n_t+1):
l = s[i:i+n_t]
ans = min(ans,solve(t,l))
print(ans) |
p02571 | s228621018 | Accepted | S = input()
T = input()
L = len(T)
res = 10000
for i in range(len(S)-L+1):
tmp = 0
for a, b in zip(list(S[i:i+L]), list(T)):
tmp += 1 if a != b else 0
res = min(tmp, res)
print(res)
|
p02571 | s684385674 | Accepted | s = list(str(input()))
t = list(str(input()))
col = []
for i in range(len(s)-len(t)+1):
count = 0
for j in range(len(t)):
if s[i+j] == t[j]:
count += 1
col.append(count)
print(len(t)-max(col)) |
p02571 | s549434894 | Accepted | s = input()
t = input()
minr = len(t)
s_t_d = len(s) - len(t)
for i in range(s_t_d + 1):
cnt = 0
for ss, ts in zip(s[i:i + len(t)], t):
if ss != ts:
cnt += 1
minr = min(minr, cnt)
print(minr)
|
p02571 | s706166819 | Accepted | s = input()
t = input()
n = len(s) - len(t) + 1
ans = len(t)
for i in range(n):
temp = 0
for j in range(len(t)):
if t[j] != s[j+i]:
temp += 1
ans = min(temp,ans)
print(ans) |
p02571 | s126239211 | Accepted | s=input()
t=input()
c=len(t)
for i in range(len(s)-len(t)+1):
d=0
for j in range(len(t)):
if s[i+j]!=t[j]:
d+=1
if d<c:
c=d
print(c) |
p02571 | s058910519 | Accepted | import sys
s = sys.stdin.readline().rstrip("\n")
t = sys.stdin.readline().rstrip("\n")
l = len(s)-len(t)+1
ans = 10000000000
for i in range(l):
s_ = s[i:i+len(t)]
ans_ = 0
for j in range(len(t)):
if t[j] != s_[j]:
ans_ += 1
ans = min(ans,ans_)
print(ans) |
p02571 | s832703284 | Accepted | S=input()
T=input()
Z=0
K=[]
for i in range(len(S)-len(T)+1):
for j in range(len(T)):
if S[j+i]!=T[j]:
Z+=1
K.append(Z)
Z=0
print(min(K))
|
p02571 | s059284822 | Accepted | S = input()
T = input()
ans = 10000
for i in range(len(S) - len(T) + 1):
count = 0
for j in range(len(T)):
if S[i + j] != T[j]:
count += 1
ans = min(ans, count)
print(ans) |
p02571 | s496087943 | Accepted | S = input()
T = input()
l = len(T)
if l == len(S):
cnt = 0
for i in range(l):
if S[i] != T[i]:
cnt += 1
print(cnt)
exit()
ans = []
for i in range(len(S)-l):
cnt = 0
for n in range(l):
if S[i+n] != T[n]:
cnt += 1
ans.append(cnt)
print(min(ans)) |
p02571 | s063826089 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)+1):
cur = 0
for j in range(len(t)):
cur += (s[i+j] != t[j])
ans = min(ans, cur)
print (ans) |
p02571 | s719919398 | Accepted | def main():
S = input()
T = input()
ls = len(S)
lt = len(T)
ans = []
for i in range(ls - lt + 1):
cnt = 0
for j in range(lt):
if S[i + j] != T[j]:
cnt += 1
ans.append(cnt)
print(min(ans))
main() |
p02571 | s259127388 | Accepted | s = input()
t = input()
lens = len(s)
lent = len(t)
kotae = 1000
for i in range(lens-lent+1):
temp = 0
for j in range(lent):
if(s[i+j] == t[j]):
temp += 1
kotae = min(kotae,lent-temp)
print(kotae) |
p02571 | s477386427 | Accepted | S = input()
T = input()
ans=len(T)
itti=0
for i in range(len(S)-len(T)+1):
cnt=0
for j in range(i,i+len(T)):
if S[j]==T[j-i]:
cnt+=1
itti = max(itti,cnt)
print(len(T)-itti)
|
p02571 | s088809956 | Accepted | s = input()
t = input()
s_len = len(s)
t_len = len(t)
ans = 99999
for i in range(-~s_len-t_len):
cnt = 0
for j in range(t_len):
if s[i+j] != t[j]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s617503485 | Accepted | S = input()
T = input()
Min = 10000
for i in range(len(S)-len(T)+1):
temp = 0
for j in range(len(T)):
if S[i+j] != T[j]:
temp += 1
Min = min(Min, temp)
print(Min) |
p02571 | s691263987 | Accepted | s = input()
t = input()
mini =10000000
for i in range(len(s)-len(t)+1):
count = 0
for z in range(len(t)):
if s[i+z] != t[z]:
count += 1
if count < mini :
mini = count
print(mini) |
p02571 | s632531778 | Accepted | s = input()
t = input()
ans = 1000
for i in range(len(s)-len(t)+1):
#print(s[i:i+len(t)])
cnt = 0
for j in range(len(t)):
if t[j] != s[i:i+len(t)][j]:
cnt +=1
#print(cnt,t[j],s[i:i+len(t)][j])
#print(cnt)
ans = min(ans,cnt)
print(ans) |
p02571 | s687966447 | Accepted | s = input()
t = input()
ans = []
for i in range(len(s)-len(t)+1):
cnt = 0
for j in range(len(t)):
if t[j] != s[i+j]:
cnt += 1
ans.append(cnt)
cnt2 = min(ans)
print(cnt2) |
p02571 | s860218337 | Accepted | def main():
s = input()
t = input()
ld = len(s)-len(t)
ans = 9999999999
for i in range(ld+1):
v = sum([0 if a==b else 1 for (a,b) in zip(list(s[i:]),list(t))])
ans = min(ans, v)
print(ans)
main() |
p02571 | s835463145 | Accepted | S=input()
T=input()
ans=10**5
for i in range(len(S)-len(T)+1):
a=0
for j in range(len(T)):
if S[i+j]==T[j]:
a+=1
ans=min(ans,len(T)-a)
print(ans) |
p02571 | s767121816 | Accepted | s = input('')
t = input('')
len_s=len(s)
len_t=len(t)
d=0
for j in range(len_t):
if s[j]!=t[j]:
d+=1
for i in range(len_s - len_t):
s2 = s[i:i+len_t]
# print(s2)
d2=0
for j in range(len_t):
if s2[j]!=t[j]:
d2+=1
# print("{}/{}".format(s2,t))
if d2<d:
d=d2
print(d)
|
p02571 | s291035455 | Accepted | s = input()
t = input()
ans = 100000
for i in range(len(s) - len(t) + 1):
lt = len(t)
cnt = 0
for a, b in zip(s[i:i+lt], t):
if a != b:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s268270230 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
min_count = 1000
for i in range(ls-lt+1):
count = 0
for j in range(lt):
if s[i:i+lt][j] != t[j]:
count += 1
if min_count > count:
min_count = count
print(min_count)
|
p02571 | s361279609 | Accepted | s = input()
t = input()
ans = len(t)
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) |
p02571 | s865589447 | Accepted | import sys
S = input()
T = input()
if T in S:
print(0)
sys.exit(0)
maxSameCharCount = 0
for i in range(len(S)-len(T)+1):
sameCharCount = 0
for j in range(len(T)):
if S[i+j]==T[j]:
sameCharCount += 1
if maxSameCharCount < sameCharCount:
maxSameCharCount = sameCharCount
print(len(T)-maxSameCharCount)
|
p02571 | s085995443 | Accepted | s=input()
t=input()
max_itti=0
for i in range(len(s)-len(t)+1):
ittisuu=0
for j in range(len(t)):
if t[j] == s[i+j]:
ittisuu += 1
max_itti=max(max_itti,ittisuu)
print(len(t) - max_itti)
|
p02571 | s581150669 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
ans=0
for i in range(0, ls-lt+1):
cnt = 0
for j in range(lt):
if s[i+j] == t[j]:
cnt+=1
ans = max(ans, cnt)
print(lt-ans)
|
p02571 | s108289046 | Accepted |
S = input()
T = input()
count = 0
max_count = 0
for i in range(len(S) - len(T) +1):
for j in range(len(T)):
if S[i+j] == T[j]:
count += 1
if max_count <= count:
max_count = count
if j == (len(T) -1):
count = 0
print(len(T) - max_count)
|
p02571 | s667089518 | Accepted | S = input()
T = input()
import math
res = math.inf
from collections import Counter
mt = list(map(ord, list(T)))
for i in range(len(S) - len(T) + 1):
# print(S[i: i + len(T)], [a - b for a, b in zip(map(ord, list(S[i: i + len(T)])), mt)])
res = min(res, len(T) - Counter([a - b for a, b in zip(map(ord, list(S[i: i + len(T)])), mt)])[0])
print(res) |
p02571 | s652962160 | Accepted | s=list(input())
t=list(input())
xs=len(s)
xt=len(t)
count=1000
for i in range(xs-xt+1):
temp=0
for j in range(xt):
if s[i+j]!=t[j]:
temp+=1
count=min(temp,count)
print(count) |
p02571 | s216945764 | Accepted | import sys
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda: list(map(int, input().strip().split()))
def f(s, t):
# print(s, t)
ans = 0
for i in range(len(t)):
ans += (s[i] != t[i])
return(ans)
def main():
s = input().strip(); t = input().strip()
ans = f(s, t)
for i in range(1, len(s)-len(t)):
ans = min(ans, f(s[i:i+len(t)], t))
print(ans)
if __name__ == "__main__":
main()
|
p02571 | s566513695 | Accepted | S=input()
T=input()
num_same_all = 0
for i in range(len(S)-len(T)+1):
num_same = 0
for j in range(len(T)):
if S[j+i] == T[j]:
num_same += 1
if num_same_all < num_same:
num_same_all = num_same
print(len(T)-num_same_all) |
p02571 | s902853544 | Accepted | S = input()
T = input()
tmp = 0
for i in range(len(S)-len(T)+1):
cnt = 0
bubun = S[i:i+len(T)]
for j in range(len(T)):
if bubun[j] == T[j]:
cnt += 1
tmp = max(tmp,cnt)
print(len(T)-tmp) |
p02571 | s819896216 | Accepted | S = input()
T = input()
ans = float('inf')
d = len(S) - len(T) + 1
for i in range(d):
cnt = 0
for j in range(len(T)):
if S[i + j] != T[j]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s512015711 | Accepted | s=list(input())
t=list(input())
ans=10**7
for i in range(len(s)-len(t)+1):
c=0
for j in range(len(t)):
if s[i+j]!=t[j]:
c=c+1
if c<ans:
ans=c
print(ans) |
p02571 | s126827775 | Accepted | S=input()
T=input()
ans = 10000
for i in range(len(S)-len(T)+1):
count = 0
for j in range(len(T)):
if S[i+j] != T[j]:
count += 1
if count<ans:
ans = count
print(ans)
|
p02571 | s872581469 | Accepted | S = input()
T = input()
ans = 9999999999999999999
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) |
p02571 | s791304331 | Accepted | S = input().rstrip()
T = input().rstrip()
ans = 1000
for offset in range(len(S) - len(T) + 1):
miss = 0
for s, t in zip(S[offset:offset+len(T)], T):
if s != t:
miss += 1
ans = min(ans, miss)
print(ans) |
p02571 | s584337274 | Accepted | def main():
S = input()
T = input()
ans = len(T)
for base in range(len(S) - len(T) + 1):
diff = 0
for i in range(len(T)):
if S[base+i] != T[i]:
diff += 1
ans = min(ans, diff)
print(ans)
if __name__ == "__main__":
main()
|
p02571 | s475836312 | Accepted | s = input()
t = input()
ans = 1000
for i in range(len(s)-len(t)+1):
count = 0
for j in range(len(t)):
if t[j] != s[i+j]:
count += 1
ans = min(ans, count)
print(ans) |
p02571 | s326570692 | Accepted | s=input()
t=input()
ANS=0
ans=0
for i in range(len(s)-len(t)+1):
a=s[i:i+len(t)]
ans=0
for j in range(len(a)):
if a[j]==t[j]:
ans+=1
if ans>ANS:
ANS=ans
print(len(t)-ANS) |
p02571 | s479194270 | Accepted | S = input()
T = input()
res = len(T)
for i in range(len(S)-len(T)+1):
target = S[i:i+len(T)]
matchCount = 0
for s, t in zip(T, target):
if s == t:
matchCount += 1
res = min(res, len(T)-matchCount)
print(res) |
p02571 | s975183875 | Accepted | def count_diff(a,b):
cnt = 0
for c1,c2 in zip(a, b):
if c1 != c2:
cnt += 1
return cnt
S = str(input())
T = str(input())
mn = 100000
for i in range(len(S)-len(T)+1):
s = S[i:i+len(T)]
x = count_diff(s,T)
mn = min(mn,x)
print(mn) |
p02571 | s253952455 | Accepted | S = input()
T = input()
minA = float("inf")
for i in range(len(S) - len(T) + 1):
sumA = 0
for j in range(len(T)):
if S[i + j] != T[j]:
sumA += 1
minA = min(minA, sumA)
print(minA)
|
p02571 | s657249026 | Accepted | s = input()
t = input()
ans = len(t)
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)
|
p02571 | s767564475 | Accepted | S = input()
T = input()
ans = len(T)
for i in range(len(S)-len(T)+1):
cnt = 0
for j in range(len(T)):
if T[j] != S[i:i+len(T)][j]:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s155523245 | Accepted | S = input().rstrip()
T = input().rstrip()
res = float("inf")
for i in range(len(S)-len(T)+1):
t = 0
for j in range(len(T)):
if S[i+j]!=T[j]:
t += 1
res = min(t,res)
print(res) |
p02571 | s037511285 | Accepted | S = input()
T = input()
res = len(T)
for i in range(len(S) - len(T) + 1):
cnt = 0
for j in range(len(T)):
if S[i+j] != T[j]:
cnt = cnt + 1
res = min(res, cnt)
print(res) |
p02571 | s381790935 | Accepted | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if DBG:
print(x)
s = ins()
t = ins()
ls = len(s)
lt = len(t)
mn = BIG
for i in range(ls-lt+1):
x = 0
for j in range(lt):
if s[i+j]!=t[j]:
x += 1
mn = min(mn,x)
print(mn)
|
p02571 | s495487319 | Accepted | S = list(input())
T = list(input())
change_num_array = []
for j in range(0, len(S)-len(T)+1):
change_num = 0
for i in range(len(T)):
if S[j+i] != T[i]:
change_num += 1
change_num_array.append(change_num)
print(min(change_num_array))
|
p02571 | s417397422 | Accepted | s = input()
t = input()
s_len =len(s)
t_len =len(t)
count = 0
ans = []
for i in range(s_len - t_len + 1):
for j in range(t_len):
if s[i:t_len + i][j] != t[j]:
count += 1
ans.append(count)
count = 0
min_ans = min(ans)
print(min_ans)
|
p02571 | s993885299 | Accepted | S=str(input())
T=str(input())
U=[0]*(len(S)-len(T)+1)
c=[0]*(len(S)-len(T)+1)
for j in range(len(S)-len(T)+1):
U[j]=S[j:j+len(T)]
for i in range(len(T)):
if U[j][i]==T[i] :c[j]=c[j]+1
print(len(T)-max(c)) |
p02571 | s875494803 | Accepted | s = input()
t = input()
lens = len(s)
lent = len(t)
cnt_min = 10**5
for i in range(lens-lent+1):
tmp = 0
for j in range(lent):
if s[i+j] != t[j]:
tmp += 1
if tmp < cnt_min:
cnt_min = tmp
print(cnt_min) |
p02571 | s186209544 | Accepted | # = map(int, input().split())
# = int(input())
S = input()
T = input()
N = len(S)
M= len(T)
ans = N
for j in range(N- M+1):
change = 0
for l in range(M):
if S[j+l] != T[l]:
change += 1
ans = min(ans, change)
print(ans) |
p02571 | s633288062 | Accepted | s = input()
t = input()
ans = 1000
for i in range(len(s)-len(t)+1):
tmp = 0
for j in range(len(t)):
if s[i+j] != t[j]:
tmp += 1
ans = min(tmp, ans)
print(ans) |
p02571 | s296318269 | Accepted | s = input()
t = input()
ans = 10000000
for i in range(len(s)-len(t)+1):
diff = 0
for j in range(len(t)):
if s[i+j] != t[j]:
diff += 1
ans = min(ans, diff)
print(ans)
|
p02571 | s670878388 | Accepted | S = input()
T = input()
best = len(S) + 100
for i in range(len(S)):
if i + len(T) > len(S):
break
pair = S[i : i + len(T)]
diffs = 0
for a, b in zip(pair, T):
if a != b:
diffs += 1
best = min(best, diffs)
print(best)
|
p02571 | s731230884 | Accepted | s = input()
t = input()
LS = len(s)
LT = len(t)
# 最長で何文字一致するか
max_match = 0
for i in range(LS - LT + 1):
ss = s[i:i+LT]
match = 0
for a,b in zip(t, ss):
if a==b:
match += 1
max_match = max(max_match, match)
print(LT - max_match)
|
p02571 | s820400087 | Accepted | inpl = lambda: list(map(int,input().split()))
S = input()
T = input()
M = len(S)
N = len(T)
ans = N
for i in range(M-N+1):
tmp = 0
for j in range(N):
if S[i+j] != T[j]:
tmp += 1
if tmp >= ans:
break
else:
if tmp < ans:
ans = tmp
print(ans)
|
p02571 | s808619495 | Accepted | S = str(input())
T = str(input())
s = len(S)
t = len(T)
ans = []
for i in range(s-t+1):
count = 0
U = S[i:i+t]
for j in range(t):
if U[j] != T[j]:
count += 1
ans.append(count)
print (min(ans)) |
p02571 | s243116943 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip('\r\n')
def check(a, b):
ans = 0
for i in range(len(a)):
if a[i] != b[i]:
ans += 1
return ans
s = input()
t = input()
n = len(t)
ans = 10 ** 10
for i in range(len(s) - n + 1):
ans = min(ans, check(s[i: i + n], t))
print(ans) |
p02571 | s584517387 | Accepted | S=input()
T=input()
if T in S:
print(0)
exit()
def f(s1,s2):
r=0
for i,j in zip(s1,s2):
if i != j: r += 1
return r
a=len(S)
for i in range(len(S)-len(T)+1):
r = f(S[i:i+len(T)],T)
if a > r: a = r
print(a) |
p02571 | s134161761 | Accepted | S = input()
T = input()
ans = 10000
for i in range(len(S)-len(T)+1):
count = 0
for elts, eltt in zip(S[i:i+len(T)], T):
if elts != eltt:
count += 1
ans = min(ans, count)
print(ans)
|
p02571 | s074339299 | Accepted | s = input()
t = input()
ans = len(s)
for i in range(len(s)):
if (i + len(t) - 1 >= len(s)): break
dif = 0
for j in range(len(t)):
if (s[i + j] != t[j]):
dif += 1
ans = min(ans, dif)
print(ans) |
p02571 | s020581916 | Accepted | s = input()
t = input()
ans = 100000
for i in range(len(s)-len(t)+1):
cnt = 0
for j in range(i,i+len(t)):
if s[j]!=t[j-i]:
cnt+=1
ans = min(ans,cnt)
print(ans) |
p02571 | s703523632 | Accepted | s=list(input())
t=list(input())
n=len(s)
m=len(t)
ans=10000
for i in range(n-m+1):
z=0
for j in range(m):
if t[j]!=s[i+j]:
z+=1
ans=min(ans,z)
print(ans)
|
p02571 | s032677578 | Accepted | s=input()
t=input()
len_s=len(s)
len_t=len(t)
len_n=len_s-len_t
ans=100000
for i in range(0,len_n+1):
cnt=0
for j in range(len_t):
if s[i+j]!=t[j]:
cnt+=1
ans=min(ans,cnt)
print(ans)
|
p02571 | s339413400 | Accepted | S = input()
T = input()
ans = 9999
for i in range(len(S)-len(T)+1):
s = S[i:i+len(T)]
cnt = 0
for a,b in zip(s,T):
if a!=b:
cnt += 1
ans = min(ans,cnt)
print(ans) |
p02571 | s985589702 | Accepted | S =input()
T =input()
answer = len(T)
for i in range(len(S)-len(T)+1):
# print(S[i:i + len(T)])
count = 0
for j in range(len(T)):
if S[i + j] != T[j]:
count = count + 1
if count < answer:
answer = count
print(answer) |
p02571 | s968599768 | Accepted | import sys
def main():
S = sys.stdin.readline().rstrip()
T = sys.stdin.readline().rstrip()
ans = len(T)
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)
main() |
p02571 | s743339497 | Accepted | def check(a,b):
cnt=0
for x in range(len(a)):
if a[x]!=b[x]:
cnt+=1
return cnt
s=input()
t=input()
k=len(t)
ans=k
for x in range(len(s)-len(t)+1):
ans=min(ans,check(s[x:x+k],t))
print(ans)
|
p02571 | s570002542 | Accepted | S, T = input(), input()
ret = len(T)
# burst force
for st in range(0, len(S)-len(T) + 1):
diff = 0
for idx in range(0, len(T)):
if S[st + idx] != T[idx]:
diff += 1
ret = min(ret, diff)
print('{}'.format(ret))
|
p02571 | s675482475 | Accepted | def main():
s = input()
t = input()
n,m = len(s),len(t)
c = 0
for i in range(n-m+1):
cnt = 0
for j in range(m):
if s[i+j] == t[j]:
cnt += 1
if cnt > c:
c = cnt
print(m-c)
if __name__ == "__main__":
main()
|
p02571 | s696226155 | Accepted | S = input()
T = input()
ans = 1001
for i in range(len(S)-len(T)+1):
cnt = 0
a = S[i:i+len(T)]
for j in range(len(T)):
if a[j]!=T[j]:
cnt+=1
ans = min(ans,cnt)
print(ans)
|
p02571 | s319222478 | Accepted | S = input()
T = input()
len_S = len(S)
len_T = len(T)
ans = 9999
for n in range(len_S - len_T +1):
part_S = S[n:n+len(T)]
cnt = 0
for t in range(len(T)):
if T[t] != part_S[t]:
cnt += 1
if cnt < ans:
ans = cnt
print(ans) |
p02571 | s332781688 | Accepted | s = input()
t = input()
max_cover = 0
for i in range(len(s) - len(t) + 1):
temp_cover = 0
for j in range(len(t)):
if s[j + i] == t[j]:
temp_cover += 1
max_cover = max(max_cover, temp_cover)
print(len(t) - max_cover) |
p02571 | s080871514 | Accepted | S = input()
T = input()
def matchcount(x, y):
ret = 0
for i in range(len(x)):
if x[i] == y[i]: ret += 1
return ret
rec = len(T)
for i in range(len(S)-len(T)+1):
subst = S[i:i+len(T)]
# print(subst, matchcount(subst, T))
rec = min(rec, len(T) - matchcount(subst, T))
print(rec)
|
p02571 | s124288070 | Accepted | s = str(input())
t = str(input())
ans = len(t)
for i in range(len(s) - len(t) + 1):
tmp_ans = 0
for j in range(len(t)):
if s[i+j] != t[j]:
tmp_ans += 1
ans = min(ans, tmp_ans)
print(ans) |
p02571 | s554862022 | Accepted | s = input()
t = input()
ans = 1001
for i in range(len(s) - len(t) + 1):
num = 0
x = s[i : i + len(t)]
for j in range(len(t)):
if x[j] != t[j]:
num += 1
ans = min(ans, num)
print(ans) |
p02571 | s302593842 | Accepted | S = input()
T = input()
nt = len(T)
ns = len(S)
ans = 1000
for i in range(ns-nt+1):
buf = 0
for j in range(nt):
if S[i+j]!=T[j]:
buf += 1
ans = min(ans, buf)
print(ans) |
p02571 | s583408373 | Accepted | S = input()
N = len(S)
T = input()
M = len(T)
ans = N
for i in range(N-M+1):
res = 0
for j in range(M):
if S[i+j]!=T[j]:
res += 1
ans = min(ans,res)
print(ans) |
p02571 | s444538148 | Accepted | s = input()
t = input()
T = list(t)
sl = len(s)
tl = len(t)
ans = 10**18
for i in range((sl-tl)+1):
cnt = 0
S = list(s[i:i+tl])
for a,b in zip(S,T):
if a != b:
cnt += 1
if ans > cnt:
ans = cnt
print(ans) |
p02571 | s421934122 | Accepted | # -*- coding: utf-8 -*-
# モジュールのインポート
import sys
# 標準入力を取得
S = input()
T = input()
# 求解処理
def get_match_count(s1: str, s2: str) -> int:
match_count = 0
for c1, c2 in zip(s1, s2):
if c1 == c2:
match_count += 1
return match_count
N = len(S)
M = len(T)
ans = sys.maxsize
for i in range(N - M + 1):
ans = min(ans, M - get_match_count(S[i:i + M], T))
# 結果出力
print(ans)
|
p02571 | s122704712 | Accepted | import sys
S = input()
T = input()
result = sys.maxsize
for i in range(len(S)-len(T)+1):
tmp = 0
for j in range(len(T)):
if T[j] != S[i+j]:
tmp += 1
if tmp < result:
result = tmp
print(result) |
p02571 | s823489799 | Accepted | s = input()
t = input()
count = []
correct = 0
for i in range(len(s) - len(t) + 1):
for j in range(len(t)):
if s[i+j] == t[j]:
correct += 1
count.append(correct)
correct = 0
print(len(t) - max(count)) |
p02571 | s453320357 | Accepted | s = input()
t = input()
n_t = len(t)
res = n_t
for i in range(len(s) - n_t +1):
tmp = s[i:i+n_t]
count = 0
for j in range(n_t):
if tmp[j] != t[j]:
count +=1
res = min(res, count)
print(res) |
p02571 | s166379573 | Accepted | S=list(input())
T=list(input())
#print(S)
#print(T)
con=[0]*len(S)
for i in range(len(S)-len(T)+1):
#print(i)
for j in range(len(T)):
if(S[i+j]==T[j]):
con[i]=con[i]+1
print(len(T)-max(con))
|
p02571 | s617006327 | Accepted | s=input()
t=input()
count = []
for i in range(len(s)-len(t)+1):
c=0
for j in range(i,i+len(t)):
if s[j] == t[j-i]:
c+=1
count.append(c)
# print(count)
print(len(t)-max(count))
|
p02571 | s171061749 | Accepted | def main():
target = input()
source = input()
diff = len(target) - len(source)
max_change = len(source)
for i in range(diff+1):
temp = target[i:len(target)-diff+i]
change = sum([1 for t, s in zip(temp, source) if(t!=s)])
if(change < max_change):
max_change = change
print(max_change)
if __name__ == '__main__':
main() |
p02571 | s842067787 | Accepted | s=input()
t=input()
ans = 0
c = 0
m = 1001
for i in range(len(s)-len(t)+1):
tmp = s[i:i+len(t)]
#print(tmp)
for j in range(len(t)):
#print(tmp[j],t[j])
if tmp[j] != t[j]:
c+=1
#print(c)
if m > c:
m = c
ans = c
c=0
print(ans) |
p02571 | s843808266 | Accepted | S = input()
T = input()
ans = 10**9
for i in range(len(S)-len(T)+1):
tmpS = S[i:i+len(T)]
cnt = 0
for j in range(len(T)):
if tmpS[j] != T[j]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s970475711 | Accepted | S = input()
T = input()
mx = 0
for i in range(len(S) - len(T) + 1):
t = 0
for j in range(len(T)):
if i + j < len(S) and S[i + j] == T[j]:
t += 1
mx = max(mx, t)
print(len(T) - mx)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.