TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a=input()
b=input()
c=0
for i in range(a):
  if(a[i]!=b[i]):
    c=c+1
print(c)

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


Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()

for i in range(S):
  if S[i] != T[i]:
    T[i] = S[i]

print(S)
print(T)

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

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

print(count)
    
 


S = input()
T = input()

j =0
for i in S:
  if i != T[j]:
    count +=1
  j+=1

print(count)

S = input()
T = input()
count = 0
j =0
for i in S:
  if i != T[j]:
    count +=1
  j+=1

print(count)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()

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

S = list(input())
T = list(input())

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


Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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

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))

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
ret = 0
S = input()
T = input()
print(len[S[i] for i in range(len(S)) if S[i] != T[i]])

ret = 0
S = input()
T = input()
print(len([S[i] for i in range(len(S)) if S[i] != T[i]]))

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
 
c = 0
 
for s in S:
  for t in T:
    if s != t:
      c += 1
print(c)

import sys
S = input[0]
T = input[1]
leng　= len(S)
int N = 0

for i in leng:
  if S.charAt(i) == T.charAt(j):
    N = N + 1

print (N)

S = input()
T = input()
 
c = 0
 
for s,t in zip(S,T):
  if s != t:
    c += 1
print(c)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a = str(input())
b = str(input())
c = 0
for i in range(len(a)):
  if a[i] == b[i]:
    c += 0
  else:
    b[i] = a[i]
    c += 1
print(c)

a = str(input())
b = str(input())
c = 0
for i in range(len(a)):
  if a[i] == b[i]:
    c += 0
  else:
    c += 1
print(c)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

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

if __name__=='__main__':
  main()

import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

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

if __name__=='__main__':
  main()

import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

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()

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a=input()
b=input()
c=len(a)
d=0
for i in range(c):
  if a[i]==b[i]:
    d=d+1
print(d)
    
  

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)
    
  


Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()

ret = 0

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


S = input()
T = input()

ret = 0

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


Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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)

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)

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = list(map(str,input().split()))
t = list(map(str,input().split()))
count = 0
for i in range(len(s)):
    if(s[i] != t[i]):
        count += 1
print(count)

s = list(map(str,input().split()))
t = list(map(str,input().split()))
count = 0
for i in range(len(s)):
    if(s[i] == t[i]):
        count ++
print(count)

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a = input()
b = input()
r = 0
for i in range(0,len(a)):
  if a[i] == b[i]:
    r += 1
print(r)

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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
tmp = 0
for i in range(len(S)):
  if S[i] == T[i]:
    pass:
  else:
    tmp += 1
    
    
print(tmp)
  

S = input()
T = input()
tmp = 0
for i in range(len(S)):
  if S[i] == T[i]:
    pass
  else:
    tmp += 1
    
    
print(tmp)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
print(sum(a!=b for a,b in zip(input(),input()))


print(sum(a!=b for a,b in zip(input(),input())))

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

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

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


Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = list(input())
T = list(input())

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

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
t=input()
c=0
for i in range(len(s)):
	if s[i]!=t[i]:
      c+=1
print(c)

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


Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = input()
t = input()

count = 0

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

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = input()
t = input()

a = 0

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

s = input()
t = input()

a = 0

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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s, t, c = input(), input(), 0
for i in range(len(s)): c += 1 if s[i] == t[i] else 0
print(c)

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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S,T = list(input().split())
count=0
for i in range(len(S)):
    if S[i]!=T[i]:
        count+=1
print(count)

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S=input()
T=input()
aa=0
for s,t in zip(S,T):
  if s!=t:
    a+=1
print(a)

S=input()
T=input()
aa=0
for s,t in zip(S,T):
  if s!=t:
    aa+=1
print(aa)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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

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))

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
cnt = 0
for i in range(len(S)):
    if S[i] != T[i] :
        cnt += 1
prrint(cnt)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
# coding: UTF-8

S = input()
T = input()

res = set()
for ss, tt in zip(S, T):
    if ss != tt:
        set[ss] = 1

print(len(res))

# coding: UTF-8

S = input()
T = input()

res = 0
for ss, tt in zip(S, T):
    if ss != tt:
        res += 1

print(res)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s,t = input()
if s == t:
  print(0)
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(count)
    

s = input()
t = input()

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
t=input()
o=0
for x,y in s,t:
  if x != y:
    o+=1
print(o)
  

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

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
i = 0
ans = 1
while S!=T:
  if S[i] != T[i]:
    S = S[:i-1] + T[i] +S[i+len(S)]
    ans+=1
  i+=1
print(ans)

S = input()
T = input()

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


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

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

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
t=input()

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


s=input()
t=input()

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


Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S, T = map(int, input().split())

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

print(cnt)

S = input()
T = input()

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

print(cnt)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S=input()
T=input()

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

S=input()
T=input()

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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()

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

print(ans)

S = input()
T = input()

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

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
import sys
import os
f = open('input.txt', 'r')
sys.stdin = f
S = input()
T = input()
n = len(S)
ans = 0
for i in range(n):
    if (S[i]!=T[i]):
        ans += 1
print(ans)


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


Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()

S = list(S)
T = list(T)

i = 0
j = 0

while j < len(S):
  if S[j] = T[j]:
    i = i
    j += 1
  else:
    i += 1
    j += 1
    
print(i)

S = input()
T = input()

S = list(S)
T = list(T)

i = 0
j = 0

while j < len(S):
    if S[j] == T[j]:
        i = i
        j += 1
    else:
        i += 1
        j += 1

print(i)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = str(input())
t = str(input())
c = 0
for i in len(s):
  if(s[i] != t[i]):
    c+=1

print(c)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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)

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)

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S=int(input())
T=int(input())
count=0;
for i in range(0,len(S)):
    if (T[i]!=S[i]):
        count+=1
print(count)

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s,t = input().sprit()
a=0
for i in range(0,len(s)):
  if s[i]==t[i]:
    a=a+1
  else:
    a=a+0
print(a)

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


s,t = input(), split()
a = 0
for i in range(len(s)):
    if s[i]==t[i]:
        a = a + 1
    else:
        a = a + 0
print(a)


s,t = input().sprit()
a=0
for i in range(len(s)):
  if s[i]==t[i]:
      a=a+1
  else:
      a=a+0
print(a)

S,T = input().split()
a=0
for i in range(len(S)):
  if S[i]==T[i]:
      a=a+1
  else:
      a=a+0
print(a)

s,t = input().sprit()
i=int(input())
a=0
if s[i]=t[i]:
    a=a+1
else:
    a=a+0
print(a)

s,t = input().split()
a = 0
for i in range(len(t)):
    if s[i] == t[i]:
        a = a + 1
    else:
        a = a + 0
print(a)

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)


s,t = input().split()
a=0
for i in range(len(s)):
  if s[i]==t[i]:
      a=a+1
  else:
      a=a+0
print(a)

s,t = input().split()
a = 0
for i in range(len(s)):
    if s[i]==t[i]:
        a = a + 1
    else:
        a = a + 0
print(a)


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

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
t=input()
a=0
for x in range(s):
  if s[x]!=t[x]:
    a+=1
print(a)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
count = 0
for s, t in S, T:
  if s != t:
    count += 1
print(count)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
t=input()
ans=0
for i in range(s):
    if s[i]!=t[i]:
        ans+=1
        
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

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

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

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


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = list(input())
T = list(input())

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

S = list(input())
T = list(input())

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
line1 = list(input())
line2 = list(input())
t = 0
for i in range(len(line1)):
     if line1[i] == line2[i]:
         t = t +1
print (t)

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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = input()
t = input()
s = input()
a = [int(c) for c in s]
b = [int(d) for d in t]
ans = 0
for i in range(len(a)):
  if(a[i] != b[i]):
    ans += 1
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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
    else:
      path

print(u)


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)

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)


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
def B()
  S = input()
  T = input()
  count=0
  for i in range(len(S)):
    if S[i]!=T[i]:
    count = count+1
print(count)
B()

#172B
def B()
  S = input()
  T = input()
  count=0
  for i in range(length(S)):
    if S[i]!=T[i]:
    count = count+1
print(count)
B()

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
b=input()
c=0
for i in len(s):
  if s[i]!=b[i]:
    c=c+1
  else:
    pass
print(c)

s=input()
b=input()
c=0
for i in range(len(s)):
    if s[i]!=b[i]:
        c=c+1
    else:
        pass
print(c)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
ans = 0
for i, ch in enumerate(S):
  if ch != T[i]:
    ans += 1
return ans

S = input()
T = input()
ans = 0
for i, ch in enumerate(S):
  if ch != T[i]:
    ans += 1
print(ans)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s1 = input().split()
strS = s1[0]
s2 = input().split()
strT = s2[0]

#strS = 'cupofcoffee'
#strT = 'cupofhottea'

#strS = 'abcde'
#strT = 'bcdea'

#strS = 'apple'
#strT = 'apple'

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) 


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)) 

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
def b172(slist, tlist):

    ans = 0

    for s, t in slist, tlist:
        if s != t:
            ans += 1

    return ans

def main():
    slist = list(str(input()))
    tlist = list(str(input()))
    print(b172(slist, tlist))

if __name__ == '__main__':
    main()

def b172(slist, tlist):

    ans = 0

    for s, t in zip(slist, tlist):
        if s != t:
            ans += 1

    return ans

def main():
    slist = list(str(input()))
    tlist = list(str(input()))
    print(b172(slist, tlist))

if __name__ == '__main__':
    main()

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = input()
t = input()

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

print(cnt)        


s = input()
t = input()

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

print(cnt)        

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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()
        

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()
        

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

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

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S=input()
T=input()
S=list(S)
T=list(T)
for i in range(len(S)):
    if(S[i]!=T[i]):
        S[i]=T[i]
print(i+1)
    

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)
    

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)
    

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)
    

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
ans = 0
for i in range(len(S)):
  if S[i] != T[i]::
      ans += 1
print(ans)

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


Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S, T= map(int, input().split())
2 A = list(map(int, input().split()))
3 B = list(map(int, input().split()))

num = 0
for ind, s in enumerate(A):
    if  A[ind] != B[ind]:
        num = num + 1
print(num)

S, T= map(string, input().split())

num = 0
for ind, s in enumerate(S):
    if  S[ind] != T[ind]:
        num = num + 1
print(num)

S, T= input().split()

num = 0
for ind, s in enumerate(S):
    if  S[ind] != T[ind]:
        num = num + 1
print(num)

S, T= map(int, input().split())

num = 0
for ind, s in enumerate(S):
    if  S[ind] != T[ind]:
        num = num + 1
print(num)

s = input()
t = input()

num = 0
for ind, s in enumerate(A):
    if  A[ind] != B[ind]:
        num = num + 1
print(num)

S = input()
T = input()

num = 0
for ind, s in enumerate(S):
    if  S[ind] != T[ind]:
        num = num + 1
print(num)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
x, y=input().split()
m = 0 
for i in range(len(x)):
    if x[i] != y[i]:
        Y = y.replace(y[i], x[i]) 
        m+=1
print(m)    

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)      

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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)

a = list(input().split())
s = a[0]
t = a[1]

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

print(time)

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)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = input()
t - input()
def hamming_dist(str1,str2):
    ans = 0
    a,b = len(str1),len(str2)
    if a > b:
        ans = a - b
        length = b
    elif a < b:
        ans = b - a
        length = a
    else:
        length = a
    for i in range(length):
        if str1[i] != str2[i]:
            ans += 1
    return ans
print(hamming_dist(s,t))

s = input()
t = input()
def hamming_dist(str1,str2):
    ans = 0
    a,b = len(str1),len(str2)
    if a > b:
        ans = a - b
        length = b
    elif a < b:
        ans = b - a
        length = a
    else:
        length = a
    for i in range(length):
        if str1[i] != str2[i]:
            ans += 1
    return ans
print(hamming_dist(s,t))

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s = input()
t = input()
count = 0
for k in range(a):
  if s[k] != t[k]:
    count += 1
    
print(count)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
count = 0
for i in range(len(S)):
  if S[i] != T[i]:
    count++
print(count)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a = list(input())
b = list(input())
n = 0
for c, d in zip(a, b):
  if c != d:
    count += 1

a = list(input())
b = list(input())
n = 0
for c, d in zip(a, b):
  if c != d:
    n += 1
print(n)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a = input()
b = input()

cnt = 0

i=0

while(i<len(a)):
  if(a[i]!=b[i]):
    cnt+=1
  cnt+=1

print(cnt)

a = input()
b = input()

cnt = 0

i=0

while(i<len(a)):
    if(a[i]!=b[i]):
      cnt+=1
    i+=1

print(cnt)

Verdicts: Time Limit Exceeded

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S=input()
T=input()

count=0

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

S=input()
T=input()

count=0

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


Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
from sys import stdin
s=stdin.readline()
t=sdtin.readline()
count=0
for i in range(len(s)):
  if s[i]!=t[i]:
    count+=1
print(count)    

from sys import stdin
s=stdin.readline()
t=stdin.readline()
count=0
for i in range(len(s)):
  if s[i]!=t[i]:
    count+=1
print(count)    

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
count = 0
if S == T:
    print(count)
    exit(0)

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

S = input()
T = input()
count = 0


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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

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

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

Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a= int(input())
print(a+a**2+a**3)

S = str(input())
T = str(input())
length =len(S)
listS=list(S)
listT=list(T)
num = len(T)
res = 0
for i in range(length):
    if (listS[num-1] != listT[num-1]):
        res +=1
    num -=1
print(res)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()
T = map(int,imput().split())
cnt = 0
for x,y in  S,T:
	if x!=y:
		cnt += 1

print(cnt)

S = input()
T = input()
cnt = 0
for x,y in  S,T:
	if x!=y:
		cnt += 1

print(cnt)

S = input()
T = input()
slen = len(S)

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

print(cnt)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
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)


S=list(input())
T=list(input())
b=0


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

print(b)


Verdicts: Wrong Answer

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S=input()
T=input()
differnce=0
for i in range(len(S)):
  if S[i]!=T[i]:
      difference+=1
print(difference)

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

S=input()
T=input()

differnce=0

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

print(difference)




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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S, T = input().split()

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

print(count)

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

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):

import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))


s = input().rstrip()
t = intput().rstrip()
result = 0
for i in range(len(s)):
    if s[i] != t[i]:
        result += 1
        
print(result)


import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))


s = input().rstrip()
t = input().rstrip()
result = 0
for i in range(len(s)):
    if s[i] != t[i]:
        result += 1
        
print(result)

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=input()
t=input()
print(sum([1 for index,char in enumerate(s) if p[index]!=char])) 
  

s=input()
t=input()
print(sum([1 for index,char in enumerate(s) if t[index]!=char])) 
 

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
a, b = input().split()
count = 0
for i in range(len(a)):
  if (a[i]!= b[i]):
    count += 1
print(count)

a, b = input().split()
count = 0
for i in range(len(a)):
  if (a[i]!= b[i]):
    count += 1
print(count)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
S = input()
T = input()

print(sum(s != t for s, t zip(S, T)))

S = input()
T = input()

print(sum(s != t for s, t in zip(S, T)))

Verdicts: Runtime Error

Accepted
Problem: Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.

Submission attempts (in order):
s=str(input())
t=str(input())
length=len(s)
count=0
for i in range(s):
	if s[i]==t[i]:
		pass
	else:
		count+=1
print(count)

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

Verdicts: Runtime Error

Accepted