ZhenlongDai/ACPR huggingface dataset:
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
b = input()
count = 0
for i in range(len(a)):
    if b[i] != a[i]:
        b = b[i-1:] + a[i] + b[:i+1]
        count +=  1
print(count)

Failing test case input:
efffodfopuc
cupofhottea

Expected output:
11


Actual output:
10


Fixed submission (verdict: Accepted):
a = input()
b = input()
count = 0
for i in range(len(a)):
    if b[i] != a[i]:
        count +=  1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
b = input()
ans = 0
for i in range(len(a)):
  if a[i] == b[i]:
    ans += 1
print(ans)

Failing test case input:
pknad
oahoj

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
a = input()
b = input()
ans = 0
for i in range(len(a)):
  if a[i] != b[i]:
    ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S='apple'
T='apple'
count=0;
for i in range(0,len(S)):
    if (T[i]!=S[i]):
        count+=1
print(count)

Failing test case input:
ffgdmdfqpuc
oevt`ieuppd

Expected output:
10


Actual output:
0


Fixed submission (verdict: Accepted):
S=input()
T=input()
count=0;
for i in range(0,len(S)):
    if (T[i]!=S[i]):
        count+=1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
line1 = list(input())
line2 = list(input())
t = 0
for i in range(len(line1)):
     if line1[i] == line2[i]:
         t = t +1
print (t)

Failing test case input:
cdcba
bcdea

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
a = list(input())
b = list(input())
t = 0
for i in range(len(a)):
     if not a[i] == b[i]:
         t = t +1
         
print (t)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
A = str(input())
B = str(input())
l = len(A)
C = 0
for i in range(0, l):
    if A[i] != B[i]:
        C+=C + 1
print(C)


Failing test case input:
ddb`d
gcccb

Expected output:
5


Actual output:
31


Fixed submission (verdict: Accepted):
A = str(input())
B = str(input())
l = len(A)
C = 0
for i in range(0, l):
    if A[i] != B[i]:
        C =C + 1
print(C)

Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
s=input()
t=input()
n=len(s)
ans=0
for i in range(n):
    if s[i]==t[i]:
        ans+=1
print(ans)

Failing test case input:
fhlrglsctdc
ffljyboxtdl

Expected output:
7


Actual output:
4


Fixed submission (verdict: Accepted):
s=input()
t=input()
n=len(s)
ans=0
for i in range(n):
    if s[i]!=t[i]:
        ans+=1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = list(input())
T = list(input())
count = 0
for s,t in zip(S,T):
    if s != t:
        count += 1

Failing test case input:
qloae
pagpk

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
S = list(input())
T = list(input())
count = 0
for s,t in zip(S,T):
    if s != t:
        count += 1
print(count)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
ans = 0
for i in range(len(S)):
  if S[i] != T[i]:
    ans += 1
print(i)

Failing test case input:
pkoad
oahoj

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
S = input()
T = input()
ans = 0
for i in range(len(S)):
  if S[i] != T[i]:
    ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input().split()
t = input().split()
j = 0
for i in range(len(s)):
  if not(s[i] == t[i]):
    j += 1
 
print(j)

Failing test case input:
ddc`b
faccb

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
s = input()
t = input()
j = 0
for i in range(len(s)):
  if not(s[i] == t[i]):
    j += 1
 
print(j)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = str(input())
t = str(input())

count = 0
for i in range(len(s)):
  if s[i]==t[i]:
    count+=1
    
print(count)

Failing test case input:
pkoad
kogao

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
s = str(input())
t = str(input())
 
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count +=1 
    
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = list(input())
T = list(input())

count = 0
for i in range(len(S)):
    if S[i] == T[i]:
        count += 1
print(count)

Failing test case input:
cdcaa
bbdfa

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
S = list(input())
T = list(input())
count = 0
for i in range(len(S)):
    if S[i] != T[i]:
        count += 1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
b = input()
r = 0
for i in range(0,len(a)):
  if a[i] == b[i]:
    r += 1
print(r)

Failing test case input:
ddc`b
faccb

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a = input()
b = input()
r = 0
for i in range(0,len(a)):
  if a[i] != b[i]:
    r += 1
print(r)

Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
a = input()
b = input()
c = len(a)
d = list(a)
e = list(b)

count = 0

for i in range(c):
    if d[i] == e[i]:
        count += 1
        
print(count)

Failing test case input:
d`bdd
bdccg

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
a = input()
b = input()
c = len(a)
d = list(a)
e = list(b)

count = 0
for i in range(c):
    if d[i] != e[i]:
        count += 1
        
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = list(input())
t = list(input())
print(s)
print(t)

time = 0
for i in range(len(s)):
    if s[i] != t[i] :
        s[i] = t[i]
        time += 1
 
print(time)

Failing test case input:
eaolq
pagpk

Expected output:
4


Actual output:
['e', 'a', 'o', 'l', 'q']
['p', 'a', 'g', 'p', 'k']
4


Fixed submission (verdict: Accepted):
s = list(input())
t = list(input())

time = 0
for i in range(len(s)):
    if s[i] != t[i] :
        s[i] = t[i]
        time += 1
 
print(time)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input().split()
b = input().split()

cnt = 0
for i in range(len(a)):
  if a[i]!=b[i]:
    cnt += 1
    
print(cnt)

Failing test case input:
ddb`d
fbcac

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
a = input()
b = input()

cnt = 0
for i in range(len(a)):
  if a[i]!=b[i]:
    cnt += 1
    
print(cnt)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=list(input().split())
T=list(input().split())
count=0
for i in range(len(S)):
  if S[i]!=T[i]:
    count = count+1
print(count)

Failing test case input:
pkoad
kogao

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
ans=0
S=list(input())
T=list(input())
for i in range(len(S)):
  if S[i] != T[i]:
    ans = ans+1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
count = 0
for i in range(len(s)):
  if s[i] == t[i]:
    count += 1
print(count)

Failing test case input:
d`bdd
bdccg

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
t = input()
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()

l = len(s)
c = 0
for i in range(0, l):
  if s[i]==t[i]:
    c+=1

Failing test case input:
pknad
johao

Expected output:
4


Actual output:

Fixed submission (verdict: Accepted):
s = input()
t = input()
 
l = len(s)
c = 0
for i in range(0, l):
  if s[i]!=t[i]:
    c+=1
    
print(c)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str1[num])

    print(list(set(data)))

if __name__ == '__main__':
    MinorChange()

Failing test case input:
pkoad
kogao

Expected output:
4


Actual output:
o, p, d, k

Fixed submission (verdict: Accepted):
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str2[num])

    print(len(data))

if __name__ == '__main__':
    MinorChange()

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
ss=input()
c=0
for i in range(len(ss)):
  if(s[i]!=s[i]):
    c+=1
print(c)

Failing test case input:
pkoad
oagoj

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
n=input()
nn=input()
c=0
for i in range(len(n)):
    if(n[i]!=nn[i]):
        c+=1
print(c)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=input()
cnt=0
for i in range(len(s)):
    if s[i]==t[i]:
        cnt+=1
print(cnt)  

Failing test case input:
pknad
oahpj

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s=input()
t=input()
cnt=0
for i in range(len(s)):
    if s[i]!=t[i]:
        cnt+=1
print(cnt)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
sum(S[i] != T[i] for i in range(len(S)))

Failing test case input:
efffmdfopuc
cupofhotuea

Expected output:
11


Actual output:

Fixed submission (verdict: Accepted):
S = input()
T = input()
print(sum(S[i] != T[i] for i in range(len(S))))

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s,t = input(), input()
a = 0
for i in range(len(s)):
    if s[i]==t[i]:
        a = a + 1
print(a)


Failing test case input:
ffgdmdfqpuc
oevtaieppud

Expected output:
9


Actual output:
2


Fixed submission (verdict: Accepted):
s,t = input(), input()
a = 0
for i in range(len(s)):
    if s[i]!=t[i]:
        a = a + 1
print(a)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
s = list(S)
t = list(T)
K = len(s)
n=0
for i in range(0, K):
  if s[i] == t[i]:
    n+=1
  else:
    pass
print(n)

Failing test case input:
cupofcoffee
cupofhottea

Expected output:
4

Actual output:
7


Fixed submission (verdict: Accepted):
S = input()
T = input()
s = list(S)
t = list(T)
K = len(s)
n=0
for i in range(0, K):
  if s[i] != t[i]:
    n+=1
  else:
    pass
print(n)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
st = list(s)
ts = list(t)
j = 0
for i in range(len(st)):
    if(st[i] == ts[i]):
        j = 0
    elif(st[i] != ts[i]):
        ts[i] = st[i]
        j = j + 1



print(j)

Failing test case input:
ffgdmdfqpuc
oevtaieppud

Expected output:
9


Actual output:
1


Fixed submission (verdict: Accepted):
s = input()
t = input()
st = list(s)
ts = list(t)
j = 0
for i in range(len(st)):
    if(st[i] == ts[i]):
        j = j
    elif(st[i] != ts[i]):
        ts[i] = st[i]
        j = j + 1



print(j)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
ans = 0
for i in range(len(S)):
	if S[i] == T[i]:
		ans += 1
print(ans)

Failing test case input:
apple
apple

Expected output:
0

Actual output:
5


Fixed submission (verdict: Accepted):
S = input()
T = input()
ans = 0
for i in range(len(S)):
	if S[i] != T[i]:
		ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):


str_s = input()
str_t = input()
str_len = len(str_s)
str_match_cnt = 0

st_converter = lambda s,t : s == t

for i in range(str_len):
    if st_converter(str_s[i], str_t[i]):
        str_match_cnt += 1

print(str_match_cnt)    

Failing test case input:
fffdmdfopuc
duppfhotuea

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):


str_s = input()
str_t = input()
str_len = len(str_s)
str_match_cnt = 0

st_converter = lambda s,t : s == t

for i in range(str_len):
    if not st_converter(str_s[i], str_t[i]):
        str_match_cnt += 1

print(str_match_cnt)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()

def count_diff2(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt

Failing test case input:
dankp
oahoj

Expected output:
4


Actual output:

Fixed submission (verdict: Accepted):
S = input()
T = input()

def count_diff(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt
print(count_diff(S,T))

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
x = len(s)
z = 0
for i in range(x) :
  if s[i] == t[i] :
    z = z + 1
print(z)

Failing test case input:
efffmdfopuc
cupofhotuea

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
t = input()
x = len(s)
z = 0
for i in range(x) :
  if s[i] != t[i] :
    z = z + 1
print(z)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
a = 0
for i in range(len(s)):
  if s[i] == t[i]:
    a += 1
    
print(a)

Failing test case input:
cupqfdmdgff
dopuei`tvep

Expected output:
10


Actual output:
1


Fixed submission (verdict: Accepted):
s = input()
t = input()
a = 0
for i in range(len(s)):
  if not s[i] == t[i]:
    a += 1
    
print(a)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=input()
ans=0
for i in range(len(s)):
    if s[i]==t[i]:
        ans += 1
print(ans)

Failing test case input:
cupqfdmdggf
dopuei`tvep

Expected output:
10


Actual output:
1


Fixed submission (verdict: Accepted):
s=input()
t=input()
ans=0
for i in range(len(s)):
    if s[i]!=t[i]:
        ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=input()
T=input()
S1=list(S)
T1=list(T)

for i in range(len(S1)):
    if(S1[i]!=T1[i]):
        S1[i]=T1[i]
    
print(i)
    

Failing test case input:
pknad
oahoj

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
S=input()
T=input()
S=list(S)
T=list(T)
j=0
for i in range(len(S)):
    if(S[i]!=T[i]):
        S[i]=T[i]
        j +=1
print(j)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=input()

ans=0
for i in range(len(s)):
    if s[i]==t[i]:
        ans+=1
print(ans)


Failing test case input:
pkoad
oahoj

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s=input()
t=input()

ans=0
for i in range(len(s)):
    if s[i]!=t[i]:
        ans+=1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
a = []
b = []
a.append(S)
b.append(T)
count = 0
for i in range(len(a)):
    if a[i] != b[i]:
        count += 1
    else :
        pass
print(count)

Failing test case input:
dcd`b
facbc

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
S = input()
T = input()
a = list(S)
b = list(T)
count = 0
for i in range(len(a)):
    if a[i] != b[i]:
        count += 1
    else :
        pass
print(count)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s,t = input(), input()
a = 0
for i in range(len(s)):
    if s[i]==t[i]:
        a = a + 1
    else:
        a = a + 0
print(a)


Failing test case input:
ffgdmdfqpuc
oeutaieppud

Expected output:
9


Actual output:
2


Fixed submission (verdict: Accepted):
s,t = input(), input()
a = 0
for i in range(len(s)):
    if s[i]!=t[i]:
        a = a + 1
print(a)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
b = input()
ans = 0
for i in range(len(a)):
  if a[i] == b[i]:
    ans += 1
print(ans)

Failing test case input:
ddb`d
gccdb

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
a = input()
b = input()
ans = 0
for i in range(len(a)):
  if a[i] != b[i]:
    ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
u = 0

if s == t:
  print(0)
else:
  for i in range(len(s)):
    if s[i] == t[i]:
      u += 1

print(u)

Failing test case input:
ddb`d
cbccf

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
t = input()
u = 0

if s == t:
  print(0)
else:
  for i in range(len(s)):
    if s[i] != t[i]:
      u += 1
  print(u)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=input()
T=input()
count=list(range(0,len(S)))
print(count)

c=0

for i in count:
    if S[i] != T[i]:
        c+=1
    else:
        continue
print(c)

Failing test case input:
d`bcd
bgccd

Expected output:
3


Actual output:
[0, 1, 2, 3, 4]
3


Fixed submission (verdict: Accepted):
S=input()
T=input()
count=list(range(0,len(S)))
c=0

for i in count:
    if S[i] != T[i]:
        c+=1
    else:
        continue
print(c)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
count = 0
for s, t in zip(S, T):
    if s != t:
        count += 1

print(int((count+1)/2))

Failing test case input:
pknad
oahoj

Expected output:
5


Actual output:
3


Fixed submission (verdict: Accepted):
S = input()
T = input()
count = 0
for s, t in zip(S, T):
    if s != t:
        count += 1

print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
Answer = input()
input_retu = input()
count = 0
for i in range(len(Answer)):
    if Answer[i] == input_retu[i]:
        continue
    else:
        count += 1

Failing test case input:
fffdmdfppuc
duppfiotuea

Expected output:
11


Actual output:

Fixed submission (verdict: Accepted):
Answer = input()
input_retu = input()
count = 0
for i in range(len(Answer)):
    if Answer[i] == input_retu[i]:
        continue
    else:
        count += 1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=input()
T=input()
S1=list(S)
T1=list(T)
for i in range(len(S1)):
    if(S1[i]!=T1[i]):
        S1[i]=T1[i]
print(i+1)
    

Failing test case input:
elpap
elppb

Expected output:
2


Actual output:
5


Fixed submission (verdict: Accepted):
S=input()
T=input()
S=list(S)
T=list(T)
j=0
for i in range(len(S)):
    if(S[i]!=T[i]):
        S[i]=T[i]
        j +=1
print(j)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()

a = 0

for i in range(len(s)):
	if s[i] == t[i]:a = a + 1
    
print(a)

Failing test case input:
pkoad
oahoj

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
t = input()

a = 0

for i in range(len(s)):
	if s[i] != t[i]:
		a = a + 1
    
print(a)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = list(input())
T = list(input())
cnt = 0
for t in range(0,int(len(S))-1):
  if S[t] != T[t]:
    cnt += 1
print(cnt)

Failing test case input:
pknad
johao

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
S = list(input())
T = list(input())
cnt = 0
for t in range(0,int(len(S))):
  if S[t] != T[t]:
    cnt += 1
print(cnt)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s1 = input().split()
strS = s1[0]
s2 = input().split()
strT = s2[0]










charStrSList = list(strS)
charStrTList = list(strT)

intCnt = 0
idx = 0
for sChar in charStrSList:
    if (sChar != charStrTList[idx]) :
        intCnt += 1
        print(sChar)
        print(charStrTList[idx])
        print(intCnt) 
    idx += 1

print(intCnt) 


Failing test case input:
dankp
oahpj

Expected output:
4


Actual output:
d
o
1
n
h
2
k
p
3
p
j
4
4


Fixed submission (verdict: Accepted):
s1 = input().split()
strS = s1[0]
s2 = input().split()
strT = s2[0]

charStrSList = list(strS)
charStrTList = list(strT)
diffStrList = []

idxA = 0
for sChar in charStrSList:
    if (sChar != charStrTList[idxA]) :
        diffStrList.append(sChar)
    idxA += 1

print(len(diffStrList))

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()

res = sum(1 if s == t else 0 for s, t in zip(S,T))
print(res)

Failing test case input:
apple
apple

Expected output:
0

Actual output:
5


Fixed submission (verdict: Accepted):
S = input()
T = input()
 
res = sum(0 if s == t else 1 for s, t in zip(S,T))
print(res)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

S = list(input())
T = list(input())
l=len(S)
ct = 0
print(l)
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)


Failing test case input:
pknad
johao

Expected output:
4


Actual output:
5
4


Fixed submission (verdict: Accepted):

S = list(input())
T = list(input())
l =len(S)
ct = 0
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = list(input())
T = list(input())

ans = 0

for i in range(len(S)):
  ans += (S[i]==T[i])

print(ans)


Failing test case input:
abcde
bcdea

Expected output:
5

Actual output:
0


Fixed submission (verdict: Accepted):
S = list(input())
T = list(input())

ans = 0

for i in range(len(S)):
  ans += (S[i]!=T[i])

print(ans)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = [x for x in input()]
t = [y for y in input()]
count = 0
for _ in range(len(s)):
    if s[_] == t[_]:
        count+=1
print(count)

Failing test case input:
abcdd
bcdea

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s = [x for x in input()]
t = [y for y in input()]
count = 0
for _ in range(len(s)):
    if s[_] != t[_]:
        count+=1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str2[num])

    print(len(list(set(data))))

if __name__ == '__main__':
    MinorChange()

Failing test case input:
efffmdfopuc
cupofhotuea

Expected output:
11


Actual output:
9


Fixed submission (verdict: Accepted):
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str2[num])

    print(len(data))

if __name__ == '__main__':
    MinorChange()

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=input()
b=input()

kotae=0
for i in range(len(a)):
    if a[i]!=b[i]:
        kotae+=1

Failing test case input:
ddc`b
afccb

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
a=input()
b=input()
 
kotae=0
for i in range(len(a)):
    if a[i]!=b[i]:
        kotae+=1
        
print(kotae)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=input()

s.split()
t.split()

ans = 0

if s==t:
    print("0")

for i in range(len(s)):
    if s[i]!=t[i]:
        ans += 1

print(ans)

Failing test case input:
apple
apple

Expected output:
0

Actual output:
0
0


Fixed submission (verdict: Accepted):
s=input()
t=input()

s.split()
t.split()

ans = 0

if s==t:
    print("0")
    exit()

for i in range(len(s)):
    if s[i]!=t[i]:
        ans += 1

print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(0,len(P)-1):
  if P[t] is S[t]:
    count=count+1


print(int(count))

Failing test case input:
qload
kpgao

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(len(P)):
  if P[t] != S[t]:
    count=count+1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
num = 0
for s,t in zip(S,T):
    if s != t:
        num +=1


Failing test case input:
eaolq
pafpk

Expected output:
4


Actual output:

Fixed submission (verdict: Accepted):
S = input()
T = input()
num = 0
for s,t in zip(S,T):
    if s != t:
        num +=1
print(num)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

S = list(input())
T = list(input())
total = 0
for num in range(len(S)):
  if S[num] == T[num]:
    total +=1
print(total)

Failing test case input:
apple
elppa

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):

S = list(input())
T = list(input())
total = 0
for num in range(len(S)):
    if S[num] != T[num]:
        total += 1
print(total)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=input()
T=input()
count=0
for i in range(len(S)):
  if S[i]==T[i]:
    count+=1
print(count)

Failing test case input:
ddc`a
bbcfa

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
S=input()
T=input()
count=0
for i in range(len(S)):
  if S[i]!=T[i]:
    count+=1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def ABC172_B():
    s = input()
    t = input()

    counter=0
    for i in range(len(s)):
        if s[i] != t[i]:
            counter += 1
    if counter == len(s):
        print(counter)
    else:
        print(min(counter,len(s)-counter))

ABC172_B()


Failing test case input:
ffgdmdfqpuc
oevt`ieuppd

Expected output:
10


Actual output:
1


Fixed submission (verdict: Accepted):
def ABC172_B():
    s = input()
    t = input()

    counter=0
    for i in range(len(s)):
        if s[i] != t[i]:
            counter += 1
    if counter == len(s):
        print(counter)
    else:
        print(counter)

    

ABC172_B()

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input();t=input();
cnt=0
for i in range(len(s)):
  if s[i]==t[i]:
    cnt+=1
    
    
print(cnt)

Failing test case input:
btmqgdpdggf
dopuei_tvep

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):
s=input();t=input();
cnt=len(s)
for i in range(len(s)):
  if s[i]==t[i]:
    cnt-=1
    
    
print(cnt)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = 'cupofcoffee'
T = 'cupofhottea'

counter = 0

for s, t in zip(S, T):
    if s != t:
        counter += 1

print(counter)

Failing test case input:
cupqgdmdggf
pevt`ieupod

Expected output:
11


Actual output:
4


Fixed submission (verdict: Accepted):
S = input()
T = input()
 
counter = 0
 
for s, t in zip(S, T):
    if s != t:
        counter += 1
 
print(counter)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s, t, c = input(), input(), 0
for i in range(len(s)): c += 1 if s[i] == t[i] else 0
print(c)

Failing test case input:
ddb`d
fbcac

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s, t, c = input(), input(), 0
for i in range(len(s)): c += 1 if s[i] != t[i] else 0
print(c)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()

ret = 0

for s, t in zip(S,T):
    if s==t:
        ret+=1
print(ret)


Failing test case input:
ffgdmdfqpuc
dopuei`tvep

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):
S = input()
T = input()

ret = 0

for s, t in zip(S,T):
    if s!=t:
        ret+=1
print(ret)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(0,len(P)-1):
  if P[t] != S[t]:
    count=count+1
print(count)

Failing test case input:
pload
kogao

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(len(P)):
  if P[t] != S[t]:
    count=count+1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()

ans = 0
for i in range(len(S)-1):
    if S[i] != T[i]:
        ans += 1

print(ans)

Failing test case input:
eaolq
kpgao

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
S = input()
T = input()

ans = 0
for i in range(len(S)):
    if S[i] != T[i]:
        ans += 1

print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
 
len([x for x in map(set, zip(S, T)) if len(x) == 2])

Failing test case input:
dcd`b
facbc

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
S = input()
T = input()
 
print(len([x for x in map(set, zip(S, T)) if len(x) == 2]))

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = list(input())
b = list(input())
count = 0

for i,con in enumerate(b):
  if i == a[i]:
    break
  else:
    count+=1
print(count)

Failing test case input:
cupqfdmdgff
dopuei`tvep

Expected output:
10


Actual output:
11


Fixed submission (verdict: Accepted):
a = list(input())
b = list(input())
count = 0

for i in range(len(b)):
  if b[i] != a[i]:
  	count+=1
    
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = list(input())
b = list(input())
count = 0

for i,con in enumerate(b):
  if i == a[i]:
    break
  else:
    count+=1
    
print(count)

Failing test case input:
elppa
elppa

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):
a = list(input())
b = list(input())
count = 0

for i in range(len(b)):
  if b[i] != a[i]:
  	count+=1
    
print(count)

Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
a=input().split(" ")
b=input().split(" ")
c=len(a)
d=0
e=0
for i in range(int(c)):
    if a[i]==b[i]:
        d=d+1
    else:
        e=e+1

print(e)

Failing test case input:
fffdmdfopuc
duppfhotuea

Expected output:
11


Actual output:
1


Fixed submission (verdict: Accepted):
a1=input()
a=list(a1)
b1=input()
b=list(b1)
c=len(a)
d=0
e=0
for i in range(int(c)):
    if a[i]==b[i]:
        d=d+1
    else:
        e=e+1

print(e)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=input()
T=input()
ans=0
for i in range(len(S)):
    if S[i]==T[i]:
        ans+=1
print(ans)

Failing test case input:
apple
elppa

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
S=input()
T=input()
ans=0
for i in range(len(S)):
    if S[i]!=T[i]:
        ans+=1
print(ans)
Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
import sys

s1 = str(input())
s2 = str(input())
ans = 0

for i in range(len(s1)):
    if s1[i] == s2[i]:
        ans += 1

print(ans)

Failing test case input:
fffdmdfppuc
duppeiotuea

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):
import sys

s1 = str(input())
s2 = str(input())
ans = 0

for i in range(len(s1)):
    if s1[i] != s2[i]:
        ans += 1

print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=input()
ans=0
for i in range(len(s)):
  if s[i]==t[i]:
    ans+=1
print(ans)

Failing test case input:
ffgdmdfqpuc
oevt`ieuppd

Expected output:
10


Actual output:
1


Fixed submission (verdict: Accepted):
s=input()
t=input()
ans=0
for i in range(len(s)):
  if s[i]!=t[i]:
    ans+=1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=input()
b=input()
c=len(a)
d=0
for i in range(c):
  if a[i]==b[i]:
    d=d+1
print(d)
    
  

Failing test case input:
efffndfopuc
cupofhottea

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):
a=input()
b=input()
c=len(a)
d=0
for i in range(c):
  if a[i]==b[i]:
    d=d+1
print(c-d)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s,t = input(), input()

S = list(s)
T = list(t)

N = len(s) - 1
i = 0

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
    i += 1

print(i + 1)

Failing test case input:
d`bcd
bgccd

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
s,t = input(), input()

S = list(s)
T = list(t)

N = len(s) - 1
i = 0
counter = 0

while N + 1 != i:
    if S[i] != T[i]:
        S[i] = T[i]
        counter += 1
    i += 1

print(counter)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()

dif = 0
for _ in range(len(s)):
  if s[0] != t[0]:
    dif += 1
    
print(dif)

Failing test case input:
ddc`a
afcbb

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
s = input()
t = input()

dif = 0
for i in range(len(s)):
  if s[i] != t[i]:
    dif += 1
    
print(dif)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

a= []
b= []

a= input("Press a : ")

d= len(a)

b= input("Press b : ")

e= 0
for i in range(0, d):
    if a[i]==b[i]:
        pass
    else:
        e= e+1

print(e)

Failing test case input:
effemdfopuc
cupofhotuea

Expected output:
11


Actual output:
Press a : Press b : 11


Fixed submission (verdict: Accepted):

a= []
b= []

a= input(" ")

d= len(a)

b= input(" ")

e= 0
for i in range(0, d):
    if a[i]==b[i]:
        pass
    else:
        e= e+1
print(e)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S =input()
T = input()
count = 0
for i in range(0,len(S)):
    if S[i] != T[i]:
        count=count+1


Failing test case input:
pkoad
oahoj

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
S =input()
T = input()
count = 0
for i in range(0,len(S)):
    if S[i] != T[i]:
        count=count+1
print(count)
Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
S = list(input())
T = list(input())
print(S, T)
c = 0
for i in range(len(S)):
    if S[i] != T[i]:
        c += 1
print(c)

Failing test case input:
efffocfopuc
cupofhottea

Expected output:
11


Actual output:
['e', 'f', 'f', 'f', 'o', 'c', 'f', 'o', 'p', 'u', 'c'] ['c', 'u', 'p', 'o', 'f', 'h', 'o', 't', 't', 'e', 'a']
11


Fixed submission (verdict: Accepted):
S = list(input())
T = list(input())
c = 0
for i in range(len(S)):
    if S[i] != T[i]:
        c += 1
print(c)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
b = input()
c = 0
d = 0

for i in a:
    if b[c] == i:
        d = d+1
        c=c+1
    else:
        c=c+1

print(d)

Failing test case input:
dcd`b
faccb

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
a = input()
b = input()
c = 0
d = 0

for i in a:
    if b[c] != i:
        d = d+1
        c=c+1
    else:
        c=c+1

print(d)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
ans = 0
for S, T in zip(s, t):
  if S == T:
    ans += 1
print(ans)

Failing test case input:
qload
kogao

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
s = input()
t = input()
ans = 0
for S, T in zip(s, t):
  if S != T:
    ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
line1 = input()
line2 = input()
ans = 0
for i in range(len(line1)):
  if line1[i] == line2[i]:
    ans += 1
print(ans)

Failing test case input:
efffocfopuc
cupofhottea

Expected output:
11


Actual output:
0


Fixed submission (verdict: Accepted):
line1 = input()
line2 = input()
ans = 0
for i in range(len(line1)):
  if line1[i] != line2[i]:
    ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=input()
b=input()
count=0
for i in range(len(a)):
  if a[i]==b[i]:
    count+=1
print(count)

Failing test case input:
ddc`b
faccb

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a=input()
b=input()
count=0
for i in range(len(a)):
  if a[i]!=b[i]:
    count+=1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(0,len(P)-1):
  if P[t] == S[t]:
    count=count+1
print(count)

Failing test case input:
ddc`a
afcbb

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(len(P)):
  if P[t] != S[t]:
    count=count+1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
u = 0

if s == t:
  print(0)
else:
  for i in range(len(s)):
    if s[i] != t[i]:
      u += 1

print(u)


Failing test case input:
apple
apple

Expected output:
0

Actual output:
0
0


Fixed submission (verdict: Accepted):
s = input()
t = input()
u = 0

if s == t:
  print(0)
else:
  for i in range(len(s)):
    if s[i] != t[i]:
      u += 1
  print(u)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import timeit

a = [input() for i in range(2)]

S = a[0]
T = a[1]

def count_diff2(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt

print(timeit.timeit(lambda: count_diff2(S,T)))

Failing test case input:
apple
apple

Expected output:
0

Actual output:
0.45656993286684155


Fixed submission (verdict: Accepted):
import timeit

a = [input() for i in range(2)]

S = a[0]
T = a[1]

def count_diff2(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt

print(count_diff2(S,T))

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=input()
T=input()

count=0
for i in range(len(S)):
  if S[i]!=T[i]:
    count+=1
print(i)

Failing test case input:
abcde
bcdea

Expected output:
5

Actual output:
4


Fixed submission (verdict: Accepted):
S=input()
T=input()

count=0
for i in range(len(S)):
  if S[i]!=T[i]:
    count+=1
    
print(count)

Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
S = str(input())
T = str(input())

Sum = 0

for i in range(len(S)):
    if S[i] == T[i]:
        Sum += 1
        
print(Sum)

Failing test case input:
dcd`b
fbcac

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
S = str(input())
T = str(input())

Sum = 0

for i in range(len(S)):
    if S[i] != T[i]:
        Sum += 1
        
print(Sum)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()



a = [x for x in s]
b = [x for x in t]

count = 0

for i in range(len(a)):
  if a[i] == a[i]:
    count += 1
print(count)


Failing test case input:
elppa
elppa

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):
from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()



a = [x for x in s]
b = [x for x in t]

count = 0

for i in range(len(a)):
  if a[i] != b[i]:
    count += 1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def main():
    S = list(map(str, input().split()))
    T = list(map(str, input().split()))
    
    count = 0
    for i,s in enumerate(S):
        if s != T[i]:
            count +=1
    
    print(count)

if __name__ == '__main__':
    main()
        

Failing test case input:
dankp
johao

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
def main():
    S = input()
    T = input()
      
    count = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            count +=1
    
    print(count)

if __name__ == '__main__':
    main()

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

S = list(input())
T = list(input())
l=len(S)
ct = 0
print(l)
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)

Failing test case input:
elpap
plepb

Expected output:
4


Actual output:
5
4


Fixed submission (verdict: Accepted):

S = list(input())
T = list(input())
l =len(S)
ct = 0
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
num = 0

for i in range(len(T)):
  if (S[i] != T[i]):
    S[i] == T[i]
  num += 1

print(num)

Failing test case input:
ddcba
bcdea

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
S = input()
T = input()
num = 0

for i in range(len(T)):
  if (S[i] != T[i]):
   num += 1

print(num)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
ans = 0
for i in range(len(s)):
  ans += 1 if s[i] == t[i] else 0
print(ans)

Failing test case input:
elpaq
pafpk

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
t = input()
ans = 0
for i in range(len(s)):
  ans += 1 if s[i] != t[i] else 0
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=input()

l=len(s)
a=0
for i in range(l-1):
    if s[i]==t[i]:
        pass
    else:
        a+=1

print(a)



Failing test case input:
qload
kogao

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
s=input()
t=input()

l=len(s)
a=0
for i in range(l):
    if s[i]==t[i]:
        pass
    else:
        a+=1

print(a)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=list(input())
t=list(input())
cnt=0
for i,e in zip(s,t):
  print(i,e)
  if i != e:
    cnt+=1
print(cnt)

Failing test case input:
dcd`b
fbcac

Expected output:
5


Actual output:
d f
c b
d c
` a
b c
5


Fixed submission (verdict: Accepted):
s=list(input())
t=list(input())
cnt=0
for i,e in zip(s,t):
  if i != e:
    cnt+=1
print(cnt)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = str(input())
t = str(input())
revise = 0
len_str = len(s)
for i in range(len_str):
    if s[i] != t[i]:
        revise += 1

Failing test case input:
dcd`b
fbcac

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
s = str(input())
t = str(input())
revise = 0
len_str = len(s)
for i in range(len_str):
    if s[i] != t[i]:
        revise += 1
print(int(revise))

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
first_string = "abcde"
second_string = "abcfd"
count = 0

for x, y in zip(first_string, range(len(first_string))):
    if(second_string[y] != x):
        count += 1
print(count)

Failing test case input:
fffdmdfopuc
duppfiotuea

Expected output:
11


Actual output:
2


Fixed submission (verdict: Accepted):
first_string = input()
second_string = input()
count = 0

for x, y in zip(first_string, range(len(first_string))):
    if(second_string[y] != x):
        count += 1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import os

str = input()
str2 = input()

count = 0

for i in range(1, len(str)):
    if str[i] != str2[i]:
        count = count + 1

print(count)


Failing test case input:
qaple
pkfpb

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
import os

str = input()
str2 = input()

count = 0

for i in range(0, len(str)):
    if str[i] != str2[i]:
        count = count + 1

print(count)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x=input()
y=input()
m = 0 
for i in range(len(x)-1):
    if x[i] != y[i]:
        Y = y.replace(y[i], x[i]) 
        m+=1
        
print(m)      

Failing test case input:
dankp
oahoj

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
x=input()
y=input()
m = 0 
for i in range(len(x)):
    if x[i] != y[i]: 
        m+=1
print(m)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
count = 0
for i in range(len(S)):
  if S[i] == T[i]:
    count += 1
print(count)


Failing test case input:
ddc`b
afccb

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
S = input()
T = input()
count = 0
for i in range(len(S)):
  if S[i] != T[i]:
    count += 1
print(count)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
first_str = input().split()
anwser_str = input().split()
cnt = 0
for i in range(len(first_str)):
    if first_str[i] != anwser_str[i]:
        first_str[i] = anwser_str[i]
        cnt += 1

print(cnt)

Failing test case input:
dcd`b
faccb

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
first_str = list(input())
anwser_str = list(input())
cnt = 0
for i in range(len(first_str)):
    if first_str[i] != anwser_str[i]:
        first_str[i] = anwser_str[i]
        cnt += 1
print(cnt)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()
def count_diff(s,t) :
    lst_s = list(s)
    lst_t = list(t)
    len_s = len(lst_s)
    ng = 0
    for i in range(len_s) :
        if lst_s[i] != lst_t[i] :
            ng += 1
        print(ng)

count_diff(s,t)

Failing test case input:
apple
elppa

Expected output:
4


Actual output:
1
2
2
3
4


Fixed submission (verdict: Accepted):
def count_diff(s,t) :
    lst_s = list(s)
    lst_t = list(t)
    len_s = len(lst_s)
    ng = 0
    for i in range(len_s) :
        if lst_s[i] != lst_t[i] :
            ng += 1
    print(ng)
        
s = input()
t = input()

count_diff(s,t)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S=list(input())
T=list(input())
b=0
print(S)
print(T)

for i in range(0,len(S)):
    if S[i]!= T[i]:
        b+=1

print(b)


Failing test case input:
eeffocfopuc
cupofhottea

Expected output:
11


Actual output:
['e', 'e', 'f', 'f', 'o', 'c', 'f', 'o', 'p', 'u', 'c']
['c', 'u', 'p', 'o', 'f', 'h', 'o', 't', 't', 'e', 'a']
11


Fixed submission (verdict: Accepted):
S=list(input())
T=list(input())
b=0


for i in range(0,len(S)):
    if S[i]!= T[i]:
        b+=1

print(b)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
T = input()
 
c = 0
 
for s in S:
  for t in T:
    if s != t:
      c += 1
print(c)

Failing test case input:
cdcba
bbdfa

Expected output:
4


Actual output:
21


Fixed submission (verdict: Accepted):
S = input()
T = input()
 
c = 0
 
for s,t in zip(S,T):
  if s != t:
    c += 1
print(c)
Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = list(input())
T = list(input())
ans = 0
for i in range(len(S)):
    if S[i] in T:
        T.remove(S[i])
print(len(T))

Failing test case input:
ffgdmdfqpuc
duppeiotuea

Expected output:
11


Actual output:
8


Fixed submission (verdict: Accepted):
S = list(input())
T = list(input())
ans = 0
for i in range(len(S)):
    if S[i] != T[i]:
        ans += 1
print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=input()
b=input()
c=0
for i in range(len(a)):
  if a[i]==b[i]:
    c=c+1
print(c)

Failing test case input:
qaple
pkfpb

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
a=input()
b=input()
c=0
for i in range(len(a)):
  if a[i]==b[i]:
    c=c+1
print(len(a)-c)

Problem: p02622
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):


S = str(input())
T = str(input())
ans = 0

for i in range(len(S)):
    print(S[i], T[i])
    if S[i] != T[i]:
        ans += 1

print(ans)


Failing test case input:
cupqgdmdggf
dopuei`tvep

Expected output:
10


Actual output:
c d
u o
p p
q u
g e
d i
m `
d t
g v
g e
f p
10


Fixed submission (verdict: Accepted):


S = str(input())
T = str(input())
ans = 0

for i in range(len(S)):
    if S[i] != T[i]:
        ans += 1

print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
t = input()

ans = 0
i = 0
while i < len(s):
	if s[i] == t[i]:
		ans += 1
	i += 1

print(ans)

Failing test case input:
ffgdmdfqpuc
oeutaieppud

Expected output:
9


Actual output:
2


Fixed submission (verdict: Accepted):
s = input()
t = input()

ans = 0
i = 0
while i < len(s):
	if s[i] != t[i]:
		ans += 1
	i += 1

print(ans)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = 'abcde'
t = 'bcdea'
n = len(s)
cnt = 0
for i in range(n):
    if s[i] != t[i]:
        cnt += 1
print(cnt)


Failing test case input:
pkoad
jogao

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
s = input()
t = input()
n = len(s)
cnt = 0
for i in range(n):
    if s[i] != t[i]:
        cnt += 1
print(cnt)

Problem: p02622
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str1[num])

    print(len(list(set(data))))

if __name__ == '__main__':
    MinorChange()

Failing test case input:
elpap
plepb

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str2[num])

    print(len(data))

if __name__ == '__main__':
    MinorChange()