TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given an integer a as input, print the value a + a^2 + a^3.

Submission attempts (in order):
from collections import deque
from decimal import *
n,m,k = [Decimal(int(e)) for e in input().split()]
As = deque([Decimal(int(e)) for e in input().split()])
Bs = deque([Decimal(int(e)) for e in input().split()])
result = 0
while True:
    if (not As) and (not Bs):
        break
        
    if (not As) and (Bs[0]>k):
        break
    if (not As) and (Bs[0]<=k):
        k = k-Bs.popleft()
        result = result + 1
        continue
        
    if (not Bs) and (As[0]>k):
        break
    if (not Bs) and (As[0]<=k):
        k = k-As.popleft()
        result = result + 1
        continue
    
    
    if As[0]+As[1] <= Bs[0]+Bs[1]:
        min_reduce = As.popleft()
    else:
        min_reduce = Bs.popleft()

    if min_reduce > k:
        break
    else:
        k = k-min_reduce
        result = result + 1
print(result)

a = int(input())
print(a+a**2+a**3)

Verdicts: Runtime Error

Accepted
Problem: Given an integer a as input, print the value a + a^2 + a^3.

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

a = int(input())
ans = a + a*a + a*a*a
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):
ソースコード 

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

S = input()
T = input()
count = 0
if S == T:
  print(0)
else:
  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, t = input().split()
x = zip(s, t)
y = []
for i, j in x:
    if i == j:
        y.append('')
    else:
        y.append('@')
print(y.count('@'))

a = input()
b = input()
u=zip(a,b)
x=[]
for i,j in u: 
    if i==j:
        x.append("") 
    else: 
        x.append("*")
print (x.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 = 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)


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)


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=input()
b=input()

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

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

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(inut())
c=0

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

print(c)

s,t = map(input().split())
c=0

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

print(c)

s,t = map(input())
c=0

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

print(c)

s = input()
t =input()
c=0

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

print(c)

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):
a=o
S=list(input())
T=list(input())
for i in range(len(S)): 
	if S[i]！=T[i]:	
		a=a+1
print(a)

a=o
S=list(input())
T=list(input())
for i in range(len(S)): 
  if S[i]！=T[i]:	
      a=a+1
print(a)
  


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

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

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()
t = input()

x = len(s)

num = 0
for i in range(0, x):
    if s[i] == t[i]:
        num += 1

print(num)

s = input()
t = input()

x = len(s)

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

print(num)

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):
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

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)

L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

L = list(input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

rows = int(input())
L = [input() for i in range(rows)]

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

L = map(str, input())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

s = input()
S = list(S)
T = list(input())
N = len(s)
i = 1

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

L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
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)

L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

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)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Runtime Error

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):
a1 = input()
a2 = input()
t = 0

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

a1 = input()
a2 = input()
t = 0

for i in range(len(a1)):
  if a1[i] != a2[i]:
    t += 1
    
print(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()
cnt = 0

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

print(cnt)

S = input()
T = input()

ans = 0

for s, t in zip(S, T):
    ans += s != t
else:
	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 = list(input())
s2 = list(input())
ans = 0
for i in range(s1):
  if s1[i] =! s2[i]:
    ans+=1
print(ans)    

s1 = list(input())
s2 = list(input())
ans = 0
for i in range(len(s1)):
  if s1[i] != s2[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):
a=input()
b=input()
ans=0
for i,j in a,b:
  if i != j:
    ans+=1
print(ans)

a=input()
b=input()
ans=0
for i,j in zip(a,b):
  if i != j:
    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):
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter

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

from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter

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


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

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

print(a)



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)


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):
count = 0
a = input()
b = input()

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

print(count)

count = 0
a = input()
b = input()

for i in range(len(a)):
    if a[i]!=b[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 = 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: 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):
def solve(string):
    s, t = string.split()
    return str(len(s) - sum(_s == _t for _s, _t in zip(s, t))                                                               pass


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))


def solve(string):
    s, t = string.split()
    return str(len(s) - sum(_s == _t for _s, _t in zip(s, t)))


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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):
line1 = input()
line2 = input()
ans = 0
for i in range(len(line1)):
  if line1[i] == line2[i]:
    ans += 1
print(ans)

line1 = input()
line2 = input()
ans = 0
for i in range(len(line1)):
  if line1[i] != line2[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=intput()
ss=intput()
for i range(len(s)):
  if(s[i]!=ss[i]):
    c+=1
print(c)

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

s=intput()
ss=intput()
c=0
for i in range(len(s)):
  if(s[i]!=ss[i]):
    c+=1
print(c)

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


Verdicts: Runtime Error

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

s = list(S[:])
t = list(T[:])

j=0

for i in range(len(S)):
    if s[i] == t[i]:
        j = j+0
    else:
        index = t.index(s[i])
        t[i],t[index] = t[index],t[i]
        j = j+1

print(j)
print(s,t)

S = input()
T = input()

s = list(S[:])
t = list(T[:])

j=0

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

print(j)


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()
n = 0
for i in s:
  for j in t:
    if i != j:
      i = j
      n += 1
return n

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):
a=input()
b=input()

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

print(answer)

a=input()
b=input()

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

print(answer)

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=list(input())
t=list(input())
for i, _s in enumerate(s):
    if s == t:
        break
    else:
        if _s != t[i]:
            s[i] = t[i]
        else:
            continue

print(i)

s=list(input())
t=list(input())
ans = 0
for i, _s in enumerate(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()

for i in range(len(S)):
	print(S[i])

S = input()
T = input()

cout = 0
for i in range(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: 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()

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

s=input()
t=input()
ans=0
for i in range(len(s)):
    ans+=(s[i]!=t[i])
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):
str1 = input()
str2 = input()

i = 0
for _ in str1:
  if _ not in str2:
    i += 1
print(i)

str1 = input()
str2 = input()

idx = 0
cnt = 0
for _ in range(len(str1)):
    if str1[idx] != str2[idx]:
        cnt += 1
    idx += 1

print(cnt)

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

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

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

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

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
i = 0
while i < len(s):
	if s[i] == t[i]:
		ans += 1

print(ans)

s = input()
t = input()

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

print(ans)

s = input()
t = input()

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

print(ans)

Verdicts: Time Limit Exceeded

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()
num = 0
for s,t in zip(S,T):
    if s != t:
        num +=1


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

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)):
  ans += 1 if s[i] == t[i] else 0
print(ans)

s = input()
t = input()
ans = 0
for i in range(len(s)):
  ans += 1 if s[i] != t[i] else 0
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=string(input())
T=string(input())
num = 0
for i in len(S):
  if S[i] != T[i]:
    num= num+1
print(num)

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

a=list(input())
b=list(input())
count=0
for str_i in range (len(a)):
  if a[str_i] != b[str_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()
aa = 0
for i in range(length(S)):
  if S[i] != T[i]:
    aa += 1
print(aa)
  


S = input()
T = input()
aa = 0
for i in range(len(S)):
  if S[i] != T[i]:
    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 = 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 =input()
T = input()
count = 0
for i in range(0,len(S)):
    if S[i] != T[i]:
        count=count+1


S =input()
T = input()
count = 0
for i in range(0,len(S)):
    if S[i] != T[i]:
        count=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())
cnt=0
for i,e in zip(s,t):
  print(i,e)
  if i != e:
    cnt+=1
print(cnt)

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

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 = str(input())
T = str(input())
n = 0

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

print(n)

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

for i in range(len(S)):
  if S[i] != T[i]:
    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):
Answer = input()
input_retu = input()
count = 0
for i in range(len(Answer)):
    if Answer[i] == input_retu[i]:
        continue
    else:
        count += 1

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)

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

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


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 = input().split()
count = 0

for i in range(s):
  if s[i] != t[0]:
    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()

count = 0
 
for i in range(s):
  if s[i] != t[0]:
    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: 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):
cnt=0
for i in range(len(s)):
    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):
s = input()
t = input()
x = len(s)
z = 0
for i in range(x) :
  if s[i] == t[i] :
    z = z + 1
print(z)

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

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 = list(map(str,input().split()))
b = list(map(str,input().split()))
count = 0
for i in range(0,len(a)) :
  if a[i] != b[i] :
    count = count + 1

print(count)

a = str(input())
b = str(input())
count = 0
for i in range(0,len(a)) :
  if a[i] != b[i] :
    count = 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()

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

print(count)

s=input()
t=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):
print(sum([s != t for s, t in zip(input().split())]))

print(sum([s != t for s, t 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().strip()
T = input().strip()

count = 0
for s in S:
  for t in T:
    if s != t: count += 1
print(count)

S = input().strip()
T = input().strip()
 
c = 0
 
for s,t in zip(S,T):
  if s != t:
    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):
=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):
m=input()
n=input()
count=0;
for i in range(len(m))
    if m[i]!=n[i] :
         count+=1
print(count)

m=input()
n=input()
count=0;
for i in range(len(m))
    if m!=n :
         count+=1
print(count)

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

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

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()
t = input()
n = len(s)
s.split()
t.split()
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
    else:
        pass
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()
cnt=0
for i in range(len(s)):
    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: 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()
a = [str(c) for c in s]
t = input()
b = [str(c) for c in s]

c = 0

for i in range(n):
  if a[i] == b[i]:
    c +=1

print(n-c)

s = input()
a = [str(c) for c in s]
t = input()
b = [str(c) for c in t]

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

print(n-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()
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(st)
# print(ts)
print(j)

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(st)
# print(ts)
print(j)

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())
for m in range(len(m)):
    if m >= 2*10**5:
        break
    elif s != t:
        print(s[m])


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):
# coding: utf-8

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)    

# coding: utf-8

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)    

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

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)

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 = str(input())
t = str(input())

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

s = str(input())
t = str(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):
#include<stdio.h>
#include<math.h>
int count;
int main(){
  char S[200005],T[200005];
  scanf("%c",S);
  scanf("%c",T);
  for (int i=0;S[i]!='\0';i++){
    if (S[i]!=T[i])
    count++;
  }
  printf("%d\n",count);
}


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

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

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


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()
T = input()
num = 0

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

print(num)

S = input()
T = input()
num = 0

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

print(num)


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):
ans=0
x,y=input().split()
for i in range(len(x)):
  if x[i] != y[i]:
    ans=ans+1
print(ans)

ans=0
x=input()
y=input()
for i in range(len(x)):
  if x[i] != y[i]:
    ans=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):
a = input()
b = input()

words_a = list(a)
words_b = list(b)

matched_list = []
for a in words_a:
  for b in words_b:
    if a==b:
      matched_list.append(a)

print(len(matched_list))

# a = input()
# b = input()




# matched_list = []
# for a in words_a:
#   for b in words_b:
#     if a!=b:
#       matched_list.append(a)

# print(len(matched_list))

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

while i<len(a[0]):
  if a[0][i]!=a[1][i]:
    count+=1
  i+=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):
A=input()
B=input()

ans=0
for a,b in zip(A,B):
    if a==b:
        ans+=1
print(ans)

A=input()
B=input()

ans=0
for a,b in zip(A,B):
    if a!=b:
        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 = list(input())
T = list(input())

ans = 0

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

print(ans)


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

ans = 0

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

print(ans)

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

ans = 0

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

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,t,count=input(),input(),0

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


s,t,count=input(),input(),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, T = input().split()
cnt = 0
for i in range(len(S)):
  if S[i] != T[i]:
    cnt += 1
print(i)

S, T = input().split()
cnt = 0
for i in range(len(S)):
  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

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 = 'abcde'
t = 'bcdea'
n = len(s)
cnt = 0
for i in range(n):
    if s[i] != t[i]:
        cnt += 1
print(cnt)


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


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 = str(input())
t = str(input())
count = 0

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

print(count)

s = str(input())
t = str(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()
print(sum(x!=y for x,y in zip(S,T))


S=input()
T=input()
print(sum(x!=y for x,y 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 = input().strip()
T = input().strip()
count = 0
for i in len(S):
  if S[i] == T[i]:
    count += 1
print(count)

S = input().strip()
T = input().strip()
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()

sl = list(s)
tl = list(t)

count = 0

for a, b in sl, tl:
  if a!=b:
    count++
    
print(count)

s = input()
t = input()

sl = list(s)
tl = list(t)

count = 0

for (a, b) in zip(sl, tl):
  if a!=b:
    count++
    
print(count)


s = input()
t = input()

sl = list(s)
tl = list(t)

count = 0

for (a, b) in zip(sl, tl):
  if a!=b:
    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()
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)

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)

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):
String s
String t
int x
int i = 0
s = input()
t = input()
for(i in range(len(s)))
  if(s[i] == t[i])
    x = x + 1
  i = i + 1
print(x)

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

String s
String t
int x
int i = 0
s = input()
t = input()
for i in range(len(s))
  if(s[i] == t[i])
    x = x + 1
  i = i + 1
print(x)

String s
String t
int x
int i = 0
s = input()
t = input()
for i in range(len(s))
  if(s[i] == t[i]):
    x = x + 1
  i = i + 1
print(x)

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

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

String s
String t
int x
int i = 0
s = input()
t = input()
for i in range(len(s))
  if s[i] == t[i]:
    x = x + 1
  i = i + 1
print(x)

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

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):
a=input()
b=input()
c=0
for i in range(len(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(len(a)-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):
a=int(input())

print(a+a**2+a**3)

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().split()
t = input().split()
j = 0
for i in range(len(s)):
  if not(s[i] == t[i]):
    j += 1
 
print(j)

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

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 = str(input())
t = str(input())
count = 0
for i range(len(s)):
  if s[i] == t[i]:
  	pass
  else:
    count += 1
print(count)

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

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

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

s=str(input())
t=str(input())
length=len(s)
count=0
for i in range(length):
	if s[i]==t[i]:
		pass
	else:
		count+=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()
a = 0
for i in range(len(s)):
  if s[i] == t[i]:
    a += 1
    
print(a)

s = input()
t = input()
a = 0
for i in range(len(s)):
  if not s[i] == t[i]:
    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 = input()
t = input()
ans=0,cnt=0
for check in s:
    if t[cnt] == check:
        cnt+=1
    else:
        ans+=1
        cnt+=1
print(ans)

s = input()
t = input()
ans=0
cnt=0
for check in s:
    if t[cnt] == check:
        cnt+=1
    else:
        ans+=1
        cnt+=1
print(ans)

Verdicts: Runtime Error

Accepted