problem_id stringclasses 100 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 6 806 |
|---|---|---|---|
p02571 | s903595998 | Wrong Answer | import re
S = input()
T = input()
ast = []
flag = False
if T in S:
print(0)
else:
for i in range(1, len(T) + 1):
if flag:
break
for s in range(len(T) + 1 - i):
Tc = T
Tc = Tc.replace(Tc[s:s+i], "."*i)
if len(re.findall(Tc, S)) != 0:
print(i)
flag = True
break
|
p02571 | s720658100 | Wrong Answer | s=input()
t=input()
ans=len(t)
for i in range(len(s)):
s1=s[i:i+len(t)]
sum=len(t)
for j in range(len(s1)):
if t[j]==s1[j]:sum-=1
ans=min(ans,sum)
print(ans) |
p02571 | s538659683 | 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:
if i - S.find(T[i:j]) <= 0:
ans = min(ans, len(T)-len(T[i:j]))
print(ans) |
p02571 | s305520106 | 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 | s988165248 | Wrong Answer | s = input()
t = input()
if (t in s):
print(0)
ans = 1000
for i in range(len(s)-len(t)):
diff = 0
for j in range(len(t)):
if (s[i+j] == t[j]):
pass
else:
diff += 1
ans = min(ans, diff)
print(ans)
|
p02571 | s837255483 | Wrong Answer | *S, = input()
*T, = input()
sl = len(S)
tl = len(T)
ans = tl
for i in range(sl):
if i+tl >= sl:
break
count = 0
for j in range(tl):
if S[i+j] != T[j]:
count += 1
ans = min(ans, count)
print(ans) |
p02571 | s436158858 | Wrong Answer | s=input()
t=input()
ans=1000
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 | s582420001 | Wrong Answer | # -*- coding: utf-8 -*-
s = input()
t = input()
answer = 0
for start_i in range(len(s)-len(t)):
compared_s = s[start_i:]
index = 0
matched_count = 0
for t_s in t:
if t_s == compared_s[index]:
matched_count += 1
index += 1
if answer < matched_count:
answer = matched_count
print(len(t)-answer) |
p02571 | s967115805 | Wrong Answer | S = input()
T = input()
ans = len(T)
l = len(T)
for m in range (len(S)-l):
diff = 0
for i in range (l):
if S[m+i] != T[i]:
diff+=1
ans = min(ans, diff)
print(ans) |
p02571 | s293957046 | Wrong Answer | def s():return input()
def mp():return map(int,input().split())
a =s()
b =s()
ans = ""
q,w =0,0
for i in range(len(b)):
ans+=b[i]
if ans in a[i:]:
q+=1
else:
ans =""
q =0
w = max(w,q)
print(len(b)-w) |
p02571 | s786016097 | Wrong Answer | L = input()
S = input()
result = 0
for i in range(len(S)):
tmp = 0
for j in L[i:]:
if i + tmp > len(S)-1:
break
if S[i+tmp] == j:
tmp += 1
else:
if result < tmp:
result += tmp
tmp = 0
print(len(S) - result)
|
p02571 | s217073910 | Wrong Answer | S = input()
T = input()
num_S = len(S)
num_T = len(T)
match = 0
for i in range(num_S - num_T):
count = 0
for j in range(num_T):
if S[i+j] == T[j]:
count += 1
if count > match:
match = count
print(num_T - match) |
p02571 | s352263888 | Wrong Answer | S = input()
T = input()
cnt_min = len(S)
for i in range(len(S) - len(T)):
cnt = 0
for j in range(len(T)):
if T[j] != S[i+j]:
cnt += 1
cnt_min = min(cnt_min, cnt)
print(cnt_min) |
p02571 | s527624379 | Wrong Answer | S = input()
T = input()
m = 0
for i in range(len(T)):
for j in range(i+1,len(T)+1):
if T[i:j] in S:
ind = S.index(T[i:j])
if ind >= i and len(S)-ind >= len(T[i:]):
#print(T[i:j], ind)
m = max(m,len(T[i:j]))
print(len(T)-m)
|
p02571 | s399376948 | Wrong Answer | s = input()
t = input()
t_length = len(t)
for i in range(t_length):
if t[0:t_length - i] in s:
break
print(i) |
p02571 | s500656481 | Wrong Answer | S = input()
T = input()
size = len(T)
n = len(S)
ans = size
for i in range(n-size):
t = S[i:i+size]
v = sum([k!=j for k, j in zip(T, t)])
ans = min(v, ans)
print(ans)
|
p02571 | s103931296 | Wrong Answer | s=input()
t=input()
u=m=len(t)
for i in range(len(s)-u):
m=min(m,sum([1 for j in range(u) if s[i+j]!=t[j]]))
print(m) |
p02571 | s397987158 | Wrong Answer | s = input()
t = input()
ans = 0
for i in range(len(s)):
count = 0
for j in range(i, len(t)):
if s[j] == t[j-i]:
count += 1
ans = max(count, ans)
print(len(t)-ans)
|
p02571 | s407531169 | Wrong Answer | s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)):
same = 0
for g in range(len(t)):
if s[i+g] == t[g]:
same += 1
ans = min(len(t)-same, ans)
print(ans) |
p02571 | s838907493 | Wrong Answer | s = input()
t = input()
ans = float("INF")
for i in range(len(s)-len(t)):
x = 0
for j in range(len(t)):
x += (s[i+j] != t[j])
ans = min(ans,x)
print(ans) |
p02571 | s458830379 | Wrong Answer | S = list(input())
T = list(input())
ans = 1e9
for i in range(len(S) - len(T) + 1):
print(S[i:len(T)+i],T)
tmp = 0
for j in range(len(T)):
if S[i:len(T)+i][j] == T[j]: continue
tmp += 1
ans = min (ans,tmp)
print(ans) |
p02571 | s150746452 | Wrong Answer | s = input()
t = input()
list = []
for i in range(len(s)-len(t)+1):
n=0
for j in range(len(t)):
if s[i] == t[j]:
n+=1
list.append(n)
print(len(t)-max(list))
|
p02571 | s456532404 | Wrong Answer | s=input()
t=input()
min=len(t)
for n in range(len(s)-len(t)):
x=0
for i in range(len(t)):
if t[i] != s[n+i]:
x=x+1
if x<min:
min = x
print(min) |
p02571 | s181605493 | Wrong Answer | s = input()
t = input()
ans = 0
flag = False
for i in range(len(t)+1, 0, -1):
for j in range(0, len(t)-i+1):
if t[j:j+i] in s:
ind = s.index(t[j:j+i])
if ind >= j and len(s[ind:]) - len(t[j:]) >= 0:
ans = i
flag = True
break
if flag:
break
print(len(t)-ans)
|
p02571 | s343031802 | Wrong Answer | s = input()
t = input()
mx = float('-inf')
for i in range(0, len(s)-len(t)+1):
# print(i)
k = 0
cnt = 0
for j in t:
# print(s[i], j)
if s[i+k]==j:
cnt+=1
mx = max(cnt, mx)
k+=1
print(len(t)-mx) |
p02571 | s593864882 | Wrong Answer | S=input()
T=input()
ans=int(len(T))
for i in range(int(len(S))-int(len(T))):
x=int(len(T))
for j in range(int(len(T))):
if S[i+j]==T[j]:
x-=1
if j+1==int(len(T)):
if ans>x:
ans=x
print(ans) |
p02571 | s159838926 | Wrong Answer | s = str(input())
t = str(input())
a = []
for i in list(s):
a.append(i)
b = []
for j in list(t):
b.append(j)
c = len(a)
d = len(b)
w = 1000
for k in range(c-d):
e = a[k:k+d]
f = 0
for l in range(d):
if e[l] != b[l]:
f= f+1
if w > f:
w= f
print(w) |
p02571 | s676161432 | Wrong Answer | s = input().rstrip()
t = input().rstrip()
count = 0
min_count = 1000
for i in range(len(s) - len(t)):
s_selected = s[i:i + len(t)]
count = 0
for j in range(len(t)):
if t[j] != s_selected[j]:
count += 1
#print(count)
if count < min_count:
min_count = count
print(min_count) |
p02571 | s275165860 | Wrong Answer | S = input()
T = input()
Min_count = len(T)
for i in range(len(S)-len(T)):
count = 0
for h in range(len(T)):
if(S[i+h] != T[h]):
count+=1
if(Min_count >count):
Min_count = count
print(Min_count) |
p02571 | s406685925 | Wrong Answer | s = input()
t = input()
ans = 10000
for i in range(len(s)-len(t)):
cut = s[i:i+len(t)]
cnt = 0
for k, j in zip(cut, t):
if k != j:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s544876360 | 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)
print(min_change)
if __name__ == '__main__':
main()
|
p02571 | s525736808 | Wrong Answer | S = input()
T = input()
s = len(S)
t = len(T)
min_count = t
for i in range(s - t):
count = 0
for j, tt in enumerate(T):
if S[i: i + t][j] == tt:
count += 1
change = t - count
if change < min_count:
min_count = change
print(min_count)
|
p02571 | s681406932 | Wrong Answer | S=input()
T=input()
N=len(S)
ans=10**30
for i in range(N-len(T)):
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 | s297443183 | Wrong Answer | import re
def judge(T,S):
length=len(T)
if T in S:
return length
else :
for i in range(1,length):
for j in range(length):
t=T[:j]+"."*i+T[j+i:length]
if re.search(t,S):
return i
break
S=input()
T=input()
print(judge(T,S))
|
p02571 | s111728348 | 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:end] in S[start:]:
count = end - start
max_count = max(max_count, count)
answer = len(T) - max_count
print(answer) |
p02571 | s438097185 | Wrong Answer | S = input()
T = input()
i = len(T)
sub_str = ''
ans = -1
while i > 0:
sub_str = T[0:i]
i = i - 1
if sub_str in S:
ans = len(T) - len(sub_str)
break
if ans != -1:
print(ans)
elif set(list(S)) & set(list(T)):
print(len(T) - 1)
else:
print(len(T)) |
p02571 | s570366065 | Wrong Answer | 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 + j:
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 | s104001889 | Wrong Answer | s = input()
t = input()
l = len(s)
k = len(t)
min = 1002
for j in range(0,k):
t1 = t[0:k-j]
for i in range(0,l-k+j+1):
s1 = s[i:i+k-j]
if t1 == s1:
if min > k-i-1:
min = k-i-1
break
if min != 1002:
break
print(min)
|
p02571 | s801045356 | Wrong Answer | 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()
m = len(S)
l = len(T)
# m > l
ans = INF
for i in range(m - l + 1):
ans = sum(s != t for s, t in zip(S[i : i + l], T))
print(ans)
resolve() |
p02571 | s710925962 | Wrong Answer | s = list(input())
t = list(input())
ans = len(t)
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 | s822460859 | Wrong Answer | S = str(input())
T = str(input())
result =0
cnt = len(T)
temp = S[:cnt]
Min = len(T)
while True:
sum = 0
for i in range (len(T)):
if temp[i] != T[i]:
sum+=1
result = min(Min,sum)
if cnt+len(T) <= len(S):
temp = S[cnt:cnt+len(T)]
cnt = cnt+len(T)
else:
break
print(result)
|
p02571 | s853268544 | Wrong Answer | S = input()
T = input()
temp = T
ans = 0
ret = False
t = list(T)
s = list(S)
t_ans = len(t)
f_ans = len(t)
for i in range(len(t)):
if T in S:
t_ans = ans
ret = True
break
ans += 1
T = T[:-1]
T = temp
ans = 0
for i in range(len(t)):
if T in S:
f_ans = ans
ret = True
break
ans += 1
T = T[1:]
if ret:
print(min(f_ans, t_ans))
else:
print(len(t)) |
p02571 | s385611576 | Wrong Answer | # coding: utf-8
def main():
s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t)):
a = s[i:i+len(t)]
print(a, t)
ans_list = [1 for x, y in zip(a, t) if x!=y]
tmp_ans = sum(ans_list)
ans = min(ans, tmp_ans)
if ans == 0:
break
print(ans)
main() |
p02571 | s759061932 | Wrong Answer | s = input()
t = input()
len_s = len(s)
len_t = len(t)
ans = 1000
for i in range(len_s - len_t):
cnt = 0
for j in range(len_t):
if s[i + j] == t[j]:
cnt += 1
else:
ans = min(ans, len_t - cnt)
continue
print(ans) |
p02571 | s308854509 | Wrong Answer | def check(S,T,i):
count=0
for j in range(i,len(T)+i):
if S[j] == T[j-i]:
count+=1
return count
S=input()
T=input()
b=[]
for i in range(0,len(S)-len(T)+1):
b.append(check(S,T,i))
b.sort()
print(b[0])
|
p02571 | s652684523 | Wrong Answer | S = input()
T = input()
for i in range(len(T)):
if not (T[0:i] in S):
break
print(len(T) - i) |
p02571 | s439561484 | Wrong Answer | s = input()
t = input()
maxsame = 0
for i in range(len(s)-len(t)):
same = 0
for j in range(len(t)):
if s[i+j] == t[j]:
same += 1
else:
same = 0
if same > maxsame:
maxsame = same
print(len(t)-maxsame) |
p02571 | s283633213 | Wrong Answer | S=input()
T=input()
ans=10**5
for i in range(len(S)-len(T)):
a=0
for j in range(len(T)):
if S[i+j]==T[j]:
a+=1
ans=min(ans,a)
print(ans) |
p02571 | s002022050 | Wrong Answer | def func(S,T):
tlen = len(T)
min = 1000
for x in range(0,len(S)-tlen,1):
tmp = S[x:x+tlen]
tmpNum = 0
for i in range(0,len(tmp),1):
if tmp[i] != T[i]:
tmpNum += 1
if min > tmpNum:
min = tmpNum
if min == 1000:
min = tlen
return min
if __name__ == "__main__":
S = input()
T = input()
print(func(S,T)) |
p02571 | s478486648 | Wrong Answer | def diff(s,t):
assert len(s) == len(t)
c = 0
for i,j in zip(s,t):
if i != j:
c+=1
else:
pass
return c
s=input()
t=input()
n=len(s)
m=len(t)
min_=10**5
for i in range(n-m):
min_=min(min_,diff(s[i:m+i],t))
print(min_) |
p02571 | s908876470 | Wrong Answer | ##全探索...?
S = input()
T = input()
last = len(S) - len(T) + 1
ans = len(T)
for i in range(last):
tent = 0
for j in range(len(T)):
if(S[i+j] != T[j]):
tent += 1
print(tent)
if(tent < ans):
ans = tent
print(ans) |
p02571 | s024287774 | Wrong Answer | s=input()
t=input()
ma=0
for i in range(len(s)):
cnt=0
now=s[i:i+len(t)]
for j in range(len(now)):
if now[j]==t[j]:
cnt+=1
ma=max(cnt,ma)
print(len(t)-ma)
|
p02571 | s741581468 | Wrong Answer | S = list(input())
T = list(input())
ans = 0
for i in range(len(S)-len(T)):
ans_pre = 0
for j in range(len(T)):
if T[j] == S[i+j]:
ans_pre += 1
ans = max(ans, ans_pre)
print(len(T) - ans) |
p02571 | s300489471 | Wrong Answer | 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)):
a = 0
for j in range(len(t)):
if s[+j] != t[j]:
a+=1
ans = min(a,ans)
print(ans)
|
p02571 | s457851420 | Wrong Answer | from collections import defaultdict
S = input()
T = input()
mic = len(T)
if T in S:
print(0)
else:
for i in range(len(S)-len(T)):
counter = 0
for l in range(len(T)):
if T[l] != S[i+l]:
counter+=1
mic = min(mic,counter)
print(mic) |
p02571 | s482510097 | Wrong Answer | s = input()
t = input()
minCount = 100000000
i = 0
while i < len(s):
countSame = 0
j = 0
while j < len(t) and i+j < len(s):
if t[j] == s[i+j]:
countSame += 1
j += 1
minCount = min(len(t) - countSame, minCount)
i += 1
print(minCount)
|
p02571 | s670067203 | Wrong Answer | #B
S = input()
T = input()
def counter(A,B):
tmp = 0
for j in range(len(A)):
if A[j]==B[j]:
tmp += 1
return tmp
result = 0
if S == T:
result = len(T)
else:
for i in range(len(S)-len(T)):
if counter(S[i:i+len(T)],T) > result:
result = counter(S[i:i+len(T)],T)
print(len(T)-result) |
p02571 | s122272476 | Wrong Answer | s = input()
t = input()
maxi = 0
if t not in s:
for i in range(len(s)):
maxG = 0
for l, j in zip(s[i:len(t)], t):
if l == j:
maxG += 1
maxi = max(maxi, maxG)
print(len(t)-maxi)
else:
print("0")
|
p02571 | s439409469 | Wrong Answer | S = input()
T = input()
ans = len(T)
for i in range(len(S)-len(T)-1):
tmp = ans
tmp = 0
for j in range(len(T)):
if S[i+j] != T[j]:
tmp += 1
if tmp < ans:
ans = tmp
print(ans)
|
p02571 | s153678590 | Wrong Answer | def main():
S = input()
T = input()
if T in S:
print(0)
else:
for i in range(len(T)-1, 0, -1):
for j in range(len(T)-i+1):
if T[j:j+i] in S[j:]:
print(len(T) - i)
exit()
if __name__ == '__main__':
main() |
p02571 | s086541534 | Wrong Answer | def main():
s=input()
t=input()
ls=len(s)
lt=len(t)
st= [ [ 0 for y in range(ls ) ] for x in range( lt ) ]
for si in range(ls):
for ti in range(lt):
if s[si]==t[ti]:
st[ti][si]=1
break
r=0
for si in range(ls):
rt=0
for ti in range(lt-si):
rt+=st[ti][(si+ti)]
if r<rt:
r=rt
print(lt-r)
main() |
p02571 | s497472732 | Wrong Answer | def main():
S = input()
T = input()
if T in S:
print(0)
else:
for i in range(len(T)-1, 0, -1):
for j in range(len(T)-i+1):
if T[j:j+i] in S[j:]:
print(len(T) - i)
exit()
else:
print(len(T))
if __name__ == '__main__':
main() |
p02571 | s810754078 | Wrong Answer | S=input()
T=input()
ANS=[]
for start in range(len(S)):
ans = 0
for j in range(len(T)):
if S[start] != T[j]:
ans += 1
ANS.append(ans)
print(min(ANS))
|
p02571 | s567119311 | Wrong Answer | s = input()
t = input()
maxi = 0
for i in range(len(t)):
maxG = 0
for l, j in zip(s[i:len(t)], t):
if l == j:
maxG += 1
maxi = max(maxi, maxG)
print(len(t)-maxi)
|
p02571 | s041655967 | Wrong Answer | import sys
input = sys.stdin.readline
S = input()
T = input()
score_list = []
for i in range(len(S) - len(T) + 1):
s = S[i:i+len(T)]
score = 0
for i in range(len(s)):
if s[i] != T[i]:
score += 1
score_list.append(score)
print(min(score_list))
|
p02571 | s010568305 | Wrong Answer | s = list(input())
t = list(input())
l = list()
wake = len(s)-(len(t)-1)
for i in range(wake):
l.append(s[i:i+len(t)])
gokei = len(t)
for i in l:
sco = len(t)
q = 0
for j in i:
if j == t[q]:
sco -= 1
q += 1
if gokei < sco:
gokei = sco
print(sco) |
p02571 | s387364976 | Wrong Answer | s=input()
t=input()
ans=0
for i in range(len(s)-len(t)):
u=0
for a,b in zip(t,s[i:len(t)+i]):
if a==b:u+=1
ans=max(ans,u)
print(len(t)-ans) |
p02571 | s953868782 | Wrong Answer | s = input()
t = input()
import copy
T = copy.deepcopy(t)
count1=0
count2=0
while True:
if t in s:
break
else:
t= t[:-1]
count1+=1
while True:
if T in s:
break
else:
T = T[1:]
count2+=1
print(min(count1,count2))
|
p02571 | s245480653 | Wrong Answer | def dif (s,t):
ans=0
for i in range(len(s)):
if s[i]!=t[i]:
ans+=1
return ans
s=input()
t=input()
k=len(t)
ans=99999999999999999
for i in range(len(s)-k):
a=s[i:i+k]
b=dif(a,t)
ans=min(ans,b)
print (ans) |
p02571 | s687328704 | Wrong Answer | def main():
min_num = len(T)
for i in range(len(S)):
count = 0
for j in range(len(T)):
try:
if S[i+j] == T[j]:
count += 1
except:
break
min_num = min_num if min_num < len(T)-count else len(T)-count
print(min_num)
S = input()
T = input()
main()
|
p02571 | s919602112 | Wrong Answer | S = input()
T = input()
if T in S:
print("0")
else:
slen = len(S)
tlen = len(T)
ansCnt = tlen
for i in range(slen-tlen):
cnt = 0
for j in range(tlen):
if T[j]!=S[i+j]:
cnt += 1
if ansCnt>cnt:
ansCnt = cnt
print(ansCnt) |
p02571 | s374560181 | Wrong Answer | s = input()
t = input()
x = len(t)
mx= 0
# print(x - mx)
res= 0
for i in range(len(s) - x):
tmp = s[i:i+x]
cntmp = 0
for j in range(x):
if t[j] == tmp[j]:
cntmp += 1
# print(tmp, i)
res = max(res, cntmp)
print(x-res) |
p02571 | s780874841 | Wrong Answer | S = input()
T = input()
ans = 0
l = len(T)
for m in range (len(S)-l):
diff = 0
for i in range (l):
if S[m+i] != T[i]:
diff+=1
ans = max(ans, diff)
print(ans) |
p02571 | s309779944 | Wrong Answer | def resolve():
s = input()
t = input()
ans = 0
for i in range(len(t)):
for j in range(i, len(t)):
test = t[i:j + 1]
if test in s[i:len(s) - (len(t) - j)-1]:
ans = max(ans, len(test))
print(len(t) - ans)
resolve() |
p02571 | s251464957 | Wrong Answer | s = str(input())
t = str(input())
ans = []
counter = 0
for i, j in zip(s, t):
if i != j:
ans.append(j)
print(len(ans))
|
p02571 | s376052570 | Wrong Answer | S=list(input())
T=list(input())
SS=len(S)
TS=len(T)
ans=TS
for i in range(SS-TS):
cnt=0 #
for j in range(TS):
if T[j] != S[i+j] :
cnt +=1
ans=min(cnt,ans)
print(ans) |
p02571 | s209393093 | Wrong Answer | #B
S=input()
T=input()
M= len(S)
N = len(T)
ans=0
for i in range(M-N):
tmp=S[i:i+N]
cnt=0
for j in range(N):
if tmp[j]==T[j]:
cnt +=1
ans = max(ans,cnt)
print(N-ans) |
p02571 | s943125882 | Wrong Answer |
S = input()
T = input()
Slen = len(S)
Tlen = len(T)
i = 0
while i < Tlen:
if T[i:] in S[i:]:
if len(T[i:Tlen-i])< len(S[:(Slen-i)]):
break
if T[:(Tlen-i)] in S[:(Slen-i)]:
break
i += 1
if i != Tlen:
print(i)
else:
print(Tlen)
|
p02571 | s528398271 | Wrong Answer | S=input()
T=input()
match=0
for i in range(1,len(T)+1):
tmp=T[:i]
if(tmp in S):
match=i
if(match==0):
for i in range(len(T)):
if(T[i] in S):
match=1
print(len(T)-match) |
p02571 | s696405555 | Wrong Answer | s, t = input(), input()
b = 1000
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
a = min(a, b)
print(a) |
p02571 | s195201973 | Wrong Answer | #!/usr/bin/env python3
s = input()
t = input()
result = len(t)
for i in range(len(s) - len(t) + 1):
dif = 0
for j in range(len(t)):
if(s[i + j] != t[j]):
dif += 1
if result > dif:
result = dif
print(dif)
|
p02571 | s937891876 | Wrong Answer | S = input()
T = input()
mx = 0
for i in range(len(S)):
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)
|
p02571 | s182112660 | Wrong Answer | def main():
s = input()
t = input()
min_v = len(t)
for i in range(len(t)):
if t[i:] in s and len(t) - len(t[i:]) < min_v:
min_v = len(t) - len(t[i:])
elif t[:i] in s and len(t) - len(t[:i]) < min_v:
min_v = len(t) - len(t[:i])
print(min_v)
if __name__ == '__main__':
main() |
p02571 | s879313154 | Wrong Answer |
S = input()
T = input()
count = 0
max_count = 0
for i in range(len(S) - len(T)):
for j in range(len(T)):
if S[i] == T[j]:
count += 1
if max_count <= count:
max_count = count
else:
count = 0
print(len(T) - max_count)
|
p02571 | s938753622 | Wrong Answer | import re
s = input()
t = input()
S = list(s)
T = list(t)
ct = 0
while True:
m = re.search(t,s)
if m:
print(ct)
exit()
else:
ct += 1
t = t[:-1:]
|
p02571 | s837865690 | Wrong Answer | S = list(input())
T = list(input())
ans = float("inf")
for i in range(len(S)-len(T)):
n = 0
for j in range(len(T)):
if T[j] != S[i+j]:
n += 1
ans = min(ans,n)
print(ans) |
p02571 | s493398553 | Wrong Answer | def main():
s = input()
t = input()
ans = 1e9
for i in range(0,len(s)-len(t)+1):
cnt = 0
for j in range(len(t)):
# for sub_s, sub_t in zip(s[i:len(t)+i],t):
# if sub_s != sub_t:
if s[i+j] != t[j]:
cnt += 1
ans = min(ans,cnt)
print(cnt)
if __name__ == "__main__":
main() |
p02571 | s620536315 | Wrong Answer | s=list(input())
t=list(input())
n=len(t)
m=len(s)
for i in range(n):
l=n-i
for j in range(i+1):
for k in range(j,m-l+1):
if t[j:j+l]==s[k:k+l]:
print(i)
exit()
print(n) |
p02571 | s879745418 | Wrong Answer | import math
S = str(input())
T = str(input())
cnt = 0
length = 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 += 1
length = min(diff,length)
print(length) |
p02571 | s482485501 | Wrong Answer | S=input()
T=input()
lenS=len(S)
lenT=len(T)
count=[]
for i in range(lenS-lenT+1):
c=0
for j in range(lenT):
if T[j]!=S[i+j]:
c=c+1
j=j+1
print(c)
count.append(c)
i=i+1
print(min(count)) |
p02571 | s211188219 | Wrong Answer | s = input()
t = input()
n = len(s)
m = len(t)
ans = 1000
for i in range(n-m):
a = 0
for j in range(m):
if s[i+j] != t[j]:
a += 1
ans = min(ans,a)
print(ans) |
p02571 | s947043485 | Wrong Answer | s=input()
t=input()
kotae=0
while t not in s:
if t in s:
print(kotae)
exit()
else:
a=t[:-1]
b=t[1:]
kotae+=1
if a in s[:-1] or b in s[1:]:
print(kotae)
exit()
else:
t=t[1:-1]
s=s[1:-1]
kotae+=1
print(kotae)
|
p02571 | s811362506 | Wrong Answer | s=input()
t=input()
a=len(s)
b=len(t)
m=b
for i in range(a-b):
c=0
for j in range(b):
if s[i+j]!=t[j]:
c+=1;
if c<m:
m=c
print(m)
|
p02571 | s063777692 | Wrong Answer | S = input()
T = input()
finish = False
for i in range(len(T)):
for j in range(i+1):
A = T[j:j+len(T)-i]
if (A in S) & (S.find(A) >= j) & (len(S) - (S.find(A)+len(T)-i) >= i-j):
print(i)
finish = True
break
if finish == True:
break |
p02571 | s368384350 | Wrong Answer | s = input()
t = input()
maxi = 0
for i in range(len(s)):
maxG = 0
print(s[i:len(t)+i])
if len(s[i:len(t)+i]) >= len(t):
for l, j in zip(s[i:len(t)+i], t):
if l == j:
maxG += 1
maxi = max(maxi, maxG)
else:
break
print(len(t)-maxi)
|
p02571 | s926551538 | Wrong Answer | s = input()
t = input()
l = len(t)
res = l
for i in range(len(s)-l):
count = 0
for j in range(l):
if t[j] != s[i+j]:
count +=1
res = min(res,count)
print(res) |
p02571 | s780263574 | Wrong Answer | s = input()
t = input()
len_s = len(s)
len_t = len(t)
ans = 0
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 = max(ans, cnt)
print(len_t - ans) |
p02571 | s543590712 | Wrong Answer | S = input()
T = input()
sl = len(S)
tl = len(T)
for i in range(tl):
if T[:tl - i] in S[:sl - i]:
print(i)
exit()
elif T[:tl - i] in S[i:sl]:
print(i)
exit()
elif T[i:tl] in S[i:sl]:
print(i)
exit()
elif T[i:tl] in S[:sl - i]:
print(i)
exit()
print(tl) |
p02571 | s196834197 | Wrong Answer | S = input()
T = input()
num = 0
tmp = 0
idx = 0
for i in range(len(S)):
for j in range(len(T)):
if(S[i] == T[j]):
tmp += 1
else:
if(tmp > 0):
num = max(num, tmp)
tmp = 0
break
print(len(T)-num) |
p02571 | s835958498 | Wrong Answer | def main(s: str, t: str):
ans = [0 for _ in range(len(s))]
for i, si in enumerate(s):
for j, tj in enumerate(t):
print(si, tj, i, j)
if i - j > 0 and si == tj:
ans[i-j] += 1
print(len(t) - max(ans))
if __name__ == '__main__':
s = input()
t = input()
main(s, t)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.