Problem:


Score : 200 points

Problem Statement

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.

Constraints

S and T have lengths between 1 and 2\times 10^5 (inclusive).

S and T consists of lowercase English letters.

S and T have equal lengths.

Input

Input is given from Standard Input in the following format:

S
T

Output

Print the answer.

Sample Input 1

cupofcoffee
cupofhottea

Sample Output 1

4

We can achieve the objective in four operations, such as the following:

First, replace the sixth character c with h.

Second, replace the eighth character f with t.

Third, replace the ninth character f with t.

Fourth, replace the eleventh character e with a.

Sample Input 2

abcde
bcdea

Sample Output 2

5

Sample Input 3

apple
apple

Sample Output 3

0

No operations may be needed to achieve the objective.



Sample input:
cupofcoffee
cupofhottea


Sample output:
4

Submission status: Wrong Answer

Solution code:
def levenshtein(s1, s2):
    """
    >>> levenshtein('kitten', 'sitting')
    3
    >>> levenshtein('あいうえお', 'あいうえお')
    0
    >>> levenshtein('あいうえお', 'かきくけこ')
    5
    """
    n, m = len(s1), len(s2)

    dp = [[0] * (m + 1) for _ in range(n + 1)]

    for i in range(n + 1):
        dp[i][0] = i

    for j in range(m + 1):
        dp[0][j] = j

    for i in range(1, n + 1):
        for j in range(1, m + 1):
            cost = 0 if s1[i - 1] == s2[j - 1] else 1
            dp[i][j] = min(dp[i - 1][j] + 1,         # insertion
                           dp[i][j - 1] + 1,         # deletion
                           dp[i - 1][j - 1] + cost)  # replacement

    return dp[n][m]

s1 = input()
s2 = input()
print(levenshtein(s1,s2))

Submission status: Wrong Answer

Solution code:
S = 'cupofcoffee'
T = 'cupofhottea'

counter = 0

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

print(counter)

Submission status: Wrong Answer

Solution code:
S = list(input())
T = list(input())
count = 0
for s,t in zip(S,T):
    if s != t:
        count += 1

Submission status: Wrong Answer

Solution code:
S = input()
T = input()
sum(S[i] != T[i] for i in range(len(S)))

Submission status: Wrong Answer

Solution code:
s = input()
t = input()

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

Submission status: Wrong Answer

Solution code:
S = input()
T = input()
count = 0
for s, t in zip(S, T):
    if s != t:
        count += 1

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

Submission status: Wrong Answer

Solution code:
S = input()
T = input()

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

print(ans)

Submission status: Wrong Answer

Solution code:
import os

str = input()
str2 = input()

count = 0

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

print(count)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
S = input()
T = input()

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

Submission status: Wrong Answer

Solution code:
a = input().split()
b = input().split()

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

Submission status: Wrong Answer

Solution code:
s = input()
t = input()
ans = 0
for S, T in zip(s, t):
  if S == T:
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()

count = 0

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

Submission status: Time Limit Exceeded

Solution code:
S,T = input(), input()
operation = 0
for i in range(len(S)):
   if S[i]!=T[i]:
        S.replace(S[i],T[i])
        operation+=1    
print(operation)

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
operation = 0
if len(S) == len(T):
    for i in range(len(S)):
        if S[i]!=T[i]:
            S.replace(S[i],T[i])
            operation+=1
    
print(operation)

Submission status: Time Limit Exceeded

Solution code:
a=input()
b=input()
i=0
good=0
while(i<len(a)):
    if(a[i]!=b[i]):
        good+=1
print(good)

Submission status: Time Limit Exceeded

Solution code:
S = list(input())
T = list(input())
i = 0
counter = 0

if S == T:
  print(counter)
  exit()
  
while i <= len(S) - 1:
  if T[i] != S[i]:
    S[i] = T[i]
    counter += 1
    if S == T:
      break
  i += 1
  
print(counter)

Submission status: Time Limit Exceeded

Solution code:
s = input()
t = input()
count = 0
sList = list(s)
tList = list(t)

for i in range(len(sList)):
    if sList == tList:
        break
    if sList[i] != tList[i]:
        sList[i] = tList[i]
        count = count + 1

print(count)

Submission status: Time Limit Exceeded

Solution code:
s = input()
t = input()
count = 0
sList = list(s)
tList = list(t)

for i in range(len(sList)):
    if sList == tList:
        break
    if sList[i] != tList[i]:
        sList[i] = tList[i]
        count = count + 1

print(count)

Submission status: Time Limit Exceeded

Solution code:
s = input()
t = input()
s1 = len(s)
count = 0
for i in range(s1):
    if(s[i] != t[i]):
        s.replace(s[i],t[i])
        count += 1
print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
s = input()
t = input()
a = 1
b = 1
c = 0
while a <= len(s):
    for n in s:
        for m in t:
            if a == b and n == m:
                c += 1
            b += 1
        a += 1
        b = 1
print(len(s) - c)

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
nun = 0
num = len(S)
if S != T:
    for i in range(0,num):
        if S[i] != T[i]:
            S.replace(S[i],T[i])
            nun += 1
    else:
        print(str(nun))
else:
    print("0")

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
nun = 0
num = len(S)
if S != T:
    for i in range(0,num):
        if S[i] != T[i]:
            S.replace(S[i],T[i])
            nun += 1
        elif S[i] == T[i]:
            continue
    else:
        print(str(nun))
else:
    print("0")

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
nun = 0
num = len(S)
if S != T:
    for i in range(0,num):
        if S[i] != T[i]:
            S.replace(S[i],T[i])
            nun += 1
            if S[i] == T[i]:
                continue
    else:
        print(str(nun))
else:
    print("0")

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
# print(list(S))
# print(list(T))
# 文字の長さ
# print(len(S))
# 配列で１つずつ確認する 同じでない場合＋１
ans = 0
for i in range(len(S)):
  # print(list(S)[i])
  # print(list(T)[i])
  if list(S)[i] != list(T)[i]:
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import math

S=input()
T=input()


ans = 0
l=len(S)

if S ==T:
    print(0)
else:
    for a in range(l): 
          if S[a] != T[a]:
              S.replace(S[a], T[a])
              ans += 1
          
    print(ans)

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
nun = 0
num = len(T)
if S != T:
    for i in range(0,num):
        if S[i] != T[i]:
            S.replace(S[i],T[i])
            nun += 1
    else:
        print(str(nun))
else:
    print("0")

Submission status: Time Limit Exceeded

Solution code:
S=input()
T=input()


ans = 0
l=len(S)


for a in range(l): 
      if S[a] != T[a]:
          S.replace(S[a], T[a])
          ans += 1
          
print(ans)

Submission status: Time Limit Exceeded

Solution code:
s=input()
t=input()
ct=0
for i in range(0,len(s)):
    if(s[i]!=t[i]):
            s=s.replace("t[i]","i")
            ct=ct+1
print(ct)

Submission status: Time Limit Exceeded

Solution code:
s = input()
t = input()
ans = 0

for i in range(200001):
  if s[i] != t[i]:
    s.replace('s[i]','t[i]')
    ans += 1
    if i+1 == len(s):
      break
      
  elif s == t:
    break
    
print(ans)

Submission status: Time Limit Exceeded

Solution code:
S = input()
T = input()
# 配列で１つずつ確認する 同じでない場合＋１
ans = 0
for i in range(len(S)):
  if list(S)[i] != list(T)[i]:
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
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)

Submission status: Time Limit Exceeded

Solution code:
s = str(input())
t = str(input())

ls = list(s)
lt = list(t)

ans = 0
while True:
  rep_cnt = 0
  j = 0
  for i in range(j, len(ls)):
    j += 1
    if ls[i] != lt[i]:
      ls[i] = lt[i]
      rep_cnt += 1
      break
  if rep_cnt > 0:
    ans += rep_cnt
  else:
    break

print(str(ans))

Submission status: Time Limit Exceeded

Solution code:
s = input()
t = input()

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

print(ans)

Submission status: Time Limit Exceeded

Solution code:
import sys
#入力S
S = input()

#入力T
T = input()
ran_T = range(len(T))
#print(len(T))
#print(range(len(T)))
count = 0

for i in ran_T:
    if list(S)[i] != list(T)[i]:
        count += 1

print(count)

Submission status: Time Limit Exceeded

Solution code:
a = input()
b = input()

cnt = 0

i=0

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

print(cnt)

Submission status: Time Limit Exceeded

Solution code:
s = str(input())
t = str(input())

ls = list(s)
lt = list(t)

ans = 0
while True:
  rep_cnt = 0
  for i in range(0, len(ls)):
    if ls[i] != lt[i]:
      ls[i] = lt[i]
      rep_cnt += 1
      break
  if rep_cnt > 0:
    ans += rep_cnt
  else:
    break

print(str(ans))

Submission status: Time Limit Exceeded

Solution code:
def main():

	nbOperation = 0

	sentenceS = input()
	sentenceToT = input()

	for i in range(len(sentenceS)):
		if sentenceS[i] != sentenceToT[i]:
			convertisseur = list(sentenceS)
			convertisseur[i] = sentenceToT[i]
			nbOperation += 1
			sentenceS = "".join(convertisseur)

	print(nbOperation)

main()

Submission status: Time Limit Exceeded

Solution code:
s=input()
t=input()
l=len(s)
count=0
for i in range(l):
  if(s[i]==t[i]):
    continue
  else:
    s.replace(s[i],t[i])
    count+=1

print(count)

Submission status: Time Limit Exceeded

Solution code:
nbOperation = 0

sentenceS = input()
sentenceToT = input()

for i in range(len(sentenceS)):
	if sentenceS[i] != sentenceToT[i]:
		convertisseur = list(sentenceS)
		convertisseur[i] = sentenceToT[i]
		nbOperation += 1
		sentenceS = "".join(convertisseur)

print(nbOperation)

Submission status: Accepted

Solution code:
s = input()
t = input()

count = 0
for ss, tt in zip(s, t):
  if ss != tt:
    count += 1

print(count)

Submission status: Accepted

Solution code:
S=input()
T=input()

count=0

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

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
o=0
for (i,j) in zip(s,t):
    if i!=j:
        o+=1
print(o)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()

D = 0

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

print(D)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
score = 0
le = len(s)

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

print(score)

Submission status: Accepted

Solution code:
S = input()
T = input()

l = len(S)
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str1 = input()
str2 = input()

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
assert len(S) == len(T)
print(len([(s,t) for s,t in zip(S,T) if s != t]))

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = 0
for s, t in zip(S, T):
  if s != t: ans += 1;
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from sys import stdin
# input = stdin.readline


def solve():
    s = input()
    t = input()
    res = 0
    for a,b in zip(s,t):
        if a != b:
            res += 1
    print(res)







if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
c = 0

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

print(c)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())

ans = 0
for p, q in zip(a, b):
    if p != q:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
def main():
    s = input()
    t = input()
    ans = 0
    
    for i, j in zip(s, t):
        if i != j:
            ans += 1
    print(ans)
        
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())


result = 0

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque

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

print(count)

Submission status: Accepted

Solution code:
s=input()
t=input()
count=0
for i in range(0,len(s)):
    if(s[i]==t[i]):
        continue
    else:
        count+=1
print(count)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Sep 18 19:19:52 2020

@author: ezwry
"""

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

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#                               #
    # author : samars_diary #
    # 17-09-2020 │ 20:30:32 #
#                               #

import sys, os.path

#if(os.path.exists('input.txt')):
    #sys.stdin = open('input.txt',"r")
    #sys.stdout = open('output.txt',"w")

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write

def solve():
    a=li();b=li();c=0
    for i in range(len(a)):
        if a[i]!=b[i]:
            c+=1
    print(c)
for _ in range(1):
    solve()

Submission status: Accepted

Solution code:
s = list(map(str, input()))
t = list(map(str, input()))

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())

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

Submission status: Accepted

Solution code:
s = input()
t = input()

count = 0
for i,j in enumerate(s):
  if j != t[i]:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
n = list(input())
n1 = list(input())

i = 0
cou = 0
while i != len(n):
    if n[i] != n1[i]:
        cou += 1
    i += 1

print(cou)

Submission status: Accepted

Solution code:
#B問題
ans = 0
#文字列は自動的に配列扱いにできる(ex S=coffeeなら、S[2]=f という風に一文字ずつ参照可能)
S = input()
T = input()
for i in range(len(S)):
    if S[i] != T[i]:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()

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

print(ans)

Submission status: Accepted

Solution code:
S=input()
T=input()
print(sum(S[i]!=T[i] for i in range(len(S))))

Submission status: Accepted

Solution code:
S = input()
T = input()

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

print(count)

Submission status: Accepted

Solution code:
A = str(input())
B = str(input())
c = 0
lenA = len(A)
for i in range(lenA):
    if A[i] != B[i]:
        c += 1
print(c)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
cnt = 0

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
S=input()
T=input()
cnt=0
for idx in range(len(S)):
  if S[idx]==T[idx]:
    cnt=cnt
  else:
    cnt=cnt+1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()

cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
s_l = list(input())
t_l = list(input())

count_difference = 0
for s, t in zip(s_l, t_l):
    if s != t:
        count_difference += 1

print(count_difference)

Submission status: Accepted

Solution code:
s = input()
t = input()

count = 0
length = len(s)
for index in range(length):
  if not s[index] == t[index]:
    count += 1

print(count)

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
cnt = 0
for s,t in zip(S,T):
  if s != t:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = input()
t = input()
n = len(s)
ans = n
for i in range(n):
  if s[i] == t[i]:
    ans -= 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()

result = 0
for i, c in enumerate(s):
  if c != t[i]:
    result += 1
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()

n = len(s)
a = 0

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

print(a)

Submission status: Accepted

Solution code:
s = input()
t = input()
c = 0

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

print(c)

Submission status: Accepted

Solution code:
S = input()
T = input()

result = 0
for i, s_c in enumerate(S):
    if s_c != T[i]:
        result += 1

print(result)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = 0

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

print(ans)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
s=input()
t=input()
i=len(s)-1
counter=0
while i>=0:
    if s[i]!=t[i]:
        counter+=1
    i=i-1
print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
T=input()

ans = 0

for c1,c2 in zip(S,T):
    if c1 != c2:
        ans +=1

print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = 0

for i,y in zip(S,T):
    if i != y:
       ans += 1 

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(S, T):
    N = len(S)
    ans = 0
    for i in range(N//2):
        if S[i] != T[i]:
            ans += 1
        if S[-1-i] != T[-1-i]:
            ans += 1
    if N%2 == 1:
        if S[N//2] != T[N//2]:
            ans += 1
    return ans

if __name__ == '__main__':
    S = input()
    T = input()
    ans = main(S, T)
    print(ans)

Submission status: Accepted

Solution code:
def main(S, T):
    ans = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            ans += 1
    return ans

if __name__ == '__main__':
    S = input()
    T = input()
    ans = main(S, T)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()

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

print(str(count))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(str(input()))
T = list(str(input()))
tt = 0
cnt = 0

for i in S:
    if i != T[tt]:
        cnt += 1
    tt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
c = 0

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

print(c)

Submission status: Accepted

Solution code:
s = input()
t = input()

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

print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=[i for i in input()]
T=[j for j in input()]

count=0
for a,b in zip(S,T):
  if a!=b:
    count+=1
print(count)

Submission status: Accepted

Solution code:
S = list(map(str, input()))
T = list(map(str, input()))

count = 0

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

print(count)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
t=input()

cnt=0

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

print(cnt)

Submission status: Accepted

Solution code:
S=str(input())
T=str(input())
c=len(S)
for i in range(len(S)):
    if S[i]==T[i]: c=c-1

print(c)

Submission status: Accepted

Solution code:
s = input()
t = input()

count = 0

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

Submission status: Accepted

Solution code:
In = str(input())
Out = str(input())
cnt = 0
for i in range(len(In)):
  if In[i] != Out[i]:
    cnt += 1
    
    
print(cnt)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
num = len(a)
S = 0

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

Submission status: Accepted

Solution code:
S=input()
T=input()
count=0
for j in range(0,len(T)):
    if S[j]==T[j]:
        count+=1   
print(len(T)-count)

Submission status: Accepted

Solution code:
# 172 B
S = input()
T = input()
ans = 0
for i in range(0, len(S)):
    if S[i] != T[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
print(sum(x!=y for x,y in zip(input(),input())))

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for u, v in zip(S, T):
    if u != v:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a = input()
b = input()

res = 0

for i, char in enumerate(a):
  if char != b[i]:
    res += 1

print(res)

Submission status: Accepted

Solution code:
S = input()
T = input()

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

print(cnt)

Submission status: Accepted

Solution code:
S = input()
T = input()

length = len(S)
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
s, t = [input() for i in range(2)]
i = 0
for a, b in zip(s, t):
  if a != b:
    i += 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
s=input()

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

print(cnt)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc172/tasks/abc172_b

S = list(input())
T = list(input())
length = len(S)

ans = 0

for i in range(length):

    if S[i] != T[i]:
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    S = input()
    T = input()
    cnt = 0
    for i in range(len(S)):
        s = S[i]
        t = T[i]
        if s != t:
            cnt += 1
    print(cnt)
resolve()

Submission status: Accepted

Solution code:
# B - Minor Change

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s = input()
    t = input()
    cunt=0
    for i, ss in enumerate(s):
        if ss != t[i]:
            cunt+=1
    print(cunt)

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
t = input()

ans = 0

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


print(ans)

Submission status: Accepted

Solution code:
first_string = input()
second_string = input()
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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