← Back to List

31608번: ハミング距離 (Hamming Distance) ↗

Solutions

Python 3
554 B | 554 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print

def solve():
  n = ii()
  a = inp()
  b = inp()

  p(sum([a[i] != b[i] for i in range(n)]))

if __name__ == "__main__":
  tc = 1

  for t in range(1, tc+1):
    ret = solve()