problem_id stringclasses 100 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 6 806 |
|---|---|---|---|
p02571 | s734940414 | Accepted | S = input()
T = input()
n = len(S)
m = len(T)
ans = m
for i in range(n-m+1):
xs = S[i:i+m]
cnt = 0
for j in range(m):
if xs[j] != T[j] :
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s637867129 | Accepted | a = input()
b = input()
arr = []
la = len(a)
lb = len(b)
for i in range(la-lb+1):
c = a[i:i+lb]
cu = 0
for j in range(lb):
if c[j] != b[j]:
cu += 1
arr.append(cu)
print(min(arr)) |
p02571 | s703885442 | Accepted | s, t = input(), input()
ret = len(t)
for i in range(len(s)-len(t)+1):
u = s[i:len(t)+i]
count_diff = 0
for j in range(len(u)):
if u[j] != t[j]:
count_diff += 1
ret = min(ret, count_diff)
print(ret) |
p02571 | s884124969 | Accepted | S = str(input())
T = str(input())
ans = 1000
for i in range(len(S) - len(T) + 1):
c = 0
for j in range(len(T)):
if S[i] != T[j]:
c += 1
i += 1
ans = min(ans, c)
print(ans) |
p02571 | s400942928 | Accepted | s = input()
t = input()
n = len(s)
nt = len(t)
ans = 1000
for i in range(n - nt + 1):
string = s[i:i + nt]
count = 0
for c1, c2 in zip(string, t):
if c1!=c2: count += 1
ans = min(ans, count)
print(ans) |
p02571 | s865603580 | Accepted | s = input()
t = input()
S = [c for c in s]
T = [c for c in t]
m = len(T)
for i in range(len(S)-len(T)+1):
temp = 0
for j in range(i,i+len(T)):
if S[j] != T[j-i]:
temp += 1
if temp<m:
m=temp
print(m) |
p02571 | s573387094 | 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
if ans>tmp:
ans=tmp
print(ans) |
p02571 | s295238939 | Accepted | s=input()
t=input()
k=len(t)
for i in range(len(s)-len(t)+1):
q=0
for j in range(len(t)):
if s[i+j]!=t[j]:
q+=1
if k>q:
k=q
print(k) |
p02571 | s118580652 | Accepted | s=input()
t=input()
res=len(t)
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
res=min(tmp,res)
print(res) |
p02571 | s064087701 | Accepted | s = input()
t = input()
lt = len(t)
ls = len(s)
A = []
for i in range(ls-lt+1):
cou = 0
for j in range(lt):
if s[i+j] == t[j]:
cou += 1
A.append(cou)
print(lt-max(A)) |
p02571 | s089751629 | Accepted | s=input()
t=input()
sl=len(s)
tl=len(t)
kotae=tl
for i in range(0,sl-tl+1):
x=s[i:i+tl]
b=0
for j in range(tl):
if x[j]!=t[j]:
b+=1
if b<kotae:
kotae=b
print(kotae) |
p02571 | s418419671 | Accepted | #b
s = input()
v = input()
ans = 0
for i in range(len(s)-len(v)+1):
count = 0
for j in range(len(v)):
if s[i+j] == v[j]:
count += 1
if count > ans:
ans = count
print(len(v) - ans) |
p02571 | s476948838 | Accepted | s=input()
t=input()
slen=len(s)
tlen = len(t)
min = tlen
for i in range(slen - tlen + 1):
count = 0
for j in range(tlen):
if s[i + j] != t[j]:
count += 1
if count < min:
min = count
print(min) |
p02571 | s372969496 | Accepted | def equ(a, b):
if a == b:
return 1
else:
return 0
s = input()
t = input()
max_equ = 0
for i in range(len(s) - len(t) + 1):
count = 0
for j in range(len(t)):
count += equ(s[i + j], t[j])
if count > max_equ:
max_equ = count
print(len(t) - max_equ)
|
p02571 | s619379587 | Accepted | import sys
s = input()
t = input()
finalans = 1000000
for i in range(len(s) - len(t) + 1):
ans = 0
for j in range(len(t)):
if (s[i+j] == t[j]):
pass
else:
ans += 1
finalans = min(finalans, ans)
print(finalans)
|
p02571 | s330092217 | Accepted | S = input()
T = input()
ans = len(T)
n1 = len(S)-len(T)+1
for i in range(n1):
ans2 = 0
for k in range(len(T)):
# print(S[k+i],T[k])
if S[k+i] != T[k]:
ans2 += 1
ans = min([ans,ans2])
# print(ans)
print(ans) |
p02571 | s411325743 | Accepted | def main():
S = input()
T = input()
ans = 10**4
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 ans > count :
ans = count
if ans == 10**4:
print(len(T))
else:
print(ans)
if __name__ == "__main__":
main() |
p02571 | s295059627 | Accepted | s = input()
t = input()
res = 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
res = min(res, tmp)
print(res) |
p02571 | s372588828 | Accepted | S=str(input())
T=str(input())
min_count=len(T)
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
min_count=min(count,min_count)
print(min_count)
|
p02571 | s975444582 | Accepted | s=input()
t=input()
num=len(s)-len(t)
res=[]
for n1 in range(0,num+1):
count=0
for n2 in range(0,len(t)):
if(t[n2]!=s[n1+n2]):
count+=1
res.append(count)
print(min(res)) |
p02571 | s789121759 | Accepted | S=str(input())
T=str(input())
ls = []
cnt = 0
for i in range(len(S)-len(T)+1):
cnt = 0
for j in range(len(T)):
#print(i,j)
if T[j] != S[j+i]:
#print(T[j],S[j+i])
cnt += 1
ls.append(cnt)
#print(ls)
print(min(ls))
|
p02571 | s266570492 | Accepted | s = input()
t = input()
ls = []
for i in range(len(s) - len(t) + 1):
ls.append(s[i:i+len(t)])
now = 0
minimum = len(t)
for i in range(len(ls)):
now = 0
for j in range(len(t)):
if t[j] == ls[i][j]:
now += 1
if len(t) - now < minimum:
minimum = len(t) - now
print(minimum) |
p02571 | s127643691 | Accepted | S = input()
T = input()
max_count = 0
for i in range(max(1, len(S) - len(T))):
count = 0
for j in range(len(T)):
if S[i+j] == T[j]:
count += 1
max_count = max(max_count, count)
print(len(T) - max_count)
|
p02571 | s864855663 | Accepted | S=input()
T=input()
a=[]
for i in range(len(S)-len(T)+1) :
count=0
for j in range(len(T)) :
if S[i:i+len(T)][j]==T[j] :
count+=1
a.append(count)
print(len(T)-max(a)) |
p02571 | s088784961 | Accepted | s = input()
t = input()
ans = 10 ** 10
ls = len(s)
lt = len(t)
for i in range(ls - lt + 1):
cnt = 0
for j in range(lt):
if s[i + j] != t[j]:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s912232516 | Accepted | s = input()
t = input()
if len(s) <= len(t):
a = s; s = t; t = a
res = 0
for i in range(len(s)-len(t)+1):
temp = 0
for j in range(len(t)):
if s[j+i] == t[j]:
temp+=1
res = max(temp, res)
ans =len(t) - res
print(ans) |
p02571 | s407284079 | Accepted | s =input()
t = input()
len_s = len(s)
len_t = len(t)
ans = 10**10
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(cnt,ans)
print(ans)
|
p02571 | s743551965 | Accepted | s = input()
t = input()
d = len(s) - len(t)
min_c = int(1e4)
for i in range(d+1):
st = s[i:i+len(t)]
c = 0
for j in range(len(t)):
if st[j] != t[j]:
c += 1
if c > min_c:
break
min_c = min(c, min_c)
print(min_c)
|
p02571 | s396466211 | Accepted | from functools import reduce
s, t = input(), input()
ans = 10**9
for i in range(0, len(s) - len(t)+1):
ans = min(ans, reduce(lambda x, a: x + (1 if a[0] != a[1] else 0), zip(s[i:], t), 0))
print(ans)
|
p02571 | s759540474 | Accepted | s= input()
t = input()
n = len(s)
n1 = len(t)
ans= 100000
for i in range(n-n1+1):
count= 0
for j in range(n1):
#print(i,j,n,n1)
if s[i+j]==t[j]:
continue
else:
count+=1
#print(count)
ans = min(ans,count)
print(ans)
|
p02571 | s692083878 | Accepted | s=list(input())
t=list(input())
ans=0
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=max(ans,cnt)
print(len(t)-ans) |
p02571 | s671946354 | Accepted | s= input()
t = input()
count = len(t)
for i in range(len(s) - len(t) + 1):
str_ = s[i:i + len(t)]
temp = 0
for i in range(len(str_)):
#print(str_[i])
if str_[i] != t[i]:
temp += 1
count = min(count, temp)
print(count) |
p02571 | s280412111 | Accepted | import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
T = input().strip("\n")
minChange = len(T)
for i in range(len(S) - len(T) + 1):
c = 0
for j in range(len(T)):
if S[i + j] != T[j]: c += 1
minChange = min(minChange, c)
print(minChange)
return 0
if __name__ == "__main__":
solve() |
p02571 | s346939022 | Accepted | s=input()
t=input()
count_max = 0
for i in range(0, len(s)-len(t)+1):
count_tmp = 0
for j in range(len(t)):
if s[i+j]==t[j]:
count_tmp += 1
if count_max < count_tmp:
count_max = count_tmp
print(len(t)-count_max) |
p02571 | s877960410 | Accepted | S = input()
T = input()
cnt = []
for i in range(len(S)-len(T)+1):
unmch = 0
for j, t in enumerate(T):
if t != S[i+j]:
unmch +=1
cnt += [unmch]
print(min(cnt))
|
p02571 | s115665560 | Accepted | S = input()
T = input()
ans = 1001
for i in range(len(S) - len(T) + 1):
a = 0
for s in range(len(T)):
if T[s] != S[i+s]:
a += 1
if a < ans:
ans = a
print(ans) |
p02571 | s632183244 | Accepted | S = input()
T = input()
res = 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
res = max(res, tmp)
print(len(T) - res)
|
p02571 | s660282056 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
max = 0
for i in range(ls-lt+1):
k = 0
for j in range(i,i+lt):
if s[j] == t[j-i]:
k += 1
if max < k:
max = k
print(lt-max)
|
p02571 | s958440783 | Accepted | def main():
S = list(input())
T = list(input())
ans = float('inf')
for i in range(len(S)):
cnt = 0
flag = True
for j in range(len(T)):
if i + j >= len(S):
flag = False
break
if S[i+j] != T[j]:
cnt += 1
if flag:
ans = min(ans, cnt)
print(ans)
if __name__ == "__main__":
main() |
p02571 | s137076822 | Accepted | s=input()
t=input()
ans=len(t)
for i in range(len(s)-len(t)+1):
s1=s[i:i+len(t)]
sum=len(t)
for j in range(len(t)):
if t[j]==s1[j]:sum-=1
ans=min(ans,sum)
print(ans) |
p02571 | s880515871 | Accepted | S = input()
T = input()
len_S = len(S)
len_T = len(T)
ans = 10**10
for i in range(len_S - len_T+1):
num = 0
for j in range(len_T):
if S[i+j] != T[j]:
num+=1
ans = min(ans, num)
print(ans) |
p02571 | s035330854 | Accepted | #!/usr/bin/env python
def main():
s = input() + "#"
t = input()
m = len(s)
n = len(t)
c_max = 0
for i in range(m-n):
cnt = 0
for j in range(n):
if s[i+j] == t[j]:
cnt += 1
if cnt > c_max:
c_max = cnt
print(n - c_max)
if __name__ == '__main__':
main()
|
p02571 | s016608174 | Accepted | s = input()
t = input()
s = ''.join(s)
t = ''.join(t)
count = 0
maxcount = 0
slen = len(s)
tlen = len(t)
j = 0
while j <= slen-tlen:
k = j
for i in range(tlen):
if t[i] == s[k]:
count += 1
k+= 1
j += 1
if count > maxcount :
maxcount = count
count = 0
print(len(t)-maxcount) |
p02571 | s149044315 | Accepted | S = input()
T = input()
count = []
for i in range(len(S)-len(T)+1):
num = 0
for j in range(len(T)):
if S[i+j] != T[j]:
num += 1
count.append(num)
print(min(count))
|
p02571 | s436663671 | Accepted | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
s = [_ for _ in input()]
t = [_ for _ in input()]
ans = 10**10
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(a,ans)
print(ans)
|
p02571 | s284557642 | Accepted | def compare(a, b):
result = 0
for i in range(len(a)):
if a[i] != b[i]:
result += 1
return result
s = input()
t = input()
ls = len(s)
lt = len(t)
diff = []
for i in range(ls-lt+1):
diff.append(compare(s[i:i+lt], t))
print(min(diff)) |
p02571 | s013079625 | Accepted | s = input()
t = input()
minCount = len(t)
i = 0
while i < len(s) and i + len(t) <= len(s):
countSame = 0
j = 0
while j < len(t):
if t[j] == s[i+j]:
countSame += 1
j += 1
minCount = min(len(t) - countSame, minCount)
i += 1
print(minCount)
|
p02571 | s990077991 | Accepted | s = input()
t = input()
sl = len(s)
tl = len(t)
ans = tl
for i in range(sl-tl+1):
cnt = 0
for j in range(tl):
if s[i+j] != t[j]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s803950285 | Accepted | s = list(input())
t = list(input())
l_s = len(s)
l_t = len(t)
change = l_t
for i in range(l_s - l_t + 1):
change_temp = 0
for j in range(l_t):
if s[i+j] != t[j]:
change_temp += 1
change = min(change, change_temp)
print(change) |
p02571 | s086416291 | Accepted | S = input()
T = input()
s_len = len(S)
t_len = len(T)
R = s_len - t_len
ans = 1000
for i in range(R + 1):
s_new = S[i : t_len + i]
count = 0
for j in range(t_len):
if s_new[j] != T[j]:
count += 1
ans = min(ans, count)
print(ans) |
p02571 | s401124718 | Accepted | s = input()
t = input()
l = len(s)
t_l = len(t)
l_gap = l - t_l
x = 0
for i in range(l_gap + 1):
c = 0
for m in range(t_l):
if t[m] == s[i+m]:
c += 1
if c > x:
x = c
print(t_l -x) |
p02571 | s270196832 | Accepted | S = input()
T = input()
def diff_count(A,B):
diff = 0
for a,b in zip(A,B):
if a!=b:
diff += 1
return diff
ans = len(T)
for i in range(len(S) - len(T)+1):
temp = S[i:i+len(T)]
diff_num = diff_count(T,temp)
ans = min(diff_num,ans)
print(ans) |
p02571 | s566440173 | Accepted | s=input()
t=input()
mx=0
for i in range(len(s)-len(t)+1):
sm=0
for j in range(len(t)):
if s[i+j]==t[j]:
sm+=1
mx=max(sm,mx)
print(len(t)-mx) |
p02571 | s632127145 | Accepted | S = input()
T = input()
result = float('inf')
for i in range(len(S) - len(T) + 1):
count = sum(x != y for x, y in zip(S[i:i+len(T)], T))
if count < result:
result = count
print(result) |
p02571 | s307298908 | Accepted | import sys
S = input()
T = input()
if T in S:
print(0)
sys.exit(0)
ans = []
for i in range(len(S)-len(T)+1):
s = S[i:i+len(T)]
cnt = 0
for x, y in zip(s, T):
if x == y:
cnt += 1
ans.append(cnt)
print(len(T)-max(ans)) |
p02571 | s935004362 | Accepted | s = list(input())
t = list(input())
ans=len(t)
for i in range(len(s)-len(t)+1) :
check = len(t)
for j in range(len(t)) :
if s[i+j]==t[j] :
check -= 1
if ans > check :
ans = check
print(ans) |
p02571 | s999205851 | Accepted | s = input()
t = input()
ans = 10000
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
ans = min(ans,cnt)
print(ans) |
p02571 | s877531544 | Accepted | S = input()
T = input()
N = len(S)
M = len(T)
ans = M
for i in range(N-M+1):
cnt = 0
for j in range(M):
if T[j] != S[i:i+M][j]:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s149839163 | Accepted | s=input()
t=input()
t_l = len(t)
diff_min = 999999999
def diff_str(s1, s2):
diff_c = 0
for j in range(len(s1)):
if s1[j] != s2[j]:
diff_c += 1
return diff_c
if len(s) == len(t):
diff_min = diff_str(s, t)
for i in range(len(s)-t_l):
seq=s[i:i+t_l]
diff_c = diff_str(seq, t)
if diff_c < diff_min:
diff_min = diff_c
print(diff_min)
|
p02571 | s311361241 | Accepted | s = input()
t = input()
l0 = len(s)
l1 = len(t)
ans = 10**9
for i in range(l0 - l1 + 1):
x = 0
for j in range(l1):
if s[i + j] != t[j]:
x += 1
ans = min(ans, x)
print(ans)
|
p02571 | s091842597 | Accepted | S = input()
T = input()
ans = 0
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 = max(ans, count)
print(len(T) - ans) |
p02571 | s815579474 | Accepted | s = input()
t = input()
cnt_max = 0
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
if cnt > cnt_max:
cnt_max = cnt
print(len(t)-cnt_max) |
p02571 | s624272220 | Accepted | s = list(input())
t = list(input())
ls, lt = len(s), len(t)
ans = lt
for i in range(ls - lt + 1):
cnt = 0
for j in range(lt):
if s[i + j] == t[j]:
cnt += 1
ans = min(ans, lt - cnt)
print(ans) |
p02571 | s479793181 | Accepted | S = input()
T = input()
MIS = len(S)
for TS in range(0,len(S)-len(T)+1):
LS = S[TS:TS+len(T)]
Count = sum(True if LS[TT]!=T[TT] else False for TT in range(0,len(T)))
MIS = min(MIS,Count)
print(MIS) |
p02571 | s780552580 | Accepted | S = input()
T = input()
ans = 0
cnt = 0
for i in range(0, len(S) - len(T)+1):
cnt = 0
S_sub = S[i:i+len(T)]
for j in range(len(T)):
if S_sub[j] == T[j]:
cnt += 1
ans = max(ans, cnt)
print(len(T) - ans)
|
p02571 | s282130104 | Accepted | import sys
string1 = str(input())
string2 = str(input())
n, m = len(string2), len(string1)
ans = sys.maxsize
for i in range(m - n + 1):
minRemovedChar = 0
for j in range(n):
if (string2[j] != string1[i + j]):
minRemovedChar += 1
ans = min(minRemovedChar, ans)
print(ans) |
p02571 | s691598410 | Accepted | s=input()
t=input()
ans=1000
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 | s030364193 | Accepted | #abc177_B_1
list_1 = list(str(input()))
list_2 = list(str(input()))
int_agg_count_max_diff = 10000
for i in range(len(list_1) - len(list_2) + 1):
list_1_tmp = list_1[i:i+len(list_2)]
int_count_max_diff = 0
for j in range(len(list_2)):
if list_1_tmp[j] != list_2[j]:
int_count_max_diff = int_count_max_diff + 1
if int_agg_count_max_diff > int_count_max_diff:
int_agg_count_max_diff = int_count_max_diff
print(int_agg_count_max_diff) |
p02571 | s468131135 | Accepted | S = input()
T = input()
counter = 0
for i in range(len(S)):
second = 0
group = S[i:i+len(T)]
if len(group) < len(T):
break
for j in range(len(T)):
if T[j] != group[j]:
second += 1
if counter == 0:
counter = second
elif second < counter:
counter = second
print(counter) |
p02571 | s856208248 | Accepted | s=input()
t=input()
ls=len(s)
lt=len(t)
a=[0]*(ls-lt+1)
for i in range(ls-lt+1):
for j in range(lt):
if s[i+j]!=t[j]:
a[i]+=1
print(min(a)) |
p02571 | s639738766 | Accepted | s, t = open(0).read().split()
n, m = len(s), len(t)
a = 2000
for i in range(n - m + 1):
b = 0
for j in range(m):
b += s[i + j] != t[j]
a = min(a, b)
print(a) |
p02571 | s688388468 | Accepted | s = input()
t = input()
S,T = len(s),len(t)
ans = T
for i in range(S-T+1):
tmp = [c1!=c2 for c1,c2 in zip(s[i:i+T],t)].count(True)
ans = min(ans,tmp)
print(ans)
|
p02571 | s781095477 | Accepted | S = str(input())
T = str(input())
Slen = len(S)
Tlen = len(T)
diff = Slen - Tlen
ans = [0] * (diff+1)
for i in range(diff+1):
S_i = i
for j in range(Tlen):
if S[S_i] != T[j]:
ans[i] = ans[i] + 1
S_i += 1
min_ans = min(ans)
print(min_ans) |
p02571 | s259532759 | Accepted | def main():
s = input()
t = input()
len_s = len(s)
len_t = len(t)
min_count = len_t
for i in range(len_s-len_t+1):
count = len_t
for j in range(len_t):
if s[i+j] == t[j]:
count -= 1
if count < min_count:
min_count = count
return min_count
if __name__ == "__main__":
print(main())
|
p02571 | s749806841 | Accepted | s = input()
t = input()
cnt = 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
if cnt < tmp:
cnt = tmp
print(len(t)-cnt)
|
p02571 | s988635297 | Accepted | s = list(input())
t = list(input())
ans = len(t)
if len(s) == len(t):
icchi = 0
for i in range(len(s)):
if s[i] == t[i]:
icchi += 1
ans = len(t)-icchi
else:
for i in range(len(s)-len(t)):
a = s[i:i + len(t)]
icchi = 0
for j in range(len(t)):
if a[j] == t[j]:
icchi += 1
ans = min(ans, len(t)-icchi)
print(ans)
|
p02571 | s224011655 | Accepted | s = input()
t = input()
numlist = []
for i in range(len(s)-len(t)+1):
a = s[i:i+len(t)]
count = 0
for j in range(len(t)):
if a[j] != t[j]:
count += 1
numlist.append(count)
print(min(numlist)) |
p02571 | s349271328 | Accepted | s = input()
t = input()
count = len(t)
for i in range(0, len(s) - len(t) + 1):
x = s[i : i + len(t)]
cnt = 0
for i in range(len(t)):
if t[i] != x[i]:
cnt += 1
if count >= cnt:
count = cnt
print(count) |
p02571 | s532062343 | Accepted | s=input()
t=input()
m=1000
for i in range(len(s)-len(t)+1):
mm=0
for j in range(len(t)):
if s[i+j]!=t[j]:
mm+=1
m=min(mm,m)
print(m) |
p02571 | s057281536 | Accepted | s = input()
t = input()
n = len(s)
m = len(t)
ans = 0
for i in range(n):
if n < i+m:
continue
x = s[i:i+m]
cnt = 0
for a, b in zip(x, t):
if a == b:
cnt += 1
if ans < cnt:
ans = cnt
print(m-ans)
|
p02571 | s664928475 | Accepted | S = input()
T = input()
cnt = 0
m_cnt = 0
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
if S[i + j] == T[j]:
cnt += 1
if cnt > m_cnt:
m_cnt = cnt
cnt = 0
print(len(T) - m_cnt)
|
p02571 | s479487413 | Accepted | S = input()
T = input()
s = len(S)
t = len(T)
ans = 1000
for i in range(s-t+1):
cnt = 0
for j in range(t):
if S[i+j] != T[j]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s458107694 | Accepted | #模範解答 tの文字列の数に絞って全探索を掛ける
S = input()
T = input()
N = len(T)
s_list = []
for i in range(len(S) - N + 1):
s = S[i: i + N]
s_list.append(s)
answer = N
for s in s_list:
counter = 0
for i in range(N):
if s[i] != T[i]:
counter += 1
answer = min(answer, counter)
print(answer) |
p02571 | s502472174 | Accepted | s = input()
t = input()
ans = 10 ** 10
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 = min(cnt, ans)
print(ans)
|
p02571 | s854245612 | Accepted | S=input()
T=input()
NS=len(S)
NT=len(T)
ans=pow(10,9)
for n in range(NS-NT):
suuji=0
for m in range(NT):
if S[n+m]!=T[m]:
suuji+=1
ans=min(ans,suuji)
if NS==NT:
suuji=0
for n in range(NS):
if S[n]!=T[n]:
suuji+=1
ans=min(suuji,ans)
print(ans)
|
p02571 | s185400425 | Accepted | S=input()
T=input()
x=len(S)
y=len(T)
l=[]
for i in range(x-(y-1)):
s=0
for j in range(y):
if S[j+i]==T[j]:
s+=1
l.append(y-s)
print(min(l)) |
p02571 | s426049127 | Accepted | S = input()
T = input()
N, M = len(S), len(T)
ma = 0
for i in range(N-M+1):
c = 0
for j in range(M):
if S[i+j] == T[j]:
c += 1
ma = max(ma, c)
print(M - ma) |
p02571 | s987697518 | Accepted | S=input();T=input()
N=len(S);NP=len(T);M=len(T)
for i in range(N-M+1):
cnt=0
for j in range(M):
if T[j]==S[j+i]:cnt+=1
if NP>M-cnt: NP=M-cnt
print(NP) |
p02571 | s773086404 | Accepted | S=input()
T=input()
lens=len(S)
lent=len(T)
ans=0
for i in range(lens-lent+1):
tmp=0
for j in range(lent):
if S[i+j]==T[j]:
tmp+=1
if tmp>ans:
ans=tmp
print(lent-ans)
|
p02571 | s448154860 | Accepted | import sys
def minimumchar(s1,s2):
n,m=len(s1),len(s2)
ans=sys.maxsize
for i in range(m-n+1):
minRemovedChar=0
for j in range(n):
if (s1[j]!=s2[i+j]):
minRemovedChar+=1
ans=min(minRemovedChar,ans)
return ans
s2=input()
s1=input()
print(minimumchar(s1,s2))
|
p02571 | s115423425 | Accepted | import sys
s = input()
t = input()
ls = len(s)
lt = len(t)
ans = lt
for i in range(ls -lt + 1):
tmp = lt
for j in range(lt):
if s[i + j] == t[j]:
tmp -= 1
ans = min(ans, tmp)
if ans == 0:
print(0)
sys.exit()
print(ans) |
p02571 | s315658572 | Accepted | a = input()
b = input()
mini = len(b)
if a == b:
print(0)
exit(0)
for s in range(len(a) - len(b) + 1):
c = 0
for i, j in zip(a[s:s + len(b)], b):
if i != j:
c += 1
mini = min([mini, c])
print(mini)
|
p02571 | s684275515 | Accepted | s=input()
t=input()
lt=len(t)
x=lt
for i in range(len(s)-lt+1):
a=0
for j in range(lt):
if s[i+j]!=t[j]:
a+=1
x=min(x,a)
print(x) |
p02571 | s771658271 | Accepted | S = input()
T = input()
ans = 10 ** 5
sl = len(S)
tl = len(T)
for i in range(sl-tl+1):
cnt = 0
for j in range(tl):
if S[i+j] == T[j]:
continue
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s898103692 | Accepted | S = input()
T = input()
ans = 0
for i in range(len(S)-len(T)+1):
s = S[i:i+len(T)]
num = 0
for j in range(len(T)):
if s[j] == T[j]:
num += 1
if num>ans:
ans = num
print(len(T)-ans) |
p02571 | s069276244 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t) + 1):
ans = min(ans, sum(si != ti for si, ti in zip(s[i:], t)))
print(ans) |
p02571 | s325705345 | Accepted | S = input()
T = input()
ans = len(T)
for offset in range(len(S) - len(T) + 1):
ans_offset = 0
for i in range(len(T)):
if T[i] != S[offset + i]:
ans_offset += 1
ans = min(ans, ans_offset)
print(ans)
|
p02571 | s928249086 | Accepted | def comp(a,b):
s = 0
for i,j in zip(a,b):
if not i == j:
s += 1
return s
s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t) + 1):
score = comp(s[i:i+len(t)],t)
if score == 0:
ans = score
break
if ans > score:
ans = score
print(ans) |
p02571 | s301451259 | Accepted | S = list(str(input()))
T = list(str(input()))
l = len(S) - len(T)
f = len(T)
for i in range(l+1):
temp = 0
for j in range(len(T)):
if S[i+j] != T[j]:
temp += 1
if f > temp:
f = temp
print(f) |
p02571 | s856231458 | Accepted | s = list(input())
t = list(input())
ans = float("INF")
for i in range(len(s)-len(t)+1):
count = 0
for j in range(len(t)):
if s[i+j] == t[j]:
continue
count += 1
ans = min(ans,count)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.