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:
import itertools
import functools
import math
from collections import Counter
from itertools import combinations
import re


S = input()
T = input()

l = len(S)

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=input(),input()
ans=0
for i in range(len(s)):
    if s[i-1] == t[i-1]:
        pass
    else:
        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:
A = list(input()) 
B = list(input()) 

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

Submission status: Accepted

Solution code:
# B
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 = list(input())
T = list(input())
N = len(S)
count = 0
for i in range(0,N):
  if S[i] != T[i]:
    count = count + 1
  else:
    continue
print(count)

Submission status: Accepted

Solution code:
lista = list(input())
lista2 = list(input())
cont = 0
tam = len(lista)

for i in range(tam):
	if(lista[i] != lista2[i]):
		cont+=1

print(cont)

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:
l1 = input()
l2 = input()

res = 0

for i in range(len(l1)):
  if l1[i] != l2[i]:
      res+= 1

print(res)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = list(input())
T = list(input())
count = 0
for i, j in zip(S, T):
	if i == j:
		count = count + 0
	else:
		count = count + 1

print(count)

Submission status: Accepted

Solution code:
print(sum([s != t for s, t in zip(input(), input())]))

Submission status: Accepted

Solution code:
s = input()
t = input()
i = 0
cnt = 0
while i < len(s):
    #print(s[i])
    if s[i] != t[i]:
        cnt += 1
    i += 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()
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 = count + 1 
print(count)

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

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

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
import math

rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')

def main():
	S, T = rll()[0], rll()[0]
	ans = 0
	for a, b in zip(S, T):
		if a != b: ans += 1
	print(ans)
	stdout.close()

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

Submission status: Accepted

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

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

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

s1 = list(s)
t1 = list(t)

s2 = len(s1)
count = 0
for i in range(s2):
    if(s1[i] != t1[i]):
        s1[i] == t1[i]
        count += 1
        
print(count)

Submission status: Accepted

Solution code:
n = str(input())
m = str(input())
s=0
for i in range(len(n)):
    #print(n[i])
    #print(m[i])
    if n[i] != m[i]:
        s+=1
print(s)

Submission status: Accepted

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

count = 0
for s, t in zip(S, T):
    if s != t:
        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:
def main():
    S = input().strip()
    T = input().strip()
    result = solve(S, T)
    print(result)


def solve(S, T) -> int:
    count = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            count += 1
    return count


if __name__ == '__main__':
    main()

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
  else:
    S[i] = T[i]
    count += 1
print(count)

Submission status: Accepted

Solution code:
# abc172_b.py
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:
l1 = []
l2 = []

S = input()
T = input()

for s in S:
    l1.append(s)

for t in T:
    l2.append(t)

count = 0
count1 = 0
lenth = int(len(S))

while lenth > count1:

    if l1[count1] == l2[count1]:
        count1 += 1
    else:
        count += 1
        count1 +=1

print(count)

Submission status: Accepted

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

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

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:
a = input()
b = input()
list_a = []
list_b = []
score = 0
for n in a:
    list_a.append(n)
for m in b:
    list_b.append(m)
for i in range(0, len(list_a)):
    if list_a[i] != list_b[i]:
        score += 1
print(score)

Submission status: Accepted

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

Submission status: Accepted

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

s = list(s)
t = list(t)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(sum)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import sys

S = sys.stdin.readline().rstrip()
T = sys.stdin.readline().rstrip()

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

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

Submission status: Accepted

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

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:
s = list(input());		  t = list(input())
print(sum([1 for i,j in zip(s,t) if i!=j]))

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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([x!=y for x,y in zip(S,T)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def adj(n): return [[] for _ in range(n)]

class unionfind():
    def __init__(self, n):
        self.n = n
        # 中身が負の数なら根であり、数字の絶対値はグループ数
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0: return x
        self.parents[x] = self.find(self.parents[x])
        return self.parents[x]
    def union(self, x, y):
        x,y = self.find(x), self.find(y)
        if x == y: return
        if self.parents[x] > self.parents[y]: x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x): return -self.parents[self.find(x)]
    def same(self, x, y): return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self): return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self): return len(self.roots())

s,t = sinput(),sinput()
n = len(s)

ans = 0
for i in range(n):
    ss,tt = s[i],t[i]
    if ss==tt: continue
    else: ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
# from collections import Counter, deque
# from collections import defaultdict
# from itertools import combinations, permutations, accumulate, groupby, product
# from bisect import bisect_left,bisect_right
# from heapq import heapify, heappop, heappush
# from math import floor, ceil,pi,factorial
# from operator import itemgetter
input = sys.stdin.readline
sys.setrecursionlimit(10**7)

inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
S = input()
T = input()
print(sum(s != t for s, t in zip(S, T)))

Submission status: Accepted

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

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

def count_diff(a,b):

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
t = S()
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)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# B - Minor Change

s = input()
t = input()
print(sum(1 for a, b in zip(s, t) if a != b))

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

Submission status: Accepted

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

l = len(s)
n = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

length = len(a)

i = 0
count = 0

while i < length:
  if a[i] != b[i]:
    count = count + 1
  i = i + 1

print(count)

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
ix = lambda x:list(input() for _ in range(x))
mix = lambda x:list(mi() for _ in range(x))
iix = lambda x:list(int(input()) for _ in range(x))
##########

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
c=0
for k in range(len(s)):
    if s[k] != t[k]:
        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=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()
x = 0
l = len(S)
for i in range(l):
    if S[i] != T[i]:
        x += 1

print(x)

Submission status: Accepted

Solution code:
import sys
from functools import reduce

def _main():
    s = sys.stdin.readline()
    t = sys.stdin.readline()

    print(reduce(lambda acc, _t: acc + (1 if _t[0] != _t[1] else 0), zip(s, t), 0))

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 += 1
print(a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

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

	ans = 0
	for i,val in enumerate(S):
		if val == T[i]:
			pass
		else:
			ans += 1

	print(ans)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Accepted

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

length = len(s)
cnt = 0
for i in range(length):
  if s[i] != t[i]:
    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:
def main():
    s = input()
    t = input()

    n = len(s)

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

    print(ans)

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

Submission status: Accepted

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

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

for i in range(len(S)):
    if S[-i-1] == T[-i-1]:
        pass
    else:
        count += 1

print (count)

Submission status: Accepted

Solution code:
s = input()
t = input()
l = len(s)
ans=0
for i in range(l):
    if t[i]!=s[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()

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

Submission status: Accepted

Solution code:
S = input()
T = input()
print(sum(s!=t for s, t in zip(S, T)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


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

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

    return cnt


if __name__ == "__main__":
    print(main())

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input()
T = input()

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

print(counter)

Submission status: Accepted

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

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

    print(count)


if __name__ == '__main__':
    main()

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

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

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()
a=[0]*26
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())
m=list(input())
ams=0
for i in range(len(k)):
  if(k[i]!=m[i]):
    ams+=1
print(ams)

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:
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 = list(input())
T = list(input())
ans = 0
for i, j in zip(S, T):
    if i != j:
        ans += 1
print(ans)

Submission status: Accepted

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

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]:
    ans+=1
print(ans)

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

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

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

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

Submission status: Accepted

Solution code:
S = raw_input().strip()
T = raw_input().strip()

ans = len([c for c, d in zip(S, T) if c != d])
print ans

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input_data = []
input_pointer = 0

output_data = []

def input_scan():
    global input_data
    input_data = sys.stdin.readlines()
    input_data = [x[:-1] for x in input_data]

def next_line():
    global input_pointer
    global input_data
    if input_pointer < len(input_data):
        input_pointer += 1
        return input_data[input_pointer - 1]
    else:
        return ""

def append_output(string):
    global output_data
    output_data.append(string)

def print_output():
    global output_data
    output_data.append("")
    sys.stdout.write("\n".join(output_data))

# problem A
# a = int(input())
# append_output(str(a + a * a + a * a * a))
# print_output()

input_scan()
s = next_line()
t = next_line()
print(sum([1 for x, y in zip(list(s), list(t)) if x != y]))

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

Submission status: Accepted

Solution code:
s, t = map(lambda s: s.rstrip(), open(0).readlines())
n = len(s)
ans = 0
for i in range(n):
    ans += s[i] != t[i]
print(ans)

Submission status: Accepted

Solution code:
s, t = open(0)
n = len(s)
ans = 0
for i in range(n):
    ans += s[i] != t[i]
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jun 28 13:26:25 2020

@author: NEC-PCuser
"""
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 c1, c2 in zip(s, t):
    if c1 != c2:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
count = 0
for n, c in enumerate(s):
    if (c is not t[n]):
        count+=1
print(count)

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

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

print(t)

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

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 collections
import heapq
import math
import random
import sys
input = sys.stdin.readline

s = input().rstrip()
t = input().rstrip()
res = sum(s[i] != t[i] for i in range(len(s)))
print(res)

Submission status: Accepted

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

l = len(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

S = input()[:-1]
T = input()[:-1]
ans = 0

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

print(ans)