problem_id stringclasses 100 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 6 806 |
|---|---|---|---|
p02571 | s733102082 | Accepted | S = input()
T = input()
Nmax = len(T)
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
Nmax = min(diff, Nmax)
print(Nmax)
|
p02571 | s755952361 | Accepted | s = input()
t = input()
u = t
ans =0
count=0
maxans=0
if len(s) == len(t):
for j in range(len(t)):
if s[j] == t[j]:
count+=1
maxans = count
else:
for i in range(len(s)-len(t)):
count =0
for j in range(len(t)):
if s[j+i] == t[j]:
count+=1
maxans = max(maxans, count)
print(len(t)-maxans)
|
p02571 | s159346926 | Accepted | S = input()
T = input()
Sn = len(S)
Tn = len(T)
ans = 0
for i in range(Sn-Tn+1):
M = 0
for j, k in zip(S[i:], T):
if j == k:
M += 1
if M > ans:
ans = M
print(Tn - ans) |
p02571 | s082213434 | Accepted | xmoji=input()
ymoji=input()
x=len(xmoji)
y=len(ymoji)
tempmin = 0
for i in range(0,x-y+1):
xmin=xmoji[i:i+y]
samenum=0
for j in range(0,y):
if(xmin[j]==ymoji[j]):
samenum+=1
if(tempmin<samenum):
tempmin = samenum
print(y-tempmin) |
p02571 | s868878466 | Accepted | s = input()
t = input()
sl = len(s)
tl = len(t)
ans = tl
def check(t, s):
temp = 0
for i in range(len(t)):
if t[i] != s[i]:
temp += 1
else:
pass
return temp
for i in range(sl-tl+1):
if ans > check(t,s[i:i+tl]):
ans = check(t,s[i:i+tl])
else:
pass
print(ans)
|
p02571 | s808957306 | Accepted | #: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"
#input = sys.stdin.readline
########################################
s = input()
t = input()
n = len(s)
m = len(t)
ans = -float("inf")
for i in range(n-m+1):
temp = 0
for j in range(i,i+m):
# print("!!",i,s[j],t[j-i])
if t[j-i]==s[j]:
temp+=1
#print(i,temp)
ans = max(temp , ans)
print(m - ans)
|
p02571 | s351801183 | Accepted | s = list(input())
t = list(input())
ans = len(t)
for i in range(0, len(s) - len(t) + 1):
tmp = len(t)
tmp1 = s[i:i + len(t)]
for j in range(len(t)):
if tmp1[j] == t[j]:
tmp -= 1
ans = min(ans, tmp)
print(ans)
|
p02571 | s893109281 | Accepted | S=input()
T=input()
maxc=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
if maxc<count:
maxc=count
print(int(len(T)-maxc)) |
p02571 | s929958768 | Accepted | s = input()
t = input()
ans = 0
ls = len(s)
lt = len(t)
for i in range(ls-lt+1):
tmp = 0
for j in range(lt):
if s[i+j] == t[j]:
tmp+=1
ans = max(ans,tmp)
print(lt-ans) |
p02571 | s866731324 | Accepted | s = input()
t = input()
ans_list = []
end = len(s) - len(t) + 1
for i in range(end):
word = s[i:i+len(t)]
tmp = 0
for j in range(len(t)):
if t[j] != word[j]:
tmp += 1
ans_list.append(tmp)
ans_list.sort()
ans = ans_list[0]
print(ans) |
p02571 | s518163524 | Accepted | S = input()
T = input()
ans = 1001
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
ans = min(ans, c)
print(ans)
|
p02571 | s611074330 | 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 | s478621581 | Accepted | import math
s = input()
t = input()
ans = 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
ans = min(ans, c)
print(ans) |
p02571 | s052889197 | Accepted | s = input()
t = input()
ans = 10000
for i in range(len(s)-len(t)+1):
score = 0
for j in range(len(t)):
if s[i+j] != t[j]:
score += 1
ans = min(ans, score)
print(ans) |
p02571 | s765452914 | Accepted | s = input()
t = input()
min_count = len(s)
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 min_count > count:
min_count = count
print(min_count)
|
p02571 | s443209215 | Accepted | import sys
input = sys.stdin.readline
S = input()
T = input()
S = S.replace('\n','')
T = T.replace('\n','')
s_list = list(S)
t_list = list(T)
itti = 0
min_count = 10**5
for i in range(len(s_list)):
if i + len(t_list) > len(s_list):
break
count = 0
for j in range(len(t_list)):
if not s_list[i+j] == t_list[j]:
count += 1
min_count = min(count,min_count)
print(min_count) |
p02571 | s117171814 | Accepted | S = input()
T = input()
a = 0
ans = len(T)
c = len(T)
for i in range(len(S)-len(T)+1):
b = 0
c = len(T)
for j in T:
if S[i+b] == j:
c -= 1
b += 1
else:
if ans > c:
ans = c
print(ans)
|
p02571 | s064148965 | 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 | s076962747 | Accepted | S = input()
T = input()
length = len(T)
index = 0
minimum = 1000
count = 0
for i in range(len(S)):
if length+index > len(S):
break
bubun = S[index:length+index]
for s, t in zip(bubun, T):
if s != t:
count += 1
minimum = min(minimum, count)
index += 1
count = 0
print(minimum) |
p02571 | s957077449 | Accepted | import math
import collections
import fractions
import itertools
import functools
import operator
import bisect
def solve():
s = input()
t = input()
hoge = 10000
let = len(t)
les = len(s)
ans = 10000
for i in range(les-let+1):
hoge = s[i:i+let]
piyo = 0
for j, k in zip(hoge,t):
if j != k:
piyo += 1
if piyo < ans:
ans = piyo
print(ans)
return 0
if __name__ == "__main__":
solve()
|
p02571 | s286769086 | Accepted | s = input()
t = input()
n = len(s)
m = len(t)
res = m
for i in range(n-m+1):
curr = 0
for j in range(m):
if t[j]!=s[i+j]:
curr+=1
res = min(res, curr)
print(res) |
p02571 | s952557825 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s)):
if len(t)> len(s)-i:
break
else:
cnt=0
for j in range(len(t)):
if s[i+j]==t[j]:
cnt+=1
ans=min(ans,len(t)-cnt)
print(ans)
|
p02571 | s360836222 | Accepted | string1 = input()
string2 = input()
n, m = len(string1), len(string2)
best = float("inf")
for i in range(n - m + 1):
current = string1[i:i+m]
differences = 0
for i in range(m):
if current[i] != string2[i]:
differences += 1
best = min(differences, best)
if best == float("inf"):
print(0)
else:
print(best) |
p02571 | s057741494 | Accepted | s = input()
t = input()
ans = 1000
for idx in range(len(t), len(s)+1):
tmp = 0
for s_s, t_s in zip(list(s[idx-len(t):idx]), list(t)):
if not s_s == t_s:
tmp += 1
if ans > tmp:
ans = tmp
print(ans) |
p02571 | s493901856 | Accepted | t = list(input())
s = list(input())
ans = 10000
for i in range(len(t)-len(s)+1):
tmpans = 0
for j in range(len(s)):
if s[j] != t[i+j]:
tmpans += 1
if ans > tmpans:
ans = tmpans
print(ans) |
p02571 | s686094943 | Accepted | s = input()
t = input()
tt = t
max_count = 0
while True:
count = 0
for i in range(len(tt)):
if s[i] == tt[i]:
count += 1
# print(count)
max_count = max(max_count, count)
# print(f"{len(s)} {len(t)}")
if len(s) == len(tt):
break
tt = ' ' + tt
print(len(t) - max_count) |
p02571 | s604684243 | Accepted | S = input()
T = input()
list_s = list(S)
list_t = list(T)
A = []
for i in range(len(list_s)-len(list_t)+1):
t = i
count = 0
for j in range(len(list_t)):
if list_t[j] == list_s[t]:
t +=1
count +=1
else:
t +=1
A.append(count)
print(len(list_t) - max(A)) |
p02571 | s775619121 | Accepted | s = input()
t = input()
sl = len(s)
tl = len(t)
ans = tl
for i in range(sl):
if i < sl - tl + 1:
ss = s[i:i+tl]
num = 0
for j in range(tl):
if ss[j] != t[j]:
num += 1
if num < ans:
ans = num
print(ans)
|
p02571 | s729336337 | Accepted | s = input()
t = input()
x = len(t)
y = len(s) - len(t) + 1
z = 0
for i in range(y):
a = 0
for j in range(x):
if s[i + j] == t[j]:
a += 1
z = max(z, a)
print(x - z) |
p02571 | s320389187 | Accepted | s=input()
t=input()
ans=1001
n=len(s)
m=len(t)
for i in range(n-m+1):
cnt=0
x=s[i:i+m]
for j in range(m):
if x[j]!=t[j]:
cnt+=1
ans=min(ans,cnt)
print(ans) |
p02571 | s416872628 | Accepted | S = input()
T = input()
count = []
for i in range(len(S) - len(T) + 1):
match_count = 0
for s, t in zip(S[i:i+len(T)], T):
if s in t:
match_count += 1
count.append(match_count)
print(len(T) - max(count))
|
p02571 | s217186454 | Accepted | s = list(input())
t = list(input())
ans = 100000
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 | s331765761 | Accepted | #a,b,c = list(map(int,input().split()))
s = input().rstrip()
t = input().rstrip()
best = 99999999
for i in range(len(s) - len(t) + 1):
tmp = 0
for j in range(len(t)):
if t[j] != s[j+i]:
tmp += 1
best = min(best,tmp)
print(best) |
p02571 | s806559878 | Accepted | s = str(input())
t = str(input())
n = len(s)
m = len(t)
ans = float("inf")
for i in range(n-m+1):
si = s[i:i+m]
c = 0
for j in range(m):
if si[j] != t[j]:
c += 1
if c < ans:
ans = c
print(ans)
|
p02571 | s695648240 | Accepted | S = input()
T = input()
cnt = 0
best = 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 > best:
best = cnt
print(len(T) - best) |
p02571 | s420899936 | Accepted | def resolve():
S = input()
T = input()
sl = len(S)
tl = len(T)
mn = 10000
for i in range(sl - tl+1):
count = 0
#print(T,S[i:i+tl])
for j,k in zip(T,S[i:i+tl]):
if j!=k:
count+=1
mn=min(mn,count)
print(mn)
resolve() |
p02571 | s788180420 | Accepted | S = str(input())
T = str(input())
N = 10000
for i in range(len(S) - len(T)+ 1):
s =S[i:(i+len(T))]
n =0
for k in range(len(T)):
if s[k] != T[k]:
n+= 1
N = min(N, n)
print(N) |
p02571 | s215076018 | Accepted | S =input()
T = input()
n = len(S)-len(T)+1
count = []
for i in range(n):
c =0
for p in range(len(T)):
if S[i+p] != T[p]:
c += 1
count.append(c)
print(min(count))
|
p02571 | s084354993 | Accepted | S = input()
T = input()
l = []
for i in range(len(S)-len(T) + 1):
c = 0
s = S[i:i + len(T)]
for j in range(len(T)):
if s[j] != T[j]:
c += 1
l.append(c)
print(min(l)) |
p02571 | s506581275 | Accepted | s = input()
t = input()
slen = len(s)
tlen = len(t)
ans = 10**20
temp = 0
for start in range(0,slen-tlen+1):
temp = 0
for i in range(0,tlen):
if t[i] != s[start+i]:
temp += 1
ans = min(ans,temp)
print(ans)
|
p02571 | s037213754 | Accepted | s = input()
t = input()
maxcount = 0
for i in range(len(s) - len(t) + 1):
ss = s[i:len(t) + i]
count = 0
for j in range(len(t)):
if t[j] == ss[j]:
count += 1
if count > maxcount:
maxcount = count
print(len(t) - maxcount)
|
p02571 | s052338832 | Accepted | s = input()
t = input()
def compare(a,b):
r = 0
for i in range(len(a)):
if a[i] != b[i]:
r += 1
return r
res = 10000
for i in range(len(s)-len(t)+1):
res = min(compare(s[i:i+len(t)], t), res)
print(res) |
p02571 | s724569109 | Accepted | s, t = input(), input()
len_t = len(t)
dif = 1001
for i in range(len(s)-len_t+1):
dif = min(dif, sum([x != y for x, y in zip(s[i:i+len_t], t)]))
print(dif) |
p02571 | s859440269 | Accepted | # -*- coding: utf-8 -*-
def main():
s = input()
n = len(s)
t = input()
m = len(t)
ans = float('inf')
for i in range(n - m + 1):
u = s[i:i + m]
count = 0
for ui, ti in zip(u, t):
if ui != ti:
count += 1
ans = min(ans, count)
print(ans)
if __name__ == '__main__':
main()
|
p02571 | s798507583 | Accepted | N = input()
S = input()
a = 0
nums = list(N[i:i+len(S)] for i in range(len(N)) if i+len(S)-1 < len(N))
nums_max = 0
for i in nums:
tmp = 0
for j in range(len(S)):
if i[j] == S[j]:
tmp += 1
if nums_max < tmp:
nums_max = tmp
print(len(S)-nums_max) |
p02571 | s114678634 | Accepted | s = input()
t = input()
min_num = len(t)
tbd = 0
for i in range(0,len(s)-len(t)+1):
for j in range(len(t)):
if s[i:i+len(t)][j] != t[j]:
tbd += 1
if tbd <= min_num:
min_num = tbd
tbd = 0
print(min_num)
|
p02571 | s303317060 | 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(ans, tmp)
print(ans)
|
p02571 | s553925275 | Accepted | S, T = input(), input()
ans = 10 ** 9
for i in range(len(S)-len(T)+1):
now = 0
for j in range(len(T)):
if S[i+j] != T[j]: now += 1
ans = min(ans, now)
print(ans) |
p02571 | s526797195 | Accepted | S=list(input())
T=list(input())
def ask_true(a,b):
if a == b:
return True
else:
return False
d=10000
for i in range(len(S)-len(T)+1):
sum_=0
for j in range(len(T)):
if ask_true(S[i+j],T[j]):
pass
else:
sum_ += 1
d=min(sum_,d)
print(d) |
p02571 | s657728799 | Accepted | def compare(ar1,ar2):
count = 0
for i in range(len(ar1)):
if ar1[i] != ar2[i]:
count+=1
return count
s = input()
t = input()
lowest = len(t)
for i in range(len(s)-len(t)+1):
res = compare(t,s[i:i+len(t)])
if res < lowest:
lowest = res
print(lowest) |
p02571 | s912392903 | Accepted | S = input()
T = input()
min_cnt = 9999999999
for i in range(0, len(S) - len(T)+1):
s = S[i: i + len(T)]
cnt = 0
for m, n in zip(s, T):
if m != n:
cnt +=1
min_cnt = min(min_cnt, cnt)
print(min_cnt)
|
p02571 | s632267899 | Accepted | S=input()
LS=len(S)
T=input()
LT=len(T)
ans=LT
for i in range(LS-LT+1):
tmp=0
for j in range(LT):
if S[i+j]!=T[j]:
tmp+=1
#print(tmp)
ans=min(tmp,ans)
#tmp=0
print(ans) |
p02571 | s681007106 | Accepted | S = input().strip()
T = input().strip()
k = len(T)
dmin = len(S)
for i in range(len(S)-k+1):
cnt = 0
for j in range(k):
if S[i+j]!=T[j]:
cnt += 1
dmin = min(dmin,cnt)
print(dmin) |
p02571 | s648073788 | Accepted | s=input()
t=input()
anses=[]
for i in range(0,len(s)-len(t)+1,1):
cnt=0
for j in range(len(t)):
if s[i+j]==t[j]:
cnt+=1
anses.append(cnt)
print(len(t)-max(anses))
|
p02571 | s403718758 | Accepted | s=input()
t=input()
ans=10**8
n=len(s);m=len(t)
for i in range(n-m+1):
cnt=0
for j in range(m):
if s[i+j]!=t[j]:
cnt+=1
ans=min(ans,cnt)
print(ans) |
p02571 | s672227487 | Accepted | S=input()
T=input()
max_ans=0
for i in range(len(S)):
max_n = 0
for j in range(len(T)):
if len(S) >= i + len(T):
if S[i+j]==T[j]:
max_n=max_n+1
if max_ans <= max_n:
max_ans=max_n
print(len(T)-max_ans) |
p02571 | s076857927 | Accepted | S=input()
T=input()
ans = len(T)
for i in range(len(S)-len(T)+1):
c = 0
for j in range(len(T)):
if T[j] != S[i+j]:
c+=1
ans = min(c,ans)
print(ans)
|
p02571 | s603617069 | Accepted | s=input()
t=input()
l=len(s)-len(t)
mindiff=float("inf")
for i in range(l+1):
ss=s[i:i+len(t)]
cnt=0
for j,c in enumerate(t):
if ss[j]!=c:
cnt+=1
mindiff=min(mindiff,cnt)
print(mindiff)
|
p02571 | s232153647 | Accepted | S = input ()
T = input ()
X = len(T)
for i in range (len(S)-len(T)+1):
x = 0
for j in range (len(T)):
if T[j] != S[i+j]:
x += 1
if X > x:
X = x
print (X) |
p02571 | s902343358 | Accepted | s = str(input())
t = str(input())
n = len(s)
m = len(t)
ans = 10000
for i in range(n-m+1):
ans_temp = 0
for j in range(m):
if s[i+j] != t[j]:
ans_temp += 1
ans = min(ans, ans_temp)
print(ans)
|
p02571 | s406396046 | Accepted | S = input()
T = input()
len_s = len(S)
len_t = len(T)
ans = 0
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
ans = max(ans,c)
print(len_t-ans) |
p02571 | s161200188 | Accepted | S = input()
T = input()
result = float('inf')
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
result = min(result, c)
print(result)
|
p02571 | s197186588 | Accepted | s = input()
t = input()
ans = 10**9
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
ans = min(ans, c)
print(ans)
|
p02571 | s522992439 | Accepted | s = input()
t = input()
minCount = len(t)
l = len(s) - len(t) + 1
for i in range(l):
count = 0
for n in range(len(t)):
if s[i+n] != t[n]:
count+=1
if count < minCount:
minCount = count
print(minCount) |
p02571 | s783056638 | Accepted | import numpy as np
import sys
S = input()
T = input()
counter = 0
max_counter = 0
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
if S[j+i] == T[j]:
counter = counter + 1
if counter > max_counter:
max_counter = counter
# print(counter)
# print('max = ' + str(max_counter))
counter = 0
print(int(len(T)) - int(max_counter)) |
p02571 | s102765885 | Accepted | S = input()
T = input()
ans = 10 ** 9
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 | s690991703 | Accepted | S = input()
T = input()
ma = 0
for i in range(len(S)-len(T)+1):
Ssub = S[i:i+len(T)]
match = 0
for j in range(len(T)):
if Ssub[j] == T[j]:
match += 1
if ma < match:
ma = match
print(len(T)-ma) |
p02571 | s077249368 | Accepted | from itertools import combinations
import math
S = input()
T = input()
#N = int(input())
#C = input()
#D, T, S=map(int,input().split())
#C = []
#for i in range(N):
# C.append(list(map(int,input().split())))
c = 0
for i in range(len(S)-(len(T)-1)):
cc = 0
for t in range(i, i+len(T)):
if S[t] == T[t-i]:
cc += 1
if c<cc:
c=cc
print(len(T)-c) |
p02571 | s436434700 | Accepted | s, t = [input() for i in range(2)]
c = []
for i in range(len(s) - len(t) + 1):
d = len(t)
for a, b in zip(s[i:], t):
if a == b:
d -= 1
c.append(d)
print(min(c)) |
p02571 | s777709137 | Accepted | import sys
input = sys.stdin.readline
from collections import *
def calc(i):
d = 0
for j in range(len(T)):
if S[i+j]!=T[j]:
d += 1
return d
S = input()[:-1]
T = input()[:-1]
ans = 10**18
for i in range(len(S)-len(T)+1):
ans = min(ans, calc(i))
print(ans) |
p02571 | s554940896 | Accepted | S = input()
T = input()
result = 10000
for i in range(len(S) - len(T) + 1):
# print(i)
start = i
count = 0
for j in range(len(T)):
if T[j] != S[i + j]:
count += 1
result = min(count, result)
print(result)
|
p02571 | s335843068 | Accepted | def Qb():
s = input()
t = input()
ans = len(t)
for v in range(len(s) - len(t) + 1):
a = [t[i] != x for i, x in enumerate(s[v:len(t)+v])]
if sum(a) < ans:
ans = sum(a)
print(ans)
if __name__ == '__main__':
Qb()
|
p02571 | s408444441 | Accepted | S = input().rstrip()
T = input().rstrip()
s = len(S)
t = len(T)
u = s-t+1
A = []
for i in range(u):
count = 0
for j in range(t):
if T[j] != S[i+j]:
count += 1
A.append(count)
print(min(A))
|
p02571 | s795299224 | Accepted | s = input()
t = input()
ans = len(t)
if len(s) == len(t):
for i in range(len(t)):
if s[i] == t[i]:
ans -= 1
else:
for i in range(len(s)-len(t)):
min_ans = 0
s1 = s[i:len(t)+i]
for j in range(len(t)):
if s1[j] != t[j]:
min_ans += 1
ans = min(ans,min_ans)
print(ans) |
p02571 | s569018755 | Accepted | S = list(input())
T = list(input())
def diff(s,t):
count = 0
#print(s,t)
for i in range(len(t)):
if s[i]!=t[i]:
count+=1
#print(count)
return count
min_c = diff(S,T)
for i in range(len(S)-len(T)):
d = diff(S[i:],T)
#print(d)
if d<min_c:
min_c = d
print(min_c)
|
p02571 | s591329240 | Accepted | S = input()
T = input()
n = len(T)
res = n
for i in range(len(S) - n + 1):
count = 0
for c1, c2 in zip(S[i: i + n], T):
if c1 != c2:
count += 1
res = min(count, res)
print(res)
|
p02571 | s262570270 | Accepted | S = input()
T = input()
min = len(T)
for t in range(len(S) - len(T)+1):
tmp = 0
for i in range(len(T)):
if S[i+t] != T[i]:
tmp+=1
if tmp < min:
min = tmp
print(min) |
p02571 | s078764815 | Accepted | S = list(str(input()))
T = list(str(input()))
i = 0
ans = []
len_s = len(S)
len_t = len(T)
while i < len_s-len_t+1:
cnt = 0
for ss, tt in zip(S[i:i+len_t], T):
if ss != tt:
cnt += 1
ans.append(cnt)
i += 1
print(min(ans)) |
p02571 | s560984541 | Accepted | S = list(input())
T = list(input())
ls = len(S)
lt = len(T)
ans = lt
for i in range(ls):
temp = 0
if i+lt > ls:
break
subS = S[i:i+lt]
for ss, st in zip(subS, T):
if ss != st:
temp += 1
ans = min(ans, temp)
print(ans) |
p02571 | s374323265 | Accepted | s=list(input())
t=list(input())
ans=[]
for i in range(len(s)-len(t)+1):
u=s[i:len(t)+i]
a=0
for j in range(len(t)):
if not t[j-1]==u[j-1]:
a=a+1
ans.append(a)
print(min(ans)) |
p02571 | s729067334 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[15]:
S = input()
T = input()
# In[16]:
len_s = len(S)
len_t = len(T)
ans = len_t
for i in range(len_s-len_t+1):
tmp = S[i:i+len_t]
cnt = 0
for j in range(len_t):
if tmp[j] != T[j]:
cnt += 1
ans = min(ans, cnt)
print(ans)
# In[ ]:
|
p02571 | s185010046 | Accepted | def main():
ss = list(input())
ts = list(input())
n, m = len(ss), len(ts)
ans = float("inf")
for i in range(n-m+1):
ans_temp = 0
for j in range(m):
if ss[i+j] != ts[j]:
ans_temp += 1
ans = min(ans, ans_temp)
print(ans)
if __name__ == "__main__":
main()
|
p02571 | s053476759 | Accepted | s=input()
t=input()
ans=len(t)
for i in range(len(s)-len(t)+1):
p=s[i:i+len(t)]
cur = 0
for j in range(len(t)):
if t[j] != p[j]:
cur += 1
ans=min(ans,cur)
print(ans)
|
p02571 | s800513964 | Accepted | s, t = input(), input()
i, j = 0, 0
longest = 0
for i in range(len(s)-len(t)+1):
count = sum([s[i+j] == t[j] for j in range(len(t))])
longest = max(longest, count)
print(len(t)-longest)
|
p02571 | s572920692 | 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(count,ans)
print(ans) |
p02571 | s591650698 | Accepted | S = list(input())
T = list(input())
L = len(T)
ans = L
for i in range(len(S)-L+1):
check = 0
for j in range(L):
if(S[i+j] != T[j]):
check += 1
if(ans > check):
ans = check
print(ans)
|
p02571 | s437578429 | Accepted | s = input()
t = input()
ans = []
for i in range(len(s)-len(t) + 1):
s_i = s[i:i+len(t)]
count_diff = 0
for t_j, s_j in zip(t, s_i):
if t_j != s_j:
count_diff += 1
ans.append(count_diff)
print(min(ans)) |
p02571 | s796237674 | Accepted | S = input()
T = input()
L = len(S) - len(T) + 1
c = [0 for i in range(L)]
for i in range(L):
X = S[i:i+len(T)]
for j in range(len(X)) :
if X[j] != T[j] :
c[i] = c[i] + 1
ans = min(c)
print(ans) |
p02571 | s139705695 | Accepted | s = input()
t = input()
c = 0
c_list = []
for i in range(len(s)-len(t)+1):
#print(s[i:len(t)+i])
tmp_s = s[i:len(t)+i]
for j in range(len(t)):
if(tmp_s[j] == t[j]):
c += 1
c_list.append(c)
c = 0
print(len(t)-max(c_list)) |
p02571 | s694817830 | Accepted | s = list(input())
t = list(input())
max = 0
c = 0
for i in range(len(s) - len(t) + 1):
for j in range(len(t)):
if t[j] == (s[i:i+len(t)])[j]:
c += 1
if max < c:
max = c
c = 0
print(len(t) - max) |
p02571 | s581105059 | Accepted | import sys
import heapq
from collections import deque
from functools import cmp_to_key
from itertools import combinations
from itertools import permutations
si = sys.stdin.readline
so = sys.stdout.write
sys.setrecursionlimit(10000)
def main():
s = si()[:-1]
t = si()[:-1]
cnt = 1000+1
for i in range(len(s)-len(t)+1):
curr = 0
for j in range(len(t)):
if s[i+j] != t[j]:
curr += 1
cnt = min(cnt, curr)
print(cnt)
if __name__ == '__main__':
main()
|
p02571 | s602231740 | Accepted | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
S = input()
T = input()
ans = INF
for i in range(len(S) - len(T) + 1):
ans = min(ans, sum(s != t for s, t in zip(S[i : i + len(T)], T)))
print(ans)
resolve() |
p02571 | s774266097 | Accepted | S = input()
T = input()
match = 0
k = 0
result = 0
for i in range(len(S)-len(T)+1) :
k = i # start
match = 0
for j in range(len(T)) :
#print(T[j],S[k])
if T[j] == S[k] :
match = match + 1
k += 1
result = max(result,match)
#print(result)
print(len(T) - result) |
p02571 | s237744579 | Accepted | s=input()
t=input()
l=len(s)
l2=len(t)
ans=1000000
for i in range(l-l2+1):
curr=0
for j in range(i,i+l2):
if(s[j]!=t[j-i]):
curr+=1
if(curr<ans):
ans=curr
print(ans) |
p02571 | s540844583 | Accepted | S = input()
T = input()
L = len(T)
ans = 0
for i in range(len(S)-L+1):
cnt = 0
for j in range(L):
if S[i+j] == T[j]:
cnt += 1
ans = max(ans,cnt)
print(L-ans) |
p02571 | s319145828 | Accepted | slist=list(input())
tlist=list(input())
s=len(slist)
t=len(tlist)
kazu=s-t+1
ans=10000000000
for i in range(kazu):
kari=[]
an=0
for j in range(i,i+t):
kari.append(slist[j])
for k in range(t):
if tlist[k]!=kari[k]:
an+=1
if ans>an:
ans=an
print(ans) |
p02571 | s102987458 | Accepted | s=input()
t=input()
n=len(s);k=len(t)
an=k
for i in range(n-k+1):
a=s[i:i+k]
ct=0
for j in range(k):
if a[j]!=t[j]:
ct+=1
an=min(an,ct)
print(an) |
p02571 | s388251787 | Accepted | S=input()
T=input()
def diff(s,t):
out=0
for i in range(len(s)):
if s[i]!=t[i]:
out+=1
return out
ans=10000
for i in range(len(S)-len(T)+1):
tmp = diff(S[i:i+len(T)], T)
ans = min(ans,tmp)
print(ans) |
p02571 | s949912444 | Accepted | s = input()
t = input()
most = float("inf")
for i in range(len(s)-len(t)+1):
count = 0
for j in range(i,i+len(t)):
if s[j] != t[j-i]:
count += 1
most = min(most,count)
print(most) |
p02571 | s968735120 | Accepted | s=input()
t=input()
n=len(s)
m=len(t)
ans=0
for i in range(n-m+1):
c=0
for j in range(m):
if s[i+j]==t[j]:
c+=1
ans=max(c,ans)
print(m-ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.