problem_id stringclasses 100 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 6 806 |
|---|---|---|---|
p02571 | s620478302 | Accepted | #!/usr/bin/python3
# -*- coding: utf-8 -*-
s = input()
t = input()
min_count = 1000
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)
if min_count == 0:
break
print(min_count) |
p02571 | s057629331 | Accepted | s = input()
t = input()
ans = 10000
for i in range(len(s)-len(t)+1):
bubun = s[i:i+len(t)]
okikae = 0
for j in range(len(t)):
if bubun[j] != t[j]:
okikae += 1
if okikae <= ans:
ans = okikae
print(ans)
|
p02571 | s705866837 | Accepted | def main():
s = input()
t = input()
ans = 100000
for i in range(len(s) - len(t) + 1):
sub = s[i:i+len(t)]
tmp = 0
for j in range(len(sub)):
if sub[j] != t[j]:
tmp += 1
ans = min([ans, tmp])
print(ans)
if __name__ == '__main__':
main()
|
p02571 | s912494795 | Accepted | # import numpy as np
import sys, math, heapq
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")
S = input()
T = input()
lenS = len(S)
lenT = len(T)
difmin = float("inf")
for si in range(lenS - lenT + 1):
dif = 0
for s, t in zip(S[si:], T):
if s != t:
dif += 1
difmin = min(difmin, dif)
print(difmin)
|
p02571 | s648732828 | Accepted | S = input()
T = input()
s = len(S)
t = len(T)
def checkCommonLength(a: str, b: str) -> int:
l = len(a)
count = 0
for i in range(l):
if a[i] == b[i]:
count += 1
return count
max_val = 0
for i in range(s):
if i + t <= s:
testStr = S[i : i + t]
#print(testStr)
max_val = max(max_val, checkCommonLength(S[i : i + t], T))
print(t - max_val)
|
p02571 | s317925478 | Accepted | S=input()
T=input()
A=[]
for i in range(len(S)-len(T)+1):
s=S[i:i+len(T)]
t=[T[j] for j in range(len(T)) if s[j] != T[j]]
A.append(len(t))
print(min(A)) |
p02571 | s447032862 | Accepted | S = list(input())
T = list(input())
lenS = len(S)
lenT = len(T)
match = 0
for i in range(lenS - lenT + 1):
cnt = 0
for j in range(lenT):
if S[i + j] == T[j]:
cnt += 1
match = max(match, cnt)
print(lenT - match)
|
p02571 | s019944936 | Accepted | s = input()
t = input()
diff_min = len(t)
while len(s) >= len(t):
diff = 0
for i in range(len(t)):
if s[i] != t[i]:
diff += 1
diff_min = min(diff_min, diff)
s = s[1:]
print(diff_min) |
p02571 | s814450806 | Accepted | S = input()
T = input()
l = []
if len(S) != len(T):
for i in range(len(S) - len(T)):
cnt = 0
for j in range(len(T)):
if T[j] != S[i+j]:
cnt += 1
l.append(cnt)
print(min(l))
else:
cnt = 0
for i in range(len(S)):
if T[i] != S[i]:
cnt += 1
print(cnt)
|
p02571 | s513419756 | Accepted | s = input()
t = input()
ans = 0
A = []
for i in range(len(s)-len(t)+1):
s_i = s[i:i+len(t)+1]
count = 0
for j in range(len(t)):
if s_i[j] == t[j]:
count += 1
A.append(count)
ans = len(t) - max(A)
print(ans) |
p02571 | s797630147 | Accepted | s = input()
t = input()
ans = 9999
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 tmp < ans:
ans = tmp
print(ans) |
p02571 | s616754256 | Accepted | S = input()
T = input()
s = len(S)
t = len(T)
min_count = t
for i in range(s - t + 1):
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 | s842725974 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
mi = 10**6
for i in range(ls-lt+1):
s1 = s[i:i+lt]
count = 0
for j in range(lt):
if s1[j]!=t[j]:
count += 1
mi = min(mi,count)
print(mi) |
p02571 | s356590960 | Accepted | S = input()
T = input()
lenS = len(S)
lenT = len(T)
chgCnt = 0
for j in range(lenS - lenT + 1):
sameCnt = 0
for i in range(lenT):
if S[j + i] == T[i]:
sameCnt += 1
if chgCnt < sameCnt:
chgCnt = sameCnt
print(lenT - chgCnt) |
p02571 | s124159127 | Accepted | a=b=0
for i in range(len(s:=input())-len(t:=input())+1):
for j,c in enumerate(t):b+=(s[i+j]==c)
a=max(a,b);b=0
print(len(t)-a) |
p02571 | s367511417 | Accepted | S=input()
T=input()
ans=10000
for i in range(len(S)-len(T)+1):
score=0
U=S[i:i+len(T)]#Sのi文字目から{i+len(T)}文字目までがU->部分文字列を抜き出している
for j in range(len(T)):
if U[j] != T[j]:
score += 1
ans = min(ans, score)
print(ans) |
p02571 | s221514656 | Accepted | import math
S = input()
T = input()
minimum = math.inf
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
minimum = min(minimum,cnt)
print(minimum)
|
p02571 | s132603618 | Accepted | S = list(input())
T = list(input())
i = 0
ans =[]
while i + len(T) <= len(S):
n = 0
for s, t in zip(S[i:i+len(T)], T):
if s != t:
n += 1
ans.append(n)
i += 1
print(min(ans)) |
p02571 | s407688394 | Accepted | # p = list(map(int, input().split()))
# a, b, c = map(int, input().split())
# n = int(input())
# s = input()
# print(i, end=" ")
s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t) + 1):
dif = 0
for j in range(len(t)):
if t[j] != s[i + j]:
dif = dif + 1
ans = min(ans, dif)
print(ans)
|
p02571 | s908872657 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
r = lt
for i in range(ls - lt + 1):
tmp = 0
for j in range(lt):
if s[i + j] != t[j]: tmp += 1
r = min(r, tmp)
print(r)
|
p02571 | s062138341 | Accepted | s=input()
t = input()
maxi = 0
for i in range(len(s)-len(t)+1):
count = 0
for j in range(len(t)):
#print(t[j], s[i+j])
if t[j] == s[i + j]:
count += 1
#print(count)
maxi = max(maxi, count)
#print(maxi)
print(len(t)-maxi) |
p02571 | s989688880 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)+1):
si = s[i:i+len(t)]
cnt = 0
if len(si) == len(t):
for sii, ti in zip(si, t):
if sii != ti:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s198235614 | Accepted | S = input()
T = input()
n = len(T)
def c(s, t):
#print(s)
r = 0
for i in range(n):
if s[i] == t[i]:
r += 1
return n - r
ans = n
for i in range( len(S) - n + 1):
temp = c(S[i:i+n],T)
ans = min( ans, temp)
print(ans) |
p02571 | s920970481 | Accepted | S = input()
T = input()
ans = len(T)
for i in range(len(S) - len(T) + 1):
v = 0
for j in range(len(T)):
# print(i, j)
if S[i+j] != T[j]:
v += 1
# print(i, v)
ans = min(ans, v)
print(ans)
|
p02571 | s605075090 | Accepted | S = input()
T = input()
ls = len(S)
lt = len(T)
m = 0
for i in range(ls-lt+1):
tmp = S[i:i+lt]
cnt = 0
for idx,j in enumerate(tmp):
if T[idx]==j:
cnt+=1
m = max(cnt,m)
print(lt-m) |
p02571 | s395322698 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t) +1):
curr = len(t)
for j in range(len(t)):
if s[i+j] == t[j]:
curr -= 1
if curr < ans:
ans = curr
print(ans)
|
p02571 | s019716270 | Accepted | def main():
s = input()
t = input()
l = len(t)
minCount = l
for i in range(len(s)-l+1):
s1 = s[i:i+l]
count = 0
for j in range(len(s1)):
if s1[j] != t[j]:
count += 1
minCount = min(minCount, count)
print(minCount);
if __name__ == '__main__':
main();
|
p02571 | s469436683 | Accepted | S=input()
T=input()
SL=len(S)
TL=len(T)
def match(x,y):
c=0
for i in range(TL):
if x[i]==y[i]:
c+=1
return c
max_match=0
for j in range(SL-TL+1):
m=match(S[j:],T)
max_match=max(max_match,m)
print("{}".format(TL-max_match)) |
p02571 | s466214230 | Accepted | S = input()
T = input()
ans = float("Inf")
len_s = len(S)
len_t = len(T)
for i in range(len_s-len_t+1):
_ans = 0
for j in range(len_t):
if S[i+j] != T[j]:
_ans += 1
ans = min(ans, _ans)
print(ans)
|
p02571 | s957193562 | Accepted | s = input()
t = input()
lens = len(s)
lent = len(t)
chk = []
for i in range(lens-lent+1):
chk_sum = 0
tmp = s[i:i+lens]
for j in range(lent):
if tmp[j] == t[j]:
chk_sum += 1
chk.append(chk_sum)
#print (chk)
print(lent - max(chk)) |
p02571 | s814866581 | Accepted | s = input()
t = input()
ans = 1e9
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 | s726972712 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)+1):
tmp = len(t)
for j in range(len(t)):
if s[i+j] == t[j]:
tmp -= 1
if ans > tmp:
ans = tmp
print(ans)
|
p02571 | s211228944 | Accepted | S = input()
T = input()
min_diff=len(T)
for i in range(len(S)-len(T)+1):
diff=len(T)
for j in range(len(T)):
if T[j]==S[i+j]:
diff -= 1
if diff<min_diff:
min_diff = diff
ans = min_diff
print(ans) |
p02571 | s815917872 | Accepted | from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)+1):
cnt=0
for j in range(len(t)):
if s[i+j] != t[j]:
cnt += 1
ans = min(ans,cnt)
print(ans) |
p02571 | s079980290 | Accepted | s = input()
t = input()
sl = len(s)
tl = len(t)
d = sl -tl
ans = tl
for i in range(d + 1):
tmp = 0
for j in range(tl):
if s[i + j] != t[j]:
tmp += 1
ans = min(ans, tmp)
print(ans) |
p02571 | s149498886 | Accepted | s = input()
t = input()
ans = 1001
for i in range(len(s) - len(t) + 1):
count = 0
for j in range(len(t)):
if (s[i+j] != t[j]):
count += 1
ans = min(ans, count)
print(ans) |
p02571 | s922017434 | Accepted | s = input()
t = input()
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 | s675803028 | Accepted | def distance(s, t):
return len([1 for (a, b) in zip(s, t) if a != b])
S = input()
T = input()
ans = float('inf')
for i in range(len(S) - len(T) + 1):
ans = min(ans, distance(T, S[i:i+len(T)]))
print(ans)
|
p02571 | s915074761 | Accepted | S = input()
T = input()
len_s = len(S)
len_t = len(T)
def calc_diff(s1, s2):
c = 0
for i in range(len_t):
if s1[i] != s2[i]:
c += 1
return c
ans = float('inf')
for i in range(len_s - len_t + 1):
sub_s = S[i:i + len_t]
c = calc_diff(sub_s, T)
ans = min(ans, c)
print(ans) |
p02571 | s578690379 | Accepted | import sys
S = sys.stdin.readline().strip()
T = sys.stdin.readline().strip()
ls = len(S)
lt = len(T)
match = 0
for i in range(ls - lt + 1):
tmp = 0
for j in range(lt):
if S[i+j] == T[j]:
tmp += 1
match = max(match, tmp)
print(lt - match) |
p02571 | s247390425 | Accepted | #B
S=input()
T=input()
a=len(S)
b=len(T)
ans=float("inf")
for i in range(0,len(S)-len(T)+1):
K=S[i:i+len(T)]
cnt=0
for j in range(len(K)):
if K[j]!=T[j]:
cnt+=1
ans=min(ans,cnt)
print(ans) |
p02571 | s970059465 | Accepted | s = input()
t = input()
cost = 10**9+7
for i in range(len(s) - len(t)+1):
c = 0
sub_s = s[i:i+len(t)]
for j in range(len(t)):
if sub_s[j] != t[j]:
c += 1
cost = min(c, cost)
print(cost) |
p02571 | s033067797 | Accepted | from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))
def main():
S = rs()
T = rs()
ls = len(S)
lt = len(T)
print(min([sum([0 if x == y else 1 for x, y in zip(S[i:i + lt], T)]) for i in range(ls - lt + 1)]))
if __name__ == '__main__':
main()
|
p02571 | s827312564 | Accepted | # B Subtring
S = input()
T = input()
ans = 10000
for s in range(len(S) - len(T) + 1):
cnt = 0
for t in range(len(T)):
if S[s+t] != T[t]:
cnt += 1
ans = min(ans, cnt)
print(ans) |
p02571 | s852571680 | Accepted | def solve(S, T):
ans = len(T)
for i in range(len(S) - len(T) + 1):
diff = 0
for j in range(len(T)):
if T[j] != S[i + j]:
diff += 1
ans = min(ans, diff)
print(ans)
if __name__ == "__main__":
S = input()
T = input()
solve(S, T)
|
p02571 | s762655158 | Accepted | S = input()
T = input()
ans = len(T)
for i in range(len(S)-len(T)+1):
cnt = len(T)
for j in range(len(T)):
if S[i+j] == T[j]:
cnt -= 1
ans = min(ans,cnt)
print(ans)
|
p02571 | s455751615 | Accepted | S=input()
T=input()
N=len(S)
ans=10**30
for i in range(N-len(T)+1):
cnt=0
for j in range(len(T)):
if S[j+i]!=T[j]:
cnt+=1
ans=min(ans,cnt)
print(ans) |
p02571 | s488201218 | Accepted | #!/usr/bin/env python3
S = input()
T = input()
if T in S:
print(0)
exit()
ans = 10 ** 5
for i in range(len(S) - (len(T) - 1)):
c = len(T)
for j in range(len(T)):
if T[j] == S[i + j]:
c -= 1
ans = min(ans, c)
print(ans)
|
p02571 | s212539905 | Accepted | import math
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
S = input()
T = input()
min_count = math.inf
for start in range(len(S)-len(T)+1):
end = start+len(T)
count = sum(c0 != c1 for c0, c1 in zip(S[start:end], T))
min_count = min(min_count, count)
return min_count
if __name__ == '__main__':
print(solve())
|
p02571 | s190387966 | Accepted | S = input()
T = input()
if T in S:
print(0)
else:
matched = 0
for i in range(len(S)-len(T)+1):
matched_work = 0
for j in range(len(T)):
if T[j] == S[i+j]:
matched_work += 1
if matched_work > matched:
matched = matched_work
print(len(T)-matched) |
p02571 | s792066967 | Accepted | def sdiff(s1, s2):
score = 0
for i in range(0, len(s2)):
if s1[i] != s2[i]: score += 1
return score
S = input()
T = input()
Ans = len(T)
for i in range(0, len(S) - len(T) + 1):
Ans = min(sdiff(S[i:], T), Ans)
print(Ans) |
p02571 | s614900290 | Accepted | s=input()
t=input()
ans=1000000
num=len(s)-len(t)
for i in range(num+1):
r=0
for j in range(len(t)):
if s[i+j]!=t[j]:
r+=1
if r<ans:
ans=r
print(ans) |
p02571 | s305555004 | Accepted | S = input()
T = input()
ans = 99999999
for i in range(len(S)-len(T)+1):
word = S[i:i+len(T)]
cnt = 0
for j in range(len(word)):
if word[j]!=T[j]:
cnt+=1
ans = min(ans,cnt)
print(ans) |
p02571 | s432290989 | 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 t[j]==s[i+j]:
cnt+=1
ans=min(ans,len(t)-cnt)
print(ans) |
p02571 | s998438011 | Accepted | import sys
input = sys.stdin.readline
s = input()[:-1]
t = input()[:-1]
ans = len(t)
for i in range(len(s) - len(t) + 1):
tmp = sum(s[i + j] != t[j] for j in range(len(t)))
ans = min(ans, tmp)
print(ans)
|
p02571 | s104143942 | Accepted | from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()
INF = 1005
ans = INF
for i in range(len(s) - len(t) + 1):
newans = 0
for j in range(len(t)):
if s[i+j] != t[j]:
newans += 1
ans = min(ans, newans)
print(ans) |
p02571 | s495732707 | Accepted | s = input()
t = input()
n = len(s)
m = len(t)
ans = m
for i in range(n-m+1):
p = 0
for j in range(m):
if s[i+j] != t[j]: p += 1
if p < ans: ans = p
print(ans) |
p02571 | s625043501 | Accepted | S = str(input())
T = str(input())
count = 0
max_count = 0
for i in range(len(S)-len(T)+1):
nowS = S[i:i+len(T)]
for j in range(len(T)):
if nowS[j] == T[j]:
count += 1
max_count = max(max_count, count)
count = 0
print(len(T) - max_count) |
p02571 | s244112567 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t) + 1):
ans_tmp = 0
for j in range(len(t)):
if s[i+j] != t[j]:
ans_tmp += 1
ans = min(ans, ans_tmp)
print(ans) |
p02571 | s425146973 | Accepted | import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().rstrip()
def main():
s = input()
t = input()
ans = len(t)
for start in range(len(s) - len(t)+1):
tmp = s[start:(start+len(t))]
diff = 0
for i in range(len(t)):
if tmp[i] != t[i]:
diff += 1
ans = min(ans, diff)
print(ans)
if __name__ == '__main__':
main() |
p02571 | s991480269 | Accepted | # import sys
# input = sys.stdin.readline
def mp(): return map(int, input().split())
def lmp(): return list(map(int, input().split()))
s = input()
t = input()
ans = 100000
for i in range(len(s)-len(t)+1):
u = s[i:i+len(t)]
cnt = 0
for j in range(len(t)):
if u[j] != t[j]:
cnt += 1
ans = min(ans,cnt)
print(ans)
|
p02571 | s952780748 | Accepted | S = input()
T = input()
def match_num_character(x, y):
count = 0
for a, b in zip(x, y):
if a == b:
count += 1
return count
length = len(T)
max_count = max([match_num_character(S[i:i+length], T) for i in range(1+len(S) - length)])
print(length - max_count) |
p02571 | s566226247 | Accepted | S=input()
T=input()
t = len(T)
s = len(S)
res = t
mid = 0
for i in range(s-t+1):
mid=0
for j in range(i,i+t):
if S[j] == T[j-i]:
mid += 1
res = min(t-mid,res)
print(res) |
p02571 | s846305310 | Accepted | S = input()
T = input()
min = len(S)
for i in range(len(S)-len(T)+1):
count = 0
for j in range(len(T)):
if T[j] != S[i+j]:
count += 1
if min >= count:
min = count
print(min) |
p02571 | s462666233 | Accepted | S = input()
T = input()
n, m = len(S), len(T)
ans = n
for i in range(n - m + 1):
cnt = 0
subS = S[i: i + m]
for s, t in zip(subS, T):
if s != t:
cnt += 1
if ans > cnt:
ans = cnt
print(ans) |
p02571 | s623877909 | Accepted | s = input()
t = input()
n = len(t)
ans, res = 0, len(s)
for i in range (0, len(s) - len(t) + 1) :
a = s[i : i + n]
for i in range(0, n) :
if (a[i] != t[i]): ans += 1
res = min(res, ans)
ans = 0
print(res) |
p02571 | s729024161 | Accepted | s = list(input())
t = list(input())
count = 0
ans = 0
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j] == t[j]:
count += 1
if count >= ans:
ans = count
count=0
print(len(t)-ans)
|
p02571 | s499164114 | Accepted | s=input()
t=input()
l=[False]*len(s)
c=0
m=0
for x in range(len(s)-len(t)+1):
c=0
for y in range(len(t)):
w=s[x:x+len(t)]
if w[y]==t[y]:c+=1
m=max(m,c)
print(len(t)-m) |
p02571 | s745869139 | Accepted | S = input()
T = input()
ans = float('inf')
for i in range(len(S)):
string = S[i:i + len(T)]
if len(string) < len(T):
continue
score = len([1 for ch_s, ch_t in zip(string, T) if ch_s != ch_t])
ans = min(ans, score)
print(ans) |
p02571 | s667089142 | Accepted | def resolve():
s = input()
t = input()
ans = 10**18
for i in range(len(s) - len(t) + 1):
a = 0
for j in range(len(t)):
if s[i + j] != t[j]:
a += 1
if ans > a:
ans = a
print(ans)
resolve() |
p02571 | s026617510 | Accepted | S = input()
T = input()
ans = 10**18
for l in range(len(S) - len(T) + 1):
cnt = 0
for s, t in zip(S[l:], T):
if s != t:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02571 | s879111956 | Accepted | # coding:utf-8
s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t) + 1):
count = 0
for j in range(0, len(t)):
if s[i + j] != t[j]:
count += 1
ans = min(ans, count)
print(ans)
|
p02571 | s439743290 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
S = input()
T = input()
len_s = len(S)
len_t = len(T)
ans = 1000
for i in range(len_s-len_t+1):
cunt = 0
for j in range(len_t):
if S[i+j] != T[j]:
cunt += 1
ans = min(ans, cunt)
print(ans)
if __name__=='__main__':
main() |
p02571 | s559818183 | Accepted | from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math
import random
J=10**19
###############################################################################\n=17
s=input()
t=input()
ans=10**6
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 | s220263144 | Accepted | s = input()
t = input()
n, m = len(s), len(t)
ans = 0
for i in range(n - m + 1):
match = 0
for j in range(m):
if s[i + j] == t[j]:
match += 1
ans = max(ans, match)
print(m - ans)
|
p02571 | s596175036 | Accepted | s = input()
t = input()
res = []
for i in range(len(s)-len(t)+1):
x = s[i:i+len(t)]
count = sum(1 for a, b in zip(t, x) if a != b)
res.append(count)
print(min(res))
|
p02571 | s611060674 | Accepted | s = input()
t = input()
num = len(s) - len(t) + 1
ans = []
for i in range(num):
counter = 0
for j in range(len(t)):
if t[j] == s[j+i]:
counter += 1
ans.append(counter)
print(len(t) - max(ans)) |
p02571 | s995629370 | Accepted | s = list(input())
t = list(input())
ls = len(s)
lt = len(t)
ans = 1000
for i in range(ls-lt+1):
count = 0
for j in range(lt):
if s[j+i] != t[j]:
count += 1
ans = min(ans,count)
print(ans) |
p02571 | s306727649 | Accepted | S = input()
T = input()
ans = 0
for i in range(len(S)-len(T)+1):
same = 0
for j in range(len(T)):
if S[i+j] == T[j]:
same += 1
else:
ans = max(ans, same)
print(len(T) - ans) |
p02571 | s154073686 | Accepted | '''
Contest 177 - Task B
'''
def count_changed_chars(a, b):
ans = 0
for i in range(len(a)):
if a[i] != b[i]:
ans += 1
return ans
if __name__ == "__main__":
haystack = input()
needle = input()
dists = []
for i in range(len(haystack) - len(needle) + 1):
sub = haystack[i : i+len(needle)]
dists.append(count_changed_chars(sub, needle))
print(min(dists))
|
p02571 | s503238955 | Accepted | S = input()
T = input()
ans = 0xffffff
for offset in range(len(S) - len(T) + 1):
diff = 0
for i in range(len(T)):
if S[offset + i] != T[i]:
diff += 1
ans = min(ans, diff)
print(ans)
|
p02571 | s801408462 | Accepted | s = input()
t = input()
c = 0
u = []
for i in range(len(s)-len(t)+1):
c = 0
for j in range(len(t)):
if t[j]!=s[j+i]:
c+=1
u.append(c)
print(min(u)) |
p02571 | s018677336 | Accepted | def main():
s = input()
t = input()
# sがtの長さにおいて一致している最大の文字数を特定
max_counter = 0
for i in range(len(s)-len(t)+1):
counter = 0
for j in range(len(t)):
if s[i+j] == t[j]:
counter += 1
if counter > max_counter:
max_counter = counter
answer = len(t) - max_counter
print(answer)
if __name__ == "__main__":
main()
|
p02571 | s761569837 | Accepted | s = input()
t = input()
t_len = len(t)
s_len = len(s)
max_ = 0
temp = 0
for i in range(s_len - t_len + 1):
for j in range(t_len):
if s[i + j] == t[j]:
temp += 1
if max_ < temp:
max_ = temp
temp = 0
print(t_len - max_) |
p02571 | s206759224 | Accepted | s = input()
t = input()
ans = 10004
cnt = 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 = min(ans, cnt)
print(ans)
|
p02571 | s659087287 | Accepted | s = input()
t = input()
n_s = len(s)
n_t = len(t)
ans = float("inf")
for i in range(n_s-n_t+1):
count = 0
for j in range(n_t):
if s[i+j] != t[j]:
count += 1
ans = min(ans, count)
print(ans) |
p02571 | s629193620 | Accepted | S = input()
T = input()
ans = 1000
for start in range(len(S) - len(T) + 1):
diff = 0
for i in range(len(T)):
if not T[i] == S[start + i]:
diff += 1
ans = min(ans, diff)
print(ans) |
p02571 | s413607659 | Accepted | S = input()
T = input()
lt = len(T)
ans_min = len(T)
for i in range(len(S)-lt+1):
s_tmp = S[i: i + lt]
ans_tmp = 0
for j in range(lt):
if s_tmp[j] != T[j]:
ans_tmp += 1
ans_min = min(ans_min, ans_tmp)
print(ans_min)
|
p02571 | s204317854 | Accepted | S = input()
T = input()
max_num = 0
count = 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 max_num < count:
max_num = count
#print(max_num)
print(len(T)-max_num) |
p02571 | s336282508 | Accepted |
S = input()
T = input()
if len(T) > len(S) or len(S) == 0:
print(0)
answer = float("inf")
for i in range(len(S) - len(T) + 1):
sub = S[i: i + len(T)]
unique = 0
for s,o in zip(sub, T):
if s != o:
unique += 1
answer = min(answer, unique)
print(answer) |
p02571 | s014940960 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
ans = float('inf')
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 | s729808355 | Accepted | S=list(input())
T=list(input())
ans_li=[]
for i in range(len(S)-len(T)+1):
ans=0
for j in range(len(T)):
if S[i+j]!=T[j]:
ans+=1
ans_li.append(ans)
print(min(ans_li)) |
p02571 | s551411451 | Accepted | s=input()
t=input()
slen=len(s)
tlen=len(t)
min=tlen
def howdifferent(t1,t):
count=0
for i in range(len(t)):
if t1[i]!=t[i]:
count+=1
return count
for i in range(slen-tlen+1):
t1 = s[i:]
if howdifferent(t1,t)<min:
min = howdifferent(t1,t)
print(min) |
p02571 | s404172853 | Accepted | S = input()
T = input()
ans = len(T)
for i in range(len(S)-len(T)+1):
s = S[i:i+len(T)]
tmp = 0
for j in range(len(T)):
if s[j] != T[j]:
tmp += 1
ans = min(ans, tmp)
print(ans) |
p02571 | s912914820 | Accepted | S = input()
T = input()
N, M = len(S), len(T)
ans = float("inf")
for i in range(N-M+1):
tmp = 0
for j in range(M):
if S[i+j] != T[j]:
tmp += 1
ans = min(ans, tmp)
print(ans) |
p02571 | s399421380 | Accepted | s = input()
t = input()
a = []
for i in range(len(s) - len(t) + 1):
w = s[i:i + len(t)]
sum = 0
for j in range(len(t)):
if w[j] != t[j]:
sum += 1
a.append(sum)
print(min(a))
|
p02571 | s079426551 | Accepted | S = input()
T = input()
lens = len(S)
lent = len(T)
ans = lent
for i in range(lens-lent+1):
s = S[i:i+lent]
count = 0
for j in range(lent):
if s[j] != T[j]:
count+= 1
ans = min(ans, count)
print(ans) |
p02571 | s977664453 | Accepted | s = input()
t = input()
count = 0
reg = 0
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j] == t[j]:
count = count + 1
if count > reg:
reg = count
count = 0
reg = len(t) - reg
print(reg)
|
p02571 | s243460647 | Accepted | ################ B
s = input()
t = input()
co = 0
num = 0
N = 0
N_max = 0
for i in range(len(s)-len(t)+1):
for k in range(len(t)):
if s[i+k] == t[k]:
N += 1
N_max = max(N,N_max)
N = 0
print(len(t)-N_max) |
p02571 | s933579650 | Accepted | S = input()
T = input()
ans = len(T)
for i in range(len(S)-len(T)+1):
count = 0
for j in range(len(T)):
if S[i:i+len(T)][j:j+1] != T[j:j+1]:
count += 1
ans = min(count,ans)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.