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: 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 a[i] != c[i]) or\
        (a[i] == c[i] and a[i] != b[i]) or\
        (b[i] == c[i] and b[i] != a[i]):
        ans += 1
    elif a[i] == b[i] == c[i]:
        continue
    else:
        ans += 2
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=input()
b=input()
c=input()
a=list(a)
b=list(b)
c=list(c)
ans=0
for aa,bb,cc in zip(a,b,c):
    t=set()
    t.add(aa)
    t.add(bb)
    t.add(cc)
    ans+=len(t)-1
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter
N = int(input())
A = list(input())
B = list(input())
C = list(input())

ans = 0
for c in zip(A, B, C):
    char_cnt = Counter(c)
    max_val = 0
    for val in char_cnt.values():
        if val > max_val:
            max_val = val
    ans += 3 - max_val

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A=input()
B=input()
C=input()
S=""
count=0
for i in range(N):
	S=[A[i],B[i],C[i]]
	if len(set(S))==3:
		count+=2
	elif len(set(S))==2:
		count+=1
print(count)

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] and s2[i] == s3[i] and s3[i] == s1[i]:
        True
    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())
a = list(input())
b = list(input())
c = list(input())
count = 0
for i in range(N):
    if a[i]==b[i] or b[i]==c[i] or c[i]==a[i]:
        if a[i]==b[i] and b[i]==c[i]:
            continue
        else:
            count += 1
    else:
        count += 2
print(count)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = [input() for i in range(3)]
    ans = 0
    for i in range(N):
        cur = {A[0][i], A[1][i], A[2][i]}
        # print(cur)
        ans += (len(cur) - 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):
    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()
ans = 0
for a,b,c in zip(A,B,C):
    if a==b==c: continue
    if a==b or b==c or c==a:
        ans += 1
    else:
        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):
    d=set([a[i],b[i],c[i]])
    x=len(d)
    if x==3:
        ans+=2
    elif x==2:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
import sys
def main():
    input = sys.stdin.read
    N,A,B,C=input().rstrip().split()
    ans = 0
    for S in zip(A,B,C):
        s = len(set(S))
        if s == 3: ans += 2
        elif s == 2: ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = 0
for i in range(n):
    l = [a[i], b[i], c[i]]
    s = set(l)
    if len(s) == 3:
        ans += 2
    elif len(s) == 2:
        ans += 1
    else:
        pass
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):
  if A[i] == B[i] == C[i]: continue
  elif A[i] == B[i] or A[i] == C[i] or B[i] == C[i]:
    ans += 1
  else:
    ans += 2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

n = INT()
a = STR()
b = STR()
c = STR()
ans = 0
for i in range(n):
    if a[i] != b[i]:
        ans += 1
    if c[i] != b[i] and c[i] != a[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = I()
    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 a[i] == c[i]:
            ans += 1
        else:
            ans += 2
    print(ans)
    return

#Solve
if __name__ == "__main__":
    solve()

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):
    if a == b == c:
        continue
    if len(set([a, b, c])) == 2:
        ans += 1
    else:
        ans += 2

print(ans)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n = ii()
A = list(input())
B = list(input())
C = list(input())

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

Submission status: Accepted

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

ans = 0
for i in range(N):
  if [A[i] == B[i], B[i] == C[i], C[i] == A[i]].count(False) == 2:
    ans +=  1
  elif [A[i] == B[i], B[i] == C[i], C[i] == A[i]].count(False) == 3:
    ans += 2
  else:
    pass
    
print(ans)

Submission status: Accepted

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

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()
ans = 0
for i in range(n):
    tmp = 0
    if a[i] == b[i]:
        tmp += 1
    if a[i] == c[i]:
        tmp += 1
    if b[i] == c[i]:
        tmp += 1
    if tmp == 1:
        ans += 1
    elif tmp == 0:
        ans += 2
print(ans)

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):
    if a == b == c:
        continue
    elif a == b or b == c or c == a:
        ans += 1
    else:
        ans += 2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(input())
b = list(input())
c = list(input())
def how_many_changes(p,q,r):
    if p != q and q != r and r != p:
        return 2
    if p == q != r or q == r != p or r == p != q:
        return 1
    else:
        return 0
ans = 0
for i in range(n):
    ans += how_many_changes(a[i], b[i], c[i])
print(ans)

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]:
    ans=ans
  elif A[i]!=B[i]!=C[i]!=A[i]:
    ans=ans+2
  else:
    ans=ans+1

print(ans)

Submission status: Accepted

Solution code:
N = input()
A = input()
B = input()
C = input()
cnt = 0
for a,b,c in zip(A,B,C):
    if a == b and b == c and b == a:
        continue
    elif a != b and b != c and c != a:
        cnt += 2
    elif a == b and b != c:
        cnt += 1
    elif b == c and c != a:
        cnt += 1
    elif c == a and a != b:
        cnt += 1
    
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = [input() for _ in range(3)]
ans = 2*n
for i in range(n):
  if s[0][i] == s[1][i]: ans -= 1
  if s[0][i] == s[2][i]: ans -= 1
  if s[2][i] == s[1][i]: ans -= 1
  if s[0][i] == s[1][i] and s[2][i] == s[1][i] : ans += 1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(input())
B = list(input())
C = list(input())
from collections import Counter
ans = 0
for i in range(N):
    da = [A[i],B[i],C[i]]
    c = Counter(da)
    li = list(c.values())
    li.sort()
    ans += 3-li[-1]
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({a[i],b[i],c[i]}) -1
print(ans)

Submission status: Accepted

Solution code:

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

ans = 0
x = {}

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

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

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


N = I()
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:
def main():
    length = int(input())
    words = [input() for _ in range(3)]
    answer = 0
    for i in range(length):
        l = [words[0][i], words[1][i], words[2][i]]
        answer += len(set(l)) - 1
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=list(input())
b=list(input())
c=list(input())
cnt=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 a[i]==c[i]:
        cnt+=1
    else:
        cnt+=2
print(cnt)

Submission status: Accepted

Solution code:
N = int(input())
A = input()
B = input()
C = input()
ans = 0
for i in range(N) :
    s = [A[i], B[i], C[i]]
    li = [s.count(s[j]) for j in range(3)]
    ans += 3 - max(li)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count = 0
N = int(input())
A = input()
B = input()
C = input()
for i in range(N):
  if A[i] == B[i] and B[i] == C[i]:
    count = count
  elif A[i] == B[i] or B[i] == C[i] or C[i] == A[i]:
    count = count + 1
  else:
    count = 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):
  m=len(set([a[i],b[i],c[i]]))
  ans+=m-1
print(ans)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    a = input().rstrip()
    b = input().rstrip()
    c = input().rstrip()
    ans = 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 c[i] == a[i]:
            ans += 1
        else:
            ans += 2
    print(ans)

if __name__ == "__main__":
    main()

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 b[i]==c[i] or a[i]==c[i]:
        cnt+=1
    else:
        cnt+=2
print(cnt)

Submission status: Accepted

Solution code:
from collections import defaultdict

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

ans=0
for i in range(n):
    d=defaultdict(int)
    d[a[i]]+=1
    d[b[i]]+=1
    d[c[i]]+=1
    ans+=3-max(d.values())
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
res = 0
for i in range(n):
    x,y,z = a[i], b[i], c[i]
    if x==y==z:
        res += 0
    elif x==y or y==z or z==x:
        res += 1
    else:
        res += 2
print(res)

Submission status: Accepted

Solution code:
N=int(input())
A=input()
B=input()
C=input()
l=[]
c=0

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

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[i], C[i]}
  if len(a) == 2:
    ans += 1
  if len(a) == 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):
    if a[i]!=b[i] and b[i]!=c[i] and c[i]!=a[i]:
        ans+=2
    elif a[i]==b[i] and b[i]==c[i]:
        continue
    else:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = [input() for i in range(3)]
ans = 0
for i in range(N):
  ans += len(set([A[0][i],A[1][i],A[2][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):
    s = [a[i], b[i], c[i]]
    cnt += (len(set(s))-1)
print(cnt)

Submission status: Accepted

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

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] == C[i]):
        cnt += 0
    elif(A[i] == B[i] or C[i] == A[i] or B[i] == C[i]):
        cnt += 1
    elif(A[i] != B[i] != C[i]):
        cnt += 2
print(cnt)

Submission status: Accepted

Solution code:
N=int(input())
def f(a,b,c):
    X=sorted([a,b,c])
    if a==b==c:
        return 0
    elif X[0]==X[1] or X[1]==X[2]:
        return 1
    else:
        return 2
print(sum(f(a,b,c) for a,b,c in zip(input(),input(),input())))

Submission status: Accepted

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

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] or B[i] == C[i] or C[i] == A[i]:
        ans += 1
    else:
        ans += 2

print (ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n=int(input())
a=input()
b=input()
c=input()
def f(a,b,c):
  re=2
  if a==b:
    re-=1
  if c==b:
    re-=1
  if a==c:
    re-=1
  return max(0,re)
for i in range(n):
  count += f(a[i],b[i],c[i])
print(count)

Submission status: Accepted

Solution code:
n = int(input())
a = [i for i in input()]
b = [i for i in input()]
c = [i for i in input()]
ans = 0

for j in range(len(a)):
	
	if a[j] == b[j] == c[j]:
		ans += 0
	elif a[j] != b[j] and b[j] != c[j] and a[j] != c[j]:
		ans += 2
	else:
		ans += 1

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
l=[input(),input(),input()]
c=0
for x in zip(*l):
  if len(set(x))==3:
    c+=2
  elif len(set(x))==2:
    c+=1
print(c)

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

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

print(count)

Submission status: Accepted

Solution code:
from collections import defaultdict
N = int(input())
ABC = [input() for _ in range(3)]

ans = 0
for i in range(N):
    d = defaultdict(int)
    for j in range(3):
        d[ABC[j][i]] += 1
    ans += 3 - max(d.values())
print(ans)

Submission status: Accepted

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

print con

Submission status: Accepted

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

    print(ans)


if __name__ == "__main__":
    n = int(input())
    a = input()
    b = input()
    c = input()

    main(n, a, b, c)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = input()
    B = input()
    C = input()
    ans = 0
    for a,b,c in zip(A,B,C):
        now = set([a,b,c])
        if len(now)==1:
            pass
        elif len(now)==2:
            ans += 1
        else:
            ans += 2
    
    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 c[i] == a[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 = input()
b = input()
c = input()

cnt = 0

for i in range(n):
	num_unique = len(list(set([a[i],b[i],c[i]])))

	if num_unique == 3:
		cnt += 2
	elif num_unique == 2:
		cnt += 1
	else:
		cnt += 0

print(cnt)

Submission status: Accepted

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

import collections

cnt=0

for i in range(N):
    tmp=[]
    tmp.append(A[i])
    tmp.append(B[i])
    tmp.append(C[i])
    c = collections.Counter(tmp)
    values, counts = zip(*c.most_common())
    cnt+=3-counts[0]

print(cnt)

Submission status: Accepted

Solution code:
N,A,B,C = int(input()), input(), input(), input()
ans = 0
for a,b,c in zip(A,B,C):
  if a == b and b ==c: continue
  elif a==b or b==c or c==a: ans += 1
  elif a != b and b != c and c != a: 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):
    
    if a[i] == 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 = input()
B = input()
C = input()
wordlst = [A, B, C]
cnt = 0
for i in range(N):
    tmp = 0
    for j in range(3):
        tmp += wordlst[j - 1][i].count(wordlst[j][i])
        tmp += wordlst[j - 2][i].count(wordlst[j][i])
    if tmp == 0:
        cnt += 2
    elif tmp == 2:
        cnt += 1

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import collections


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    a = str(readline().rstrip().decode('utf-8'))
    b = str(readline().rstrip().decode('utf-8'))
    c = str(readline().rstrip().decode('utf-8'))
    cnt = 0
    for i in range(n):
        ct = collections.Counter([a[i], b[i], c[i]])
        if len(ct) == 3:
            cnt += 2
        elif len(ct) == 2:
            cnt += 1
        elif len(ct) == 1:
            cnt += 0
    print(cnt)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
n,*a=open(0);print(sum(len(x)-1for x in map(set,zip(*a))))

Submission status: Accepted

Solution code:
def examB():
    N = I()
    A = SI(); B = SI(); C = SI()
    ans = 2*N
    for i in range(N):
        cur = 0
        if A[i]==B[i]:
            cur +=1
        if B[i]==C[i]:
            cur +=1
        if C[i]==A[i]:
            cur +=1
        ans -=min(2,cur)
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examB()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = input()
    B = input()
    C = input()
    cnt = 0

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

    print(cnt)


main()

Submission status: Accepted

Solution code:
N = int(input())
A = input().strip()
B = input().strip()
C = input().strip()
cnt = 0
for i in range(N):
    a = set([A[i],B[i],C[i]])
    if len(a)==3:
        cnt += 2
    elif len(a)==2:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
# 2019/12/5

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

cnt=0
for aa,bb,cc in zip(a,b,c):
    tmp=set([aa,bb,cc])
    cnt+=len(tmp)-1
print(cnt)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N=I()
    A=ST()
    B=ST()
    C=ST()
    ans = 0
    for a,b,c in zip(A,B,C):
        ans += len(set([a,b,c]))-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):
    ans+=len({A[i],B[i],C[i]})-1

print(ans)

Submission status: Accepted

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

ans = 0
for i in range(n):
  h = [a[i], b[i], c[i]]
  h.sort()
  if h[0] != h[1] and h[1] != h[2]:
    ans += 2
  elif h[0] != h[2]:
    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):
  if a[i] == b[i] or b[i] == c[i] or c[i] ==a[i]:
    if a[i] == b[i] == c[i]:
      continue
    else:
      ans += 1
  else:
    ans+= 2
print(ans)

Submission status: Accepted

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

ans = 0
for aa, bb, cc in zip(a,b,c):
  if aa == bb and bb == cc:
    pass
  elif aa == bb or bb == cc or cc == aa :
    ans += 1
  else :
    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):
  if a[i].count(b[i]) + b[i].count(c[i]) + c[i].count(a[i]) != 3:
    ans += 2 - (a[i].count(b[i]) + b[i].count(c[i]) + c[i].count(a[i]))
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = input()
b = input()
c = input()
ans = 0
for i in range(n):
    k = set([a[i], b[i],c[i]])
    ans += len(k) - 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 = []
  X.append(A[i])
  X.append(B[i])
  X.append(C[i])
  X = set(X)
  ans += len(X) - 1
  
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(input())
b=list(input())
c=list(input())
co=0
for a,b,c in zip(a,b,c):
    if a==b==c:
        co+=0
    elif a==b or a==c or b==c:
        co+=1
    elif a!=b!=c:
        co+=2
print(co)

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


N = int(sys.stdin.readline())
A = list(sys.stdin.readline().rstrip())
B = list(sys.stdin.readline().rstrip())
C = list(sys.stdin.readline().rstrip())

A = np.array(A, dtype='U1')
B = np.array(B, dtype='U1')
C = np.array(C, dtype='U1')


def count(a, b, c):
    if a == b == c:
        return 0
    if a == b or b == c or c == a:
        return 1
    return 2


ans = 0
for a, b, c in zip(A, B, C):
    ans += count(a, b, c)
print(ans)

Submission status: Accepted

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

import os
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    A = input()
    B = input()
    C = input()
    
    ans = 0
    for i in range(N):
        if A[i] == B[i] and A[i] == C[i]:
            pass
        else:
            if A[i] != B[i] and A[i] != C[i] and B[i] != C[i]:
                ans += 2
            else:
                ans += 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):
  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()
print(sum([len(set(x))-1 for x in zip(a,b,c)]))