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

Submission status: Accepted

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

Submission status: Accepted

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

str_len = len(s)

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()
    S = input()
    T = input()
    count = 0
    for s,t in zip(S,T):
        if s != t:
            count += 1
    print(count)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
count = 0
for i in range(len(S)):
    if(S[i] != T[i]):
        T[i] = S[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:
S = input()
T = input()

count = 0
for idx, s in enumerate(S):
    count += 1 if s != T[idx] else 0
print(count)

Submission status: Accepted

Solution code:
def _main(s, t):
    if s == t:
        print(0)
        return
    change = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            change += 1
    print(change)


if __name__ == "__main__":
    S = str(input())
    T = str(input())
    _main(S, T)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit
#import copy
#import numpy as np
#from collections import deque


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

Submission status: Accepted

Solution code:
"""everything has a cost!"""

from math import *
import random, functools, collections, sys

__author__ = 'p7x'


# sys.stdin = open('in.txt', 'r')
# sys.stdout = open('out.txt', 'w')
# sys.stderr = open('err.txt', 'w')


if __name__ == '__main__':
    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 s,t in zip(S,T):
    if s!=t:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:

def main():
    S = input()
    T = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
t = 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()
s_l = list(s)#文字列をリストに
t_l = list(t)
ans=0

for i in  range(len(s_l)):
    if not s_l[i]==t_l[i]:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 main():
    s = input()
    t = input()

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

    print(ans)
main()

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

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

for n in range(0,N):
  if S[n] != T[n]:
    ans+=1
      
      
print(ans)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
s,t=input(),input()
r=0
for c,d in zip(s,t):
	r+=c!=d
print(r)

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:
n=input()
p=input()
x=0
for i in range(len(n)):
  if n[i]!=p[i]:
    x+=1
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

L= len(S)

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

Submission status: Accepted

Solution code:

def resolve():
    S = input()
    T = input()
    ans = 0
    for s, t in zip(S, T):
        if s != t:
            ans += 1
    print(ans)
    
if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

for i, j in zip(s, t):
  if i != j:
    cnt += 1
    
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: UTF-8

S = input()
T = input()

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

print(res)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
count = 0
s = str(input())
t = str(input())
for i in range(len(s)):
    if not s[i]== t[i]:
        count +=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
t = list(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 not s[i]==t[i]:
        cnt+=1
print(cnt)

Submission status: Accepted

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

tmp = 0
for i, j in zip(S,T):
    if i == j:
        tmp += 1

print(len(S) - tmp)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import numpy as np

S = np.array(list(input()))
T = np.array(list(input()))

print(np.count_nonzero(S != T))

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import 
s=input()
t=input()
#=int(input())
#=map(str,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
# sys.stdin=open('input.txt','r')
# sys.stdout=open('output.txt','w')
from sys import stdin,stdout
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=1000000007
s=is1()
ss=is1()
n=len(s)
count=0
for i in range(n):
    if s[i]!=ss[i]:
        count+=1
print(count)

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
def main(s, t):
    r = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            r += 1
    return r

if __name__ == "__main__":
    s = input()
    t = input()
    print(main(s, t))

Submission status: Accepted

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

leng = len(s)
count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


s = input()
t = input()

r = 0

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

print(r)

Submission status: Accepted

Solution code:


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,T = open(0).read().split()
s = list(S)
t = list(T)
ans = 0
for a, b in zip(s, t):
    if a != b:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = len(S)
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)

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

Submission status: Accepted

Solution code:
s=input()
t=input()
count=0
for ss,tt in zip(s,t):
    if ss==tt:
        continue
    count+=1
print(count)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

t = str(input())

a = 0
n = len(s)

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


print(a)

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:
A=input()
B=input()
C=0
for i in range(len(A)):
  if A[i] != B[i]:
    C+=1
print(C)

Submission status: Accepted

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

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

print(answer)

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

l = len(S)

r = 0

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

print(r)

Submission status: Accepted

Solution code:
#coding:utf-8

S = str(input())
T = str(input())

count = 0

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

print("{}".format(count))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    s = list(input())
    t = list(input())
    cnt = 0
    for idx, i in enumerate(s):
        if i != t[idx]:
            cnt += 1
    print(cnt)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = [s for s in input()]
T = [t for t in input()]

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

Submission status: Accepted

Solution code:
import os

str = input()
str2 = input()

count = 0

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

print(count)

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

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    S = list(input())
    T = list(input())
    count = 0
    for i, s in enumerate(S):
        if T[i] != s:
            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()
cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
c = 0
for i in range(len(a)):
  #print(i)
  if a[i] != b[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(int(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()
cnt = 0
for i in range(len(S)):
    if S[i] == T[i] :
        cnt += 0
    elif S[i] != T[i] :
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
a = input()
b = input()
c = 0
for i in range(len(a)):
    if a[i] != b[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()
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()
counter = 0
for i, j in enumerate(s):
    if j != t[i]:
        counter += 1
print(counter)

Submission status: Accepted

Solution code:
s = input()
t = input()
count = 0
for c1, c2 in zip(s, t):
    if c1 != c2:
        count+=1
print(count)

Submission status: Accepted

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

ans = 0

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a_list = list(input())
b_list = list(input())
cnt = 0

for a,b in zip(a_list,b_list):
    if a == b:
        continue
    else:
        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(len(s)-cnt)

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
count = 0
for i in range(len(s1)):
  if s1[i] != s2[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]:
        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:
from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()

count = 0

for idx in range(len(s)):
    if s[idx] != t[idx]:
        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]:
        count += 1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
from collections import Counter

# N = int(input()) # 1行, 単数
# arg = list(map(int, input().split())) # 1行, 配列
# D = Counter(arg) # 出現数カウント

# print('Yes')
# print('No')
# print()

# while True:
  # try:
    # listA=list(map(int,input().split()))
    # listA.append(list(map(int,input().split())))
  # except:
    # break;

S = list(input()) # 1行, 単数
T = list(input()) # 1行, 単数
cnt = 0

for i, s in enumerate(S):
  if S[i] != T[i]:
    cnt = cnt + 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
T = list(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 = str(input())
t = str(input())
n = len(s)

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

print(cnt)

Submission status: Accepted

Solution code:
import sys, io, os, re
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor, ceil
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby
from heapq import heapify, heappush, heappop

# sys.setrecursionlimit(5000)

n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n, d=0): return [d] * n
def array2(n, m, d=0): return [[d] * m for x in range(n)]
def array3(n, m, l, d=0): return [[[d] * l for y in xrange(m)] for x in xrange(n)]
def linc(A, d=1): return map(lambda x: x + d, A)
def ldec(A, d=1): return map(lambda x: x - d, A)

S = s1()
T = s1()

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t = [input()for _ in range(2)]

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

Submission status: Accepted

Solution code:
str_1 = input()
str_2 = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans=0

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
S =input().strip()
T =input().strip()
count =0
for i in range(len(S)):
    if S[i] ==T[i]:
        continue
    else:
        count +=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
import sys

import math
import itertools

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

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

Submission status: Accepted

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

result = 0

for i in range(len(S)):
  if S[i] != 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:
#-*- using:utf-8 -*-

s = input()
t = input()
cnt = 0
for c1,c2 in zip(s, t):
    if c1 != c2:
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

count = 0
for c1, c2 in zip(s,t):
    if c1 is not c2: count += 1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

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 s, s1 in zip(S, T):
    if s != s1:
        cnt = 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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	B
# CreatedDate:  2020-06-27 20:55:12 +0900
# LastModified: 2020-06-27 21:04:43 +0900
#


import os
import sys
# import numpy as np
# import pandas as pd


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


if __name__ == "__main__":
    main()

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

total = 0

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

print(total)

Submission status: Accepted

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

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


print(count)

Submission status: Accepted

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

cntSame = 0
l = len(s)
for idx in range(l):
    if s[idx] == t[idx]:
        cntSame += 1

ans = l - cntSame
print(ans)

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
ans=0
for c in range(len(s)):
    if s[c]==t[c]:
        ans+=1
print(len(s)-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()

N=len(S)

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)

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

    return

if __name__ == '__main__':
    main()

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:

def main():
    s = input()
    t = input()

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

    print([s[i] == t[i] for i in range(len(s))].count(False))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

result = 0
for s, t in zip(S, T):
    result += s != t
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:
if __name__ == '__main__':
    S = input().strip()
    T = input().strip()

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

    print(count)

Submission status: Accepted

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

print(sum)