Problem:


Score : 200 points

Problem Statement

You are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.

Our objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:

Operation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.

What is the minimum number of operations required to achieve the objective?

Constraints

1 \leq N \leq 100

Each of the strings A, B and C is a string of length N.

Each character in each of the strings A, B and C is a lowercase English letter.

Input

Input is given from Standard Input in the following format:

N
A
B
C

Output

Print the minimum number of operations required.

Sample Input 1

4
west
east
wait

Sample Output 1

3

In this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:

Change the second character in A to a. A is now wast.

Change the first character in B to w. B is now wast.

Change the third character in C to s. C is now wast.

Sample Input 2

9
different
different
different

Sample Output 2

0

If A, B and C are already equal in the beginning, the number of operations required is 0.

Sample Input 3

7
zenkoku
touitsu
program

Sample Output 3

13



Sample input:
4
west
east
wait


Sample output:
3

Submission status: Wrong Answer

Solution code:
def data_input():
    a = input()
    b = input()
    c = input()
    d = input()
    return (int(a),b,c,d)
def answer():
    n,a,b,c = data_input()
    counta = 0
    countb = 0
    countc = 0
    for i in range(n):
        if a[i] != b[i]:
            counta += 1
    for i in range(n):
        if a[i] != c[i]:
            countb += 1
    for i in range(n):
        if a[i] != c[i]:
            countc += 1
    return counta + countb + countc - max(counta,countb,countc)

def output():
    res = answer()
    print(res)
output()

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(input())
b=list(input())
c=list(input())
ans=0
for i in range(n-1):
  if a[i] == b[i] and a[i] == c[i] and b[i] == c[i]:
    ans+=0
  elif a[i] != b[i] and a[i] == c[i] and b[i] == c[i]:
    ans+=1
  elif a[i] == b[i] and a[i] != c[i] and b[i] == c[i]:
    ans+=1
  elif a[i] == b[i] and a[i] == c[i] and b[i] != c[i]:
    ans+=1
  elif a[i] != b[i] and a[i] == c[i] and b[i] != c[i]:
    ans+=1
  elif a[i] == b[i] and a[i] != c[i] and b[i] != c[i]:
    ans+=1
  elif a[i] != b[i] and a[i] != c[i] and b[i] == c[i]:
    ans+=1
  elif a[i] != b[i] and a[i] != c[i] and b[i] != c[i]:
    ans+=2
print(str(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()
b = input()
c = input()
d = 0
for i in range(0, n):
  if a[i] != b[i] != c[i]:
    d += 2
  if a[i] == b[i] == c[i]:
    d += 0
  if a[i] != b[i] == c[i] or a[i] == b[i] != c[i] or b[i] == a[i] != c[i]:
    d += 1
print(d)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()
b = input()
c = input()

count = 0

for i in range(n):
    if a[i] == b[i] and b[i] == c[i] and c[i] == a[i]:
        break
    elif a[i] != b[i] and b[i] != c[i] and c[i] != a[i]:
        count += 2
    else:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import bisect
import sys

sys.setrecursionlimit(200000)


def input():
    return sys.stdin.readline()[:-1]


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def imi(N: int, t: type = int):
    return [ii(t) for _ in range(N)]


def iml(N: int, t: type = int):
    return [il(t) for _ in range(N)]


def solve():
    N = ii()
    A = ii(str)
    B = ii(str)
    C = ii(str)
    AB = [A[i] == B[i] for i in range(N)].count(False)
    BC = [B[i] == C[i] for i in range(N)].count(False)
    CA = [C[i] == A[i] for i in range(N)].count(False)
    return max(0, sum(sorted([AB, BC, CA])[1:]) - 1)


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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input()
B = input()
C = input()
if A == B == C:
    print(0)

count = 0
for a, b, c in zip(A,B,C):
    if a == b == c:
        pass
    elif a == b and not a==c:
        count += 1
    elif a ==c and not a == b:
        count += 1
    elif b == c and not a == b:
        count += 1
    else:
        count += 2
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(str(input()))
B = list(str(input()))
C = list(str(input()))

res = 0
for i in range(N):
    if A[i] != B[i]:
        res+=1
    if A[i] != C[i]:
        res+=1

print(res)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=input()
B=input()
C=input()

AL=[x for x in A]
BL=[x for x in B]
CL=[x for x in C]

c=0
for i in range(N):
    if AL[i]==BL[i] and BL[i]==CL[i]:
        break
    if AL[i]==BL[i] or BL[i]==CL[i] or CL[i]==AL[i]:
        c+=1
    else:
        c+=2
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=input()
b=input()
c=input()
al=list(a)
bl=list(b)
cl=list(c)

count=0

for i in range(n):
    if al[i]==bl[i]:
        if al[i]==cl[i]:
            plus=2
        else:
            plus=1
    elif bl[i]==cl[i]:
        plus=1
    elif al[i]==cl[i]:
        plus=1
    else:
        plus=0
        
    count+=plus
    
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input()
B = input()
C = input()
count = 0
for i in range(N):
    if A[i] == B[i] == C[i]:
        count += 0
    elif A[i] == B[i] or B[i] == C[i] or A[i] == C[i]:
        count += 1
    else:
        count += 3
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input()
B = input()
C = input()

cntAB = N
cntBC = N
cntCA = N

for i in range(N):
    if A[i] == B[i]:
        cntAB -= 1
    if B[i] == C[i]:
        cntBC -= 1
    if C[i] == A[i]:
        cntCA -= 1

cnt = [cntAB, cntBC, cntCA]

print(sum(cnt) - max(cnt))

Submission status: Wrong Answer

Solution code:
#coding:utf-8

n = int(input())
a = input()
b = input()
c = input()
ans = 0

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

print(ans)

Submission status: Wrong Answer

Solution code:
def diff(a, b, c):
    i = 0
    for aa, bb, cc in zip(a, b, c):
        if aa != bb or aa != cc:
            i += 1
    return i

n = int(input())
a = list(input())
b = list(input())
c = list(input())

print(diff(a, b, c))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=input()
b=input()
c=input()
d=0
for i in range(n):
	if a[i]!=b[i]!=c[i]:
		d+=2
	elif not a[i]==b[i]==c[i]:
		d+=1
print(d)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = str(input())
B = str(input())
C = str(input())

count=0
for i in range(N):
	if (A[i] == B[i]) and (B[i] == C[i]):
		count+=1

print(N-count)
exit()

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()
b = input()
c = input()
count = 0
for i in range(n):
    if a[i] == b[i] and b[i] == c[i]:
        continue
    elif a[i] == b[i] or b[i] == c[i]:
        count += 1
    else:
        count += 2
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input()
B = input()
C = input()
cnt = 0
for i in range(N):
  if A[i] == B[i] == C[i]:
    cnt += 0
  elif A[i] != B[i] != C[i]:
    cnt += 2
  else:
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()
b = input()
c = input()

count = 0

for i in range(n):
    if a[i] != b[i] and a[i] != c[i]:
        count += 2
    elif a[i] != b[i] or a[i] != c[i]:
        count += 1
        
print(count)

Submission status: Accepted

Solution code:
N = int(input())
A = list(input())
B = list(input())
C = list(input())

ans = 0
for i in range(N):
    kind = len(set((A[i], B[i], C[i])))
    ans += kind - 1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S1 = input()
S2 = input()
S3 = input()
ans = 0
for i in range(N):
  if S1[i] == S2[i] == S3[i]:
    ans += 0
  elif S1[i] != S2[i] and S2[i] != S3[i] and S3[i] != S1[i]:
    ans += 2
  else:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
x = [input() for i in range(3)]
c=0
for i in range(n):
    c+=len(set([x[0][i],x[1][i],x[2][i]]))-1
print(c)

Submission status: Accepted

Solution code:
n=int(input())
a=input()
b=input()
c=input()
d=0
for i in range(n):
  if a[i]==b[i]==c[i]:
    continue
  elif a[i]==b[i] or b[i]==c[i] or a[i]==c[i]:
    d+=1
  else:
    d+=2
print(d)

Submission status: Accepted

Solution code:
N=int(input())
A=input()
B=input()
C=input()
count=N*2
d=0
for i in range(N):
    if A[i]==B[i]==C[i]:
        count += -1
        
    if A[i]==B[i] or A[i]==C[i] or B[i]==C[i]:
        count += -1
        

print(count)

Submission status: Accepted

Solution code:
a = int(input())
b = (input())
c = (input())
d = (input())
count = 0
for i in range(a):
    if b[i] == c[i] == d[i]:
        count += 0
    elif b[i] == c[i] or b[i] == d[i]  or  c[i] == d[i]:
        count += 1
    else:
        count += 2
print(count)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
  if a[i] == b[i] == c[i]:
    continue
  if a[i] == b[i] or b[i] == c[i] or c[i] == a[i]:
    ans += 1
  else:
    ans += 2
print(ans)

Submission status: Accepted

Solution code:
import math
# a=int(input())
b=int(input())
# c=[]
# for i in b:
#     c.append(i)
#e = list(map(int,input().split()))
#f = list(map(int,input().split()))
j = [input() for _ in range(3)]
a1=[i for i in j[0]]
a2=[i for i in j[1]]
a3=[i for i in j[2]]

count=0

for i in range(b):
    if a1[i]==a2[i]==a3[i]:
        count+=0
    elif a1[i]==a2[i] or a1[i]==a3[i] or a2[i]==a3[i]:
        count+=1
    else:
        count+=2

print(count)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()

ans = 0
for i in range(n):
    if a[i] == b[i] == c[i]:
        continue
    elif a[i] != b[i] and b[i] != c[i] and c[i] != a[i]:
        ans += 2
    else:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(input())
b = list(input())
c = list(input())
ans = 0
for i in range(n):
    l = [a[i],b[i],c[i]]
    l = list(set(l))
    if len(l) == 3:
        ans += 2
    elif len(l) == 2:
        ans += 1
    else:
        pass
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()

count = 0
for i in range(n):
    count += len(set([a[i], b[i], c[i]])) - 1

print(count)

Submission status: Accepted

Solution code:
# coding: utf-8
n = int(input())
a=input()
b=input()
c=input()
ans=0
for i in range(n):
    ans+=len(set([a[i], b[i], c[i]]))-1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for _ in range(3)]
ans = 0
for i in range(N):
    ans += len(set([S[0][i], S[1][i], S[2][i]]))-1
print(ans)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())
    A = input()
    B = input()
    C = input()
    ans = 0

    for a, b, c, in zip(A, B, C):
        s = {a, b, c}
        ans += len(s) - 1

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# 全国統一プログラミング王決定戦予選/NIKKEI Programming Contest 2019: B – Touitsu
N = int(input())
A, B, C = [input() for _ in range(3)]

operations = 0

for i in range(N):
    if A[i] == B[i] == C[i]:
        pass
    elif A[i] == B[i] or B[i] == C[i] or C[i] == A[i]:
        operations += 1
    else:
        operations += 2

print(operations)

Submission status: Accepted

Solution code:
from collections import Counter

N=int(input())
A=input()
B=input()
C=input()

D=[]
for i in range(N):
  mc = Counter([A[i],B[i],C[i]]).most_common()[0][0]
  D.append(mc)
D=''.join(D)
  
def diff(s1,s2):
  out=0
  for i in range(len(s1)):
    if s1[i] != s2[i]:
      out += 1
  return out

ans=0
ans+=diff(D,A)
ans+=diff(D,B)
ans+=diff(D,C)

print(ans)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    a, b, c = input(), input(), input()
    ans = 0

    for i in range(n):
        ans += len(set((a[i], b[i], c[i]))) - 1

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    a = input()
    b = input()
    c = input()
    ans = 0

    for i in range(n):
        if a[i] == b[i] and b[i] == c[i]:
            continue
        elif a[i] == b[i] and b[i] != c[i]:
            ans += 1
        elif b[i] == c[i] and c[i] != a[i]:
            ans += 1
        elif c[i] == a[i] and a[i] != b[i]:
            ans += 1
        else:
            ans += 2

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
l = [list(input()) for _ in range(3)]

x=[[] for _ in range(n)]
for i in range(3):
    for j in range(n):
        x[j].append(l[i][j])

ans=0
for i in x:
    ans += len(set(i)) - 1

print(ans)

Submission status: Accepted

Solution code:
import sys, math
from functools import lru_cache
import numpy as np
import heapq
from collections import defaultdict
sys.setrecursionlimit(10**9)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def lcm(a, b):
    return a*b//math.gcd(a, b)


def main():
    N, A, B, C = [ii(), input(), input(), input()]
    cnt = 0

    for i in range(N):
        k = len(set([A[i], B[i], C[i]]))
        if k == 2:
            cnt += 1
        if k == 3:
            cnt += 2
    print(cnt)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
abc = [list(input()) for _ in range(3)]
ans = 2 * n
for j in range(n):
    x = 0
    for i in range(3):
        if abc[i][j] == abc[(i + 1) % 3][j]:
            x += 1
        if x >= 2:
            break
    ans -= x
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = input()
B = input()
C = input()
total = 0
for i in range(N):
  aaa = set()
  aaa.add(A[i])
  aaa.add(B[i])
  aaa.add(C[i])
  ans = len(aaa) -1
  total += ans
print(total)

Submission status: Accepted

Solution code:
N=int(input())
S=[input() for i in range(3)]
ans=0
for i in range(N):
    s=set([S[j][i] for j in range(3)])
    ans+=len(s)-1
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A=list(input())
B=list(input())
C=list(input())

answer=0
for i in range(N):
  a=A[i]
  b=B[i]
  c=C[i]
  
  if a==b==c:
    continue
  elif a==b or b==c or c==a:
    answer+=1
  else:
    answer+=2
    
print(answer)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
    if a[i] == b[i] == c[i]:
        pass
    elif a[i] != b[i] and b[i] != c[i] and c[i] != a[i]:
        ans += 2
    else:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n=input();print(sum(len(set(o))-1 for o in zip(input(),input(),input())))

Submission status: Accepted

Solution code:
'''
Created on 2020/08/21

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  N=int(pin())
  A=pin()[:-1]
  B=pin()[:-1]
  C=pin()[:-1]
  ans=0
  for i in range(N):
    l=[A[i],B[i],C[i]]
    t=len(list(set(l)))
    ans+=t-1
  print(ans)
  return 
main()

Submission status: Accepted

Solution code:
N = int(input())
A = input()
B = input()
C = input()
ans = 0

for i in range(N):
    ans += len(set([A[i], B[i], C[i]])) - 1

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()

cnt = 0
for i in range(n):
    tmp_lists = [a[i], b[i], c[i]]
    sets = set(tmp_lists)
    cnt += len(sets) - 1

print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
a = str(input())
b = str(input())
c = str(input())
ans = 0
for i in range(n):
  if a[i] == b[i] and b[i] == c[i]:
    ans += 0
  elif a[i] == b[i] or b[i] == c[i] or c[i] == a[i]:
    ans += 1
  else:
    ans += 2
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A=list(input())
B=list(input())
C=list(input())
a=0
for i in range(N):
    if A[i]!=B[i] and B[i]!=C[i] and C[i]!=A[i]:
        a+=2
    elif A[i]==B[i] and B[i]==C[i]:
        a+=0
    else:
        a+=1
print(a)

Submission status: Accepted

Solution code:
n=int(input())
a=input()
b=input()
c=input()
ans=0
for i in range(n):
    if a[i]==b[i]==c[i]:
        continue
    elif a[i]!=b[i] and a[i]!=c[i] and b[i]!=c[i]:
        ans+=2
    else:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A=input()
B=input()
C=input()


M=0
for i in range(N):
    a=len(set([A[i],B[i],C[i]]))
    if a==2:
        M+=1
    elif a==1:
        M+=0
    elif a==3:
        M+=2
print(M)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
    s = set()
    s.add(a[i])
    s.add(b[i])
    s.add(c[i])
    if len(s) == 2:
        ans += 1
    elif len(s) == 3:
        ans += 2
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0

for i in range(n):
    ans += len(set([a[i], b[i], c[i]])) - 1

print(ans)

Submission status: Accepted

Solution code:
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# map(int, input().split())
N = int(input())
a = input()
b = input()
c = input()

ans = 0
for i in range(N):
    cost = INF
    for w in range(26):
        now = 0
        if ord(a[i]) != (w + ord('a')):
            now += 1
        if ord(b[i]) != (w + ord('a')):
            now += 1
        if ord(c[i]) != (w + ord('a')):
            now += 1
        cost = min(now, cost)
    ans += cost
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
cnt = 0
for i in range(n):
    if a[i] != b[i] and b[i] != c[i] and c[i] != a[i]:
        cnt += 2
    elif a[i] == b[i] == c[i]:
        cnt += 0
    else:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
N=int(input())
A=input()
B=input()
C=input()
ans=0
if A==B==C:
  ans=0
else:
  for i in range(N):
    x=[A[i],B[i],C[i]]
    ans+=len(list(set(x)))-1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()

ans = 0
for i in range(n):
    s = set([a[i], b[i], c[i]])
    ans += len(s) - 1

print(ans)

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()
    A = SS()
    B = SS()
    C = SS()

    ans = sum([len(set(s)) - 1 for s in zip(A, B, C)])
    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    A = readline().decode('utf-8').strip()
    B = readline().decode('utf-8').strip()
    C = readline().decode('utf-8').strip()
    ans = 0
    for i in range(N):
        if A[i]==B[i]==C[i]:
            continue
        elif A[i]!=B[i] and B[i]!=C[i] and C[i]!=A[i]:
            ans += 2
        else:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
a, b, c = input(), input(), input()
ans = 0
for i in range(n):
  ans += len(set([a[i], b[i], c[i]])) - 1
print(ans)

Submission status: Accepted

Solution code:
import sys
import collections
import bisect


def main():
    [n, a, b, c] = [input() for _ in range(4)]
    print(sum((len(set([a[i], b[i], c[i]]))-1) for i in range(int(n))))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=input()
b=input()
c=input()
r=0
for x in range(n):
    r+=len(set(a[x]+b[x]+c[x]))-1
print(r)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
    if a[i] != b[i] != c[i] != a[i]:
        ans += 2
    elif a[i] == b[i] == c[i]:
        ans += 0
    else:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
    x = len({a[i], b[i], c[i]})
    ans += x - 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
cnt = 0
for i in range(n):
  cnt += len(set([a[i],b[i],c[i]]))-1
print(cnt)

Submission status: Accepted

Solution code:
N,A,B,C = int(input()),input(),input(),input()
r = 0

for i in range(N):
	if not(A[i]==B[i]) and not(B[i]==C[i]) and not(C[i]==A[i]):
		r += 2
	elif not(A[i]==B[i] and B[i]==C[i]):
		r += 1
print(r)

Submission status: Accepted

Solution code:
N=int(input())
A=input()
B=input()
C=input()

ans=0
for a,b,c in zip(*[A,B,C]):
    ans+=len(set([a,b,c]))-1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = input()
B = input()
C = input()

res = 0
for a, b, c in zip(A, B, C):
    if a != b and b != c and c != a:
        res += 2
    elif a == b == c:
        pass
    else:
        res += 1

print(res)

Submission status: Accepted

Solution code:
n=int(input())
a=str(input())
b=str(input())
c=str(input())
ans=0
for i in range(n):
  if a[i]==b[i] and b[i]==c[i]:
    ans=ans
  elif a[i]!=b[i] and b[i]!=c[i] and c[i]!=a[i]:
    ans=ans+2
  else:
    ans=ans+1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
ans = [[0 for i in range(3)] for i in range(n)]

for i in range(3):
    for j in input().split():
        for k, l in enumerate(j):
            ans[k][i] = l
a = 0
for i in ans:
    a += len(set(i))-1
print(a)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
  if (a[i] == b[i]) & (b[i] == c[i]):
    continue
  if (a[i] == b[i]) | (b[i] == c[i]) | (c[i] == a[i]):
    ans += 1
    continue
  ans += 2
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
p = 0

for i in range(n):
    if a[i] == b[i] == c[i]:
        pass
    else:
        if a[i] == b[i]:
            p += 1
        elif b[i] == c[i]:
            p += 1
        elif a[i] == c[i]:
            p += 1
        else:
            p += 2

print(p)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()

ans = 0
for i in range(n):
  if (a[i] != b[i]) and (b[i] != c[i]) and (c[i] != a[i]):
    ans += 2
  elif not (a[i] == b[i] == c[i]):
    ans += 1
  else:
    pass
print(ans)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    A = input()
    B = input()
    C = input()
    ans = 0
    for a in zip(A, B, C):
        if len(set(a)) == 2:
            ans += 1
        elif len(set(a)) == 3:
            ans += 2
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
A = input()
B = input()
C = input()
s = set()
res = 0

for i in range(N):
    s.add(A[i])
    s.add(B[i])
    s.add(C[i])
    res += len(s)-1
    s.clear()
print(res)

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
A = stdin.readline().rstrip()
B = stdin.readline().rstrip()
C = stdin.readline().rstrip()
ans = 0 
for i in range(N):
    ans += len(set([A[i], B[i], C[i]]))-1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
res = 0
for i in range(n):
  res += (len(set([a[i], b[i], c[i]])) - 1)
print(res)

Submission status: Accepted

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

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    
    
    n = ii()
    a, b, c = input(), input(), input()
    ans = 0
    for i in range(n):
        s = list(set((a[i], b[i], c[i])))
        ans += len(s) - 1
    print(ans)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=input()
b=input()
c=input()
ans=0
for i in range(n):
  if a[i]!=b[i] and b[i]!=c[i] and a[i]!=c[i]:
    ans+=2
  elif a[i]==b[i] and b[i]==c[i]:
    None
  else:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    A=[]
    for i in range(3):
        A.append(input())
        
    ans=0
    for i in range(N):
        t=set([])
        for j in range(3):
            t.add(A[j][i])
        ans+=len(t)-1
        
    print(ans)
        

main()

Submission status: Accepted

Solution code:
n = int(input())
L = []
for i in range(3):
    L.append(input())

cnt = 0
for i in range(n):
    s = set((L[0][i],L[1][i],L[2][i]))
    cnt += len(s)-1
print(cnt)

Submission status: Accepted

Solution code:
n=int(input())
a=list(input())
b=list(input())
c=list(input())

ans=0

for i in range(n):
    if a[i]==b[i] and b[i]==c[i]:
        continue
    elif a[i]!=b[i] and b[i]==c[i]:
        ans+=1
    elif a[i]!=c[i] and a[i]==b[i]:
        ans+=1
    elif b[i]!=c[i] and a[i]==c[i]:
        ans+=1
    else:
        ans+=2
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
cnt=0
for i in range(n):
        if a[i]==b[i] and b[i]==c[i]:
            pass
        elif a[i]==b[i] or a[i]==c[i] or b[i]==c[i]:
            cnt+=1
        else:
            cnt+=2
print(cnt)

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.readline
    n = int(input())
    a = list(input()[:-1])
    b = list(input()[:-1])
    c = list(input()[:-1])

    ans = 0
    for ai, bi, ci in zip(a, b, c):
        ans += len(list(set([ai, bi, ci]))) - 1

    print(ans)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=input()
b=input()
c=input()

cnt=0
for i in range(n):
    l=a[i],b[i],c[i]
    cnt+=(len(set(l))-1)
print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
  a_ = a[i]
  b_ = b[i]
  c_ = c[i]
  if a_ == b_ and b_ != c_:
    ans += 1
  elif a_ == c_ and b_ != c_:
    ans += 1
  elif b_ == c_ and a_ != c_:
    ans += 1
  elif a_==b_ and a_==c_:
    ans += 0
  else:
    ans += 2
print(ans)