problem_id stringclasses 100 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 6 806 |
|---|---|---|---|
p02571 | s991270151 | Wrong Answer | s = input()
t = input()
cnt = 0
max = 0
for i in range(len(s)-len(t)):
cnt = 0
for j in range(len(t)):
if s[i] == t[j]:
cnt += 1
if cnt > max:
max = cnt
else:
break
print(len(t)-max-1) |
p02571 | s961105396 | Wrong Answer | s = list(input())
t = list(input())
tmp = 0
ans = len(t)
j_tmp = 0
for i in range(len(s) - len(t)):
tmp = 0
for j in range(len(t)):
if s[i + j] != t[j]:
tmp += 1
if tmp < ans:
ans = tmp
print(ans)
|
p02571 | s300628752 | Wrong Answer | s=str(input())
t=str(input())
n=len(t)
ans=0
for k in range(1,len(t)+1):
for i in range(n-k+1):
if(t[i:i+k] in s):
ans=k
print(n-ans) |
p02571 | s434328699 | Wrong Answer | s=input()
t=input()
result = 0
for i in range(len(s)):
count = 0
flg = False
for j in range(len(t)):
if i+j > len(s)-1:
break
if t[j] == s[i+j]:
flg = True
else:
flg = False
if flg:
count += 1
result = max(result,count)
print(len(t)-result) |
p02571 | s676262061 | Wrong Answer | S = input()
T = input()
minChangeCounter = 1000000
for i in range(len(S) - len(T)):
substr = S[i:i + len(T)]
changeCounter = 0
for j in range(len(T)):
if not substr[j] == T[j]:
changeCounter += 1
if changeCounter < minChangeCounter: minChangeCounter = changeCounter
print(minChangeCounter)
|
p02571 | s525495409 | Wrong Answer | S = input()
T = input()
max_count = 0
for start in range(len(T)):
for end in range(start, len(T)):
if T[start] == S[start]:
if T[start:end+1] in S[start:-(len(T)-end)]:
max_count = max(max_count, len(T[start:end+1]))
answer = len(T) - max_count
print(answer)
|
p02571 | s052331401 | Wrong Answer | s = input()
t = input()
ans = 0
max = 0
if t in s:
print(ans)
else:
for i in range(len(s) - len(t)):
for j in range(len(t)):
if t[j] == s[i]:
ans += 1
else:
if max < ans:
max = ans
ans = 0
print(len(t) - max) |
p02571 | s497245114 | Wrong Answer | import sys
input = sys.stdin.readline
S = input()
T = input()
if len(S) - len(T) > 0:
score_list = []
for i in range(0, len(S) - len(T) + 1):
s = S[i:i+len(T)]
if len(s) != len(T):
continue
score = sum([1 if s[i]==T[i] else 0 for i in range(len(s))])
score_list.append(score)
print(len(T) - max(score_list))
else:
score = sum([1 if S[i]==T[i] else 0 for i in range(len(S))])
print(len(T) - score) |
p02571 | s997208945 | Wrong Answer | s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t)):
count = 0
for j in range(len(t)):
if s[j+i] != t[j]:
count += 1
ans = min(ans, count)
print(ans)
|
p02571 | s971319061 | Wrong Answer | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque
import re
S=input()
T = input()
snum = len(S)
tnum = len(T)
m = tnum
for start in range(snum - tnum + 1):
diff = 0
for i in range(tnum):
if S[start+i] != T[i]:
diff += 1
m = min(tnum, diff)
print(m)
|
p02571 | s545174340 | Wrong Answer | def resolve():
S = input()
T = input()
mincnt = float("inf")
for ptr in range(len(S)-len(T)):
cnt = 0
for i in range(len(T)):
sptr = ptr + i
if S[sptr] != T[i]:
cnt += 1
mincnt = min(cnt, mincnt)
print(mincnt)
if '__main__' == __name__:
resolve() |
p02571 | s632743109 | Wrong Answer | def resolve():
S = input()
T = input()
for matches in range(len(T), 0, -1):
for ptr in range(len(T)):
if ptr+matches > len(T):
break
subt = T[ptr:ptr+matches]
if subt in S[ptr:]:
print(len(T)-matches)
return
print(len(T))
if '__main__' == __name__:
resolve() |
p02571 | s084850168 | Wrong Answer | s = input()
t = input()
def find_common(s1, s2):
count = 0
for c,y in zip(s1, s2):
if c == y:
count += 1
return count
start = 0
end = len(t)
ans = 0
while end < len(s):
ans = max(ans, find_common(t, s[start:end]))
start+=1
end+=1
print(len(t)- ans) |
p02571 | s193713027 | Wrong Answer | s=input()
t=input()
if t in s:
print(0)
else:
ans=100000
num=len(s)-len(t)
for i in range(num):
r=0
for j in range(len(t)):
if s[i+j]!=t[j]:
r+=1
if r<ans:
ans=r
print(ans) |
p02571 | s493096792 | Wrong Answer | S = input()
T = input()
c = len(S) - len(T)
m = 1000
for i in range(c):
count = 0
for s, t in zip(S[i:], T):
if s != t:
count += 1
m = min(m, count)
print(m) |
p02571 | s808083572 | Wrong Answer | s = input()
t = input()
s_len = len(s)
t_len = len(t)
ans = s_len
for i in range(0,s_len):
tmp = 0
for j in range(0,t_len):
if i+j >= s_len:
continue
if s[i+j] != t[j]:
tmp = tmp + 1
ans = min(tmp,ans)
print(ans) |
p02571 | s929724335 | Wrong Answer | S=input()
T=input()
m=2000
for i in range(len(S)-len(T)):
U=S[i:i+len(T)]
c=0
for j in range(len(T)):
if U[j]!=T[j]:
c+=1
m=min(c,m)
print(m) |
p02571 | s532758474 | Wrong Answer | S = list(input())
T = list(input())
array = [0. for i in range(len(S))]
count = 0
for i in range(len(S)):
for j in range(len(T)):
if S[i] == T[j] and i >= j:
count += 1
array[i] += count
break
else:
count = 0
print(int(len(T)-max(array))) |
p02571 | s421890072 | Wrong Answer | S = input()
T = input()
lent = len(T)
ans = lent
for i in range(len(S)-lent):
s = S[i:i+lent]
lev = 0
lev = sum(map(lambda x: x[0] != x[1], zip(s, T)))
if lev == 0:
ans = 0
break
elif lev < ans:
ans = lev
print(ans)
|
p02571 | s941728091 | Wrong Answer | S = input()
T = input()
amount = 0
for i in range(len(T)-1):
for j in range(i+1,len(T)+1):
tmp = T[i:j]
if tmp in S[i:] and amount < len(tmp):
amount = len(tmp)
print(len(T)-amount) |
p02571 | s271995310 | Wrong Answer | s = input()
t = input()
n = len(s) - len(t) + 1
ans = 1000
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(temp) |
p02571 | s632268148 | Wrong Answer | S = input()
T = input()
S_list = list(S)
T_list = list(T)
answer = 1000
for i in range(len(S_list)-len(T_list)+1):
count = 0
for j in range(len(T_list)):
if(S_list[i] != T_list[j]):
count +=1
i += 1
answer = min(count, answer)
print(answer) |
p02571 | s508049855 | Wrong Answer | s=input()
t=input()
y=len(t)
z=len(s)
for i in range(0,(z-y+1)):
xx=i+y
s1=s[i:xx]
ct=0
yy=y
for j in range(0,y):
if(s1[j]==t[j]):
ct+=1
z=y-ct
if(z<yy):
yy=z
print(yy)
|
p02571 | s739408131 | Wrong Answer | a = str(input())
b = str(input())
ind = 0
for i in range(len(b)):
if b[i:len(b)] in a or b[0:len(b)-i] in a:
ind += 1
print(len(b)-ind)
|
p02571 | s479648252 | Wrong Answer | S = input()
T = input()
s = len(S)
t = len(T)
ans = 10**9
for i in range(s - t):
tmp = 0
for j in range(t):
if S[i + j] != T[j]:
tmp += 1
ans = min(ans, tmp)
print(ans) |
p02571 | s314449421 | Wrong Answer | S = input()
T = input()
ans = len(T)
for i in range(len(S)-len(T)):
diff = 0
for j in range(len(T)):
if T[j] != S[i + j]:
diff = diff + 1
ans = min(ans, diff)
print(ans)
|
p02571 | s740157752 | Wrong Answer | s = input()
t = input()
ls = len(s)
lt = len(t)
ans = ls
for i in range(0, lt):
for j in range(0, lt - i + 1):
r = t[i:i+j]
if r in s[i:ls-j]:
a = lt - len(r)
if a < ans:
ans = a
print(ans)
|
p02571 | s265950103 | Wrong Answer | S = input()
T = input()
for i in range(len(T), 0, -1):
for j in range(len(T)-i+1):
subst = T[j:i+j]
# print(subst)
if S.find(subst, j, len(S)-(len(T)-i-j))>=0:
print (len(T)-i)
# print(subst)
exit(0)
|
p02571 | s281639246 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
S = input()
T = input()
N = len(S)
M = len(T)
ans = float('inf')
for i in range(N - M):
cnt = 0
for j in range(M):
if T[j] != S[i:(i + M)][j]:
cnt += 1
ans = min(ans, cnt)
print(ans-1)
if __name__ == '__main__':
main()
|
p02571 | s202321569 | Wrong Answer | import sys
input = sys.stdin.readline
S = input().strip()
T = input().strip()
N = len(S)
M = len(T)
ans = 10**10
for i in range(N-M):
subS = S[i:i+M]
temp = 0
for s,t in zip(subS, T):
if s != t:
temp += 1
ans = min(temp,ans)
print(ans)
|
p02571 | s019243759 | Wrong Answer | import re
S = input()
T = input()
k = 0
# if re.search(T, S):
# print(0)
# else:
for i in S:
k +=1
if re.search(T[0:len(T)-(k+1)], S):
break
print(k) |
p02571 | s552627149 | Wrong Answer | s = str(input())
t = str(input())
cnt = 0
max = 0
for i in range(len(s)-len(t)+1):
if max < cnt:
max = cnt
cnt = 0
for j in range(len(t)):
if s[j+i] == t[j]:
cnt += 1
print(len(t)-cnt) |
p02571 | s514154618 | Wrong Answer | s = input()
t = input()
cnt = 0
ans = 0
while cnt < len(s) - len(t):
chk = 0
for i, j in zip(range(cnt,cnt+len(t)),range(len(t))):
if s[i] == t[j]:
chk += 1
ans = max(ans,chk)
cnt += 1
print(len(t) - ans) |
p02571 | s003150536 | Wrong Answer | s = input()
t = input()
ans = float("inf")
flag = False
for i in range(len(s)-len(t)):
curr = 0
for j in range(len(t)):
# if i + j >= len(s):
# flag = True
# break
if t[j] != s[i + j]:
curr += 1
# if flag:
# break
ans = min(ans, curr)
print(ans)
|
p02571 | s615086570 | Wrong Answer | s = input()
t = input()
res = len(t)
for i in range(len(s)-len(t)):
tmp=len(t)
for j in range(len(t)):
if(s[i+j] == t[j]):
tmp -= 1
if res > tmp:
res = tmp
print(res) |
p02571 | s605263153 | Wrong Answer | s=list(input())
t=list(input())
m=len(t)
for i in range(len(s)-len(t)):
ma=0
for j in range(len(t)):
if s[i+j]!=t[j]:
ma+=1
if ma <m:
m=ma
print(m) |
p02571 | s248982608 | Wrong Answer | s1 = input()
s2 = input()
i = 0
j = len(s2)
m = len(s2)
while j < len(s1):
c = 0
for k in range(len(s2)):
if s2[k] == s1[k+i]:
c+=1
j += 1
i += 1
m = min(m, len(s2)-c)
print(m)
|
p02571 | s875878897 | Wrong Answer | s=input()
t=input()
n=len(s)-len(t)-1
ans=len(t)
for i in range(n):
cnt=0
for j in range(len(t)):
if s[i+j]!=t[j]:
cnt+=1
ans=min(ans,cnt)
print(ans)
|
p02571 | s310418403 | Wrong Answer | import sys
import math
S = list(str(input()))
T = list(str(input()))
ans = len(T)
for i in range(len(S) - len(T)):
change = 0
for j in range(len(T)):
# print(f'i {i}, j {j}')
if T[j] != S[i + j]:
change += 1
ans = min(ans, change)
print(ans)
|
p02571 | s358633173 | Wrong Answer | s=list(input())
t=list(input())
S=len(s)
T=len(t)
count=0
ans=1000
for i in range(S-T):
count=0
for j in range(T):
if s[i+j]!=t[j]:
count+=1
ans=min(ans,count)
print(ans) |
p02571 | s254396966 | Wrong Answer | S=input()
T=input()
c=len(T)
for i in range(len(S)-len(T)):
d=0
for j in range(len(T)):
if S[i+j]!=T[j]:
d+=1
if d<c:
c=d
print(c)
|
p02571 | s909983278 | Wrong Answer | from collections import deque
import sys, copy, itertools,heapq
input = sys.stdin.readline
S = input()
T = input()
s = len(S)
t = len(T)
#A=[0]*(len(S))
ans = float('inf')
for i in range(len(S)-len(T)+1):
x = 0
for j in range(len(T)):
if S[i+j] != T[j]:
x += 1
ans = min(ans, x)
#print(s)
#print(t)
#print(A)
print(ans) |
p02571 | s844986424 | Wrong Answer | S = input()
T = input()
max_len = 0
for i in range(len(S)):
len_ = 0
for s, t in zip(S[i:], T):
if s == t:
len_ += 1
else:
pass
max_len = max(max_len, len_)
print(len(T) - max_len)
|
p02571 | s483103756 | Wrong Answer | s=input()
t=input()
n=len(t)
ans=len(t)
for i in range(len(s)-len(t)):
tmp=0
for j in range(len(t)):
if s[i+j]!=t[j]:
tmp+=1
ans=min(ans,tmp)
print(ans) |
p02571 | s032268122 | Wrong Answer | import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().rstrip()
def main():
s = input()
t = input()
li = set()
for i in range(len(t)):
li.add(t[i])
li.add(t[i:])
li.add(t[:i])
for el in sorted(li, key=lambda x: len(x), reverse=True):
if el in s:
print(len(t) - len(el))
return
print(len(t))
if __name__ == '__main__':
main() |
p02571 | s466986080 | Wrong Answer | s=input()
a=len(s)
t=input()
b=len(t)
maxcnt=0
for i in range(a-b):
count=0
for j in range(b):
s1=s[i+j]
s2=t[j]
if(s1==s2):
count+=1
if(maxcnt<count):
maxcnt=count
print(b-maxcnt) |
p02571 | s840806864 | Wrong Answer | S = input()
T = input()
lent = len(T)
ans = lent
for i in range(len(S)-lent+1):
s = S[i:i+lent]
lev = 0
lev = sum(map(lambda x: x[0] != x[1], zip(s, T)))
print(s)
print(lev)
if lev == 0:
ans = 0
# break
elif lev < ans:
ans = lev
print(ans)
|
p02571 | s002582488 | Wrong Answer | s = input()
t = input()
t_len = len(t)
s_len = len(s)
max_ = 0
temp = 0
for i in range(s_len - t_len):
for j in range(t_len):
if s[i + j] == t[j]:
temp += 1
if max_ < temp:
max_ = temp
print(t_len - max_ + 1) |
p02571 | s528586805 | Wrong Answer | S=str(input())
S=list(map(str,S))
T=str(input())
T=list(map(str,T))
Ca=len(T)
for i in range(len(S)-len(T)+1):
Cb=len(T)
for j in range(len(T)):
if S[i+j]==T[j]:
Cb-=1
if Ca>Cb:
Ca=Cb
print(Cb) |
p02571 | s519456585 | Wrong Answer | S = input()
T = input()
answer = 100000
for i in range(len(S) - len(T)):
distance = 0
for j in range(len(T)):
if S[i + j] != T[j]:
distance += 1
if answer > distance:
answer = distance
print(answer) |
p02571 | s812399132 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
S = input()
T = input()
LS = len(S)
LT = len(T)
ans = 0
for i in range(LS-LT):
tmp = 0
for s, t in zip(S[i:i+LT],T):
if s==t:
tmp += 1
ans = max(ans, tmp)
print(LT-ans)
if __name__ == '__main__':
main()
|
p02571 | s139530630 | Wrong Answer | s=input()
t=input()
ans=len(t)
for i in range(len(s)-len(t)):
cnt=0
for j in range(len(t)):
if s[i+j]!=t[j]:
cnt+=1
ans=min(ans,cnt)
print(ans)
|
p02571 | s697048662 | Wrong Answer | S = input()
T = input()
ans = len(T)
for i in range(len(T)):
for j in range(i + 1, len(T) + 1):
if T[i:j] in S[i:-(len(T) - j)]:
if len(T) - len(T[i:j]) < ans:
ans = len(T) - len(T[i:j])
print(ans)
|
p02571 | s016131383 | Wrong Answer | s = input()
t = input()
ans = len(t)
for i in range(len(s)):
if (i + len(t) - 1 >= len(s)): break
dif = 0
for j in range(len(t)):
print(s[i + j])
if (s[i + j] != t[j]):
dif += 1
ans = min(ans, dif)
print(ans) |
p02571 | s544909659 | Wrong Answer | S = input()
T = input()
ls = len(S)
lt = len(T)
ans = lt
for i in range(ls-lt):
s = S[i:i+lt]
cnt = 0
for j in range(lt):
if s[j] != T[j]:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s576615107 | Wrong Answer | import sys
input = sys.stdin.readline
S = input()
T = input()
score_list = []
for i in range(0, len(S)-len(T)):
s = S[i:i+len(T)]
score = sum([1 if s[i]==T[i] else 0 for i in range(len(s))])
score_list.append(score)
if len(score_list) > 0:
print(len(T) - max(score_list))
else:
print(0) |
p02571 | s826513306 | Wrong Answer | S=input().strip()
T=input().strip()
ls = len(S)
lt = len(T)
x = lt
for i in range(0,ls-lt):
m = 0
for j in range(lt):
if T[j] != S[i+j]:
m += 1
x = min(x,m)
print(x)
|
p02571 | s081258223 | Wrong Answer | S = input()
T = input()
c =0
C = [0]
for i in range(len(S)):
for j in range(len(T)):
if S[i] == T[j] and i-j >= 0 and len(S)-i -1 >= len(T)-j -1:
c = 1
for k in range(len(T) - j-2):
if S[i + k + 1] == T[j + k +1]:
c += 1
C.append(c)
c = 0
break
C.append(c)
print(len(T)-max(C)) |
p02571 | s757545136 | Wrong Answer | S=input()
T=input()
def func():
for i in reversed(range(1,len(T)+1)):
p=T[0:i]
# print(i,p)
if (-1!=S.find(p)):
return(len(T)-i)
p=T[len(T)-i:len(T)]
# print(i,p)
if (-1!=S.find(p)):
return(len(T)-i)
print(func()) |
p02571 | s088862787 | Wrong Answer | strS = input()
strT = input()
maxRange = 0
l = 0
while l <= (len(strS)-len(strT)):
m = 0
count = 0
while m < (len(strT)):
if strS[l+m] != strT[m]:
count += 1
m += 1
if maxRange > count:
maxRange = count
l += 1
print(maxRange)
|
p02571 | s452044556 | Wrong Answer | s = input()
t = input()
if t in s:
print(0)
else:
for i in range(len(t)-1):
i += 1
t1 = t[:i]
t2 = t[i:]
if t2 in s:
print(i)
break
i *= -1
t3 = t[i:]
t4 = t[:i]
if t4 in s:
print(i*-1)
break
print(len(t)) |
p02571 | s054720341 | Wrong Answer | # coding: utf-8
from functools import reduce
from queue import Queue
from collections import deque
s = input()
t = input()
saisho_kyori = 1001
for i in range(len(s) - len(t)):
kyori = 0
for j in range(len(t)):
if s[i + j] != t[j]:
kyori += 1
saisho_kyori = min(kyori, saisho_kyori)
print(saisho_kyori)
|
p02571 | s497815717 | Wrong Answer | S=str(input())
T=str(input())
ls=len(S)
lt=len(T)
m=0
for i in range(ls):
A=S[i:lt]
a=0
for s,t in zip(A,T):
if s==t:
a+=1
m=max(m,a)
print(lt-m) |
p02571 | s319352531 | Wrong Answer | def main():
s = input()
t = input()
ans = 1010
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(cnt)
return
if __name__ == "__main__":
main() |
p02571 | s504085890 | Wrong Answer | s = input()
t = input()
def getCommonCharNum(x, y):
commonCharNum = 0
for i in range(len(x)):
if x[i] == y[i]:
commonCharNum += 1
return commonCharNum
for i in range(len(s) - len(t) + 1):
maxCommonNum = 0
tmpCommonCharNum = getCommonCharNum(s[i: len(t) + i], t) #s[0, len(s)] → s[0 + last_i, len(s) + last_i]
if maxCommonNum < tmpCommonCharNum:
maxCommonNum = tmpCommonCharNum
print(len(t) - maxCommonNum)
|
p02571 | s027119286 | Wrong Answer | import difflib
s = input()
t = input()
min = 10000
if t in s:
print(min)
exit()
for i in range(len(s) - len(t)):
diff = 0
for j in range(len(t)):
if s[j+i] != t[j]:
diff = diff + 1
if diff < min:
min = diff
print(min)
|
p02571 | s371934912 | Wrong Answer | s = input()
t = input()
pos = True
for i in range(len(t)):
if t[:len(t) - i] in s:
print(i)
pos = False
break
if pos: print(len(t) - 1)
|
p02571 | s684101100 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
if __name__ == '__main__':
S = input()
T = input()
for i in range(len(T), 0, -1): #Tのsubstringの文字数
for j in range(0, len(T)-i+1): #Tのsubstringの開始位置
if S[j:len(S)-1-(len(T)-i)+j+1].find(T[j:i-1+j+1]) != -1:
print (len(T)-i)
sys.exit()
|
p02571 | s894197046 | Wrong Answer | s=input()
t=input()
mc=0
for i in range(len(s)-len(t)):
c=0
for j in range(len(t)):
if s[i+j]==t[j]:
c+=1
mc=max(c,mc)
print(len(t)-mc)
|
p02571 | s723192822 | Wrong Answer | S = input()
T = input()
sl = len(S)
tl = len(T)
minc = 1000
for i in range(sl):
if i+tl-1 >= sl:
break
else:
str1 = S[i:i+tl]
count=0
for j in range(tl):
if str1[j] != T[j]:
count+=1
if count < minc:
minc = count
print(count)
|
p02571 | s506151560 | Wrong Answer | s = input()
t = input()
import copy
T = copy.deepcopy(t)
nagasa_t=len(t)
count1=0
count2=0
for i in range(nagasa_t):
if t in s:
break
else:
t= t[:-1]
count1+=1
if i == nagasa_t-1:
count1=nagasa_t
for i in range(nagasa_t):
if T in s:
break
else:
T = T[1:]
count2+=1
if i == nagasa_t-1:
count2=nagasa_t
print(min(count1,count2))
|
p02571 | s124353917 | Wrong Answer | S = input()
T = input()
ans = int(10**10)
# 10**3文字以下なので、O(N**2)でも間に合う
for i in range(len(S) - len(T)):
part = S[i:i+len(T)]
cnt = 0
for j, c in enumerate(part):
if T[j] != c:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s466665527 | Wrong Answer |
S = input()
T = input()
text = ''
for moji in T:
text += moji
if S.count(text) == 0:
text = text[0:-1]
break
if text == '':
print(len(T)-1)
else:
print(len(T)-len(text)) |
p02571 | s667351609 | Wrong Answer | s = input()
t = input()
ans = 0
for i in range(len(t)):
if s.count(t[i:]) != 0:
ans = (len(t[i:]))
break
if s.count(t[1:]) != 0:
ans = max((len(t[1:])),ans)
print(len(t)-ans) |
p02571 | s189122708 | Wrong Answer | S = input()
T = input()
maxtmp = 0
for i in range(len(S)- len(T)):
tmp = 0
for j in range(len(T)):
if S[i+j] == T[j]:
tmp += 1
if maxtmp < tmp:
maxtmp = tmp
print(len(T) - maxtmp)
|
p02571 | s990835338 | Wrong Answer | S = input()
T = input()
ans = 0
for i in range(len(S)):
tmp = 0
for j in range(len(T)):
if i + j < len(S):
if S[i + j] == T[j]:
tmp += 1
ans = max(ans, tmp)
print(len(T) - ans)
|
p02571 | s346646412 | Wrong Answer | s = input()
t = input()
ans = len(t)
for i in range(0, (len(s)-len(t)+1)):
diff = 0
for j in range(i, len(t)):
if t[j] == s[i+j]:
diff += 1
ans = min(ans, len(t)-diff)
print(ans) |
p02571 | s707776948 | Wrong Answer | s = input()
t = input()
x = len(t)
res= 0
for i in range(len(s) - x):
tmp = s[i:x]
cntmp = 0
for j in range(x):
if t[j] == s[j]:
cntmp += 1
res = max(res, cntmp)
print(x-res)
|
p02571 | s368641181 | Wrong Answer | S = input()
T = input()
min_count = 10000000
for k in range(len(T)):
count = k
for i in range(len(S)-len(T)+1):
if S[i+k] == T[k]:
for j in range(1,len(T)-k):
if S[i+j] != T[k+j]:
count += 1
if count < min_count:
min_count = count
print(min_count) |
p02571 | s305778337 | Wrong Answer | s = input()
t = input()
import copy
T = copy.deepcopy(t)
nagasa_t=len(t)
count1=1
count2=1
for i in range(nagasa_t):
if t in s:
break
else:
t= t[:-1]
count1+=1
if i == nagasa_t-1:
count1=nagasa_t
for i in range(nagasa_t):
if T in s:
break
else:
T = T[1:]
count2+=1
if i == nagasa_t-1:
count1=nagasa_t
print(min(count1,count2))
|
p02571 | s247928193 | Wrong Answer | s = input()
t = input()
if t in s:
print(0)
else:
for i in range(len(t)-1):
i += 1
t1 = t[:i]
t2 = t[i:]
if t2 in s:
print(i)
break
i *= -1
t3 = t[i:]
t4 = t[:i]
if t4 in s:
print(i*-1)
break |
p02571 | s717751578 | Wrong Answer | def main():
S = input()
T = input()
min_change = 1e5
for i in range(len(S)-len(T)):
tmp_change = 0
for j in range(len(T)):
if S[i+j] != T[j]:
tmp_change += 1
min_change = min(min_change, tmp_change)
if len(S) == len(T) and S != T:
min_change = len(T)
print(min_change)
if __name__ == '__main__':
main()
|
p02571 | s999852090 | Wrong Answer | s = input()
t = input()
list = []
for i in range(len(s)-len(t)+1):
n=0
for j in range(len(t)-1):
if s[i] == t[j]:
n+=1
list.append(n)
print(len(t)-max(list))
|
p02571 | s136086787 | Wrong Answer | from collections import deque
import sys, copy, itertools,heapq
input = sys.stdin.readline
S = input().rstrip()
T = input()
s=len(S)
t= len(T)
ANS=[0]*(len(S))
for i in range(len(S)-len(T)+1):
for j in range(len(T)):
if S[i+j] == T[j]:
ANS[i] += 1
#print(ANS)
print(t-max(ANS)) |
p02571 | s877230019 | Wrong Answer | S = input()
T = input()
ans = 1001
for i in range(len(S)-len(T)):
c = 0
for j in range(len(T)):
if S[i+j] != T[j]:
c += 1
ans = min(ans, c)
print(ans) |
p02571 | s365708837 | Wrong Answer | s = input()
t = input()
ans = 1000
for i in range(0,len(s)-len(t)):
cnt = 0
for (m,n) in zip(s[i:i+len(t)],t):
if m!=n : cnt += 1
ans = min(ans,cnt)
print(ans) |
p02571 | s622602923 | Wrong Answer | import random, string
S = input()
T = input()
l = len(T)
L = len(S)
max_ans = -1
for i in range(L):
for j in range(l):
ans = 0
if i + l > L:
continue
if T[j] == S[i + j]:
ans += 1
max_ans = max(max_ans, ans)
print(l - max_ans) |
p02571 | s398439243 | Wrong Answer | s = input()
t = input()
len_t = len(t)
ans = 999999999999
for i in range(len(s)-len(t)):
count = 0
for j in range(len_t):
if s[i+j]!=t[j]:
count+=1
ans = min(ans,count)
print(ans)
|
p02571 | s493773984 | Wrong Answer | s = input()
t = input()
if t in s:
print("0")
num = 0;
cnt = 0
min = len(t)
for i in range(len(s)-len(t)+1):
ss = s[num:num+len(t)]
for x,y in zip(ss,t):
if x != y:
cnt += 1
if cnt < min:
min = cnt
cnt = 0
num = num +1
print(min) |
p02571 | s150188341 | Wrong Answer | def main():
s = input()
t = input()
ans = 100000000
for i in range(0,len(s)-len(t)+1):
cnt = 0
for sub_s, sub_t in zip(s[i:len(t)+i],t):
if sub_s != sub_t:
cnt += 1
if cnt < ans:
ans = cnt
print(cnt)
if __name__ == "__main__":
main() |
p02571 | s814637777 | Wrong Answer | S=input()
T=input()
n=len(T)
l=len(S)-n
p=0
for i in range(l):
j=0
m=S[i:i+n]
for k in range(n):
if(m[k]==T[k]):
j+=1
if(p<j):
p=j
print(n-p) |
p02571 | s106981979 | Wrong Answer | s = input()
t = input()
N = len(t)
count = 0
for i in range(N):
if t[i] != s[i]:
count += 1
print(count) |
p02571 | s704682716 | Wrong Answer | import random, string
S = input()
T = input()
l = len(T)
L = len(S)
max_ans = -1
for i in range(L):
if i + l > L:
continue
for j in range(l):
ans = 0
if T[j] == S[i + j]:
ans += 1
max_ans = max(max_ans, ans)
print(l - max_ans) |
p02571 | s816915421 | Wrong Answer | S = list(input())
T = list(input())
ans = len(T)
for i in range(len(S)-len(T)):
count = 0
for j in range(len(T)):
if S[i + j] != T[j]:
count += 1
ans = min(ans,count)
print(ans) |
p02571 | s476269934 | Wrong Answer | S = input()
T = input()
sl = len(S)
tl = len(T)
for i in range(tl + 1):
if T[:tl - i] in S[:sl - i]:
print(i)
exit()
elif T[i:tl] in S[i:sl] :
print(i)
exit() |
p02571 | s300515896 | Wrong Answer | # -*- coding: utf-8 -*-
S = str(input())
T = str(input())
len_S = len(S)
S_part_dict = {}
for i in range(len_S):
for j in range(i, len_S):
S_part_dict[S[i:j + 1]] = i
max_part_len = 0
for part_str, len_from_top in S_part_dict.items():
now_len_part = len(part_str)
if now_len_part <= max_part_len:
continue
if T[len_from_top:].count(part_str):
max_part = now_len_part
print(len(T) - now_len_part) |
p02571 | s436590405 | Wrong Answer | S = input()
T = input()
s = len(S)
t = len(T)
count = 0
max = 0
for i in range(s-t):
for j in range(t):
if S[i+j] == T[j]:
count += 1
if count > max:
max = count
count = 0
else:
count = 0
print(t-max) |
p02571 | s985716983 | Wrong Answer | s = input()
t = input()
ans = len(s)+1
for i in range(len(s)-len(t)):
cnt = 0
for j in range(len(t)):
if s[i+j]!=t[j]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s834543585 | Wrong Answer |
#from sys import stdin
#input = stdin.readline
#inputRstrip = stdin.readline().rstrip
#x = input().rstrip()
#n = int(input())
#a,b,c = input().split()
#a,b,c = map(int, input().split())
ST = [input() for i in range(2)]
S = ST[0]
T = ST[1]
ans = len(T)
for i in range(len(S) - len(T)):
count = len(T)
for j in range(len(T)):
if(T[j] == S[i + j]):
count -= 1
if(ans > count):
ans = count
print(ans) |
p02571 | s370364913 | Wrong Answer | s = str(input())
t = str(input())
ans = len(t)
for i in range(len(s) - len(t)):
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)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.