Problem:


Score : 100 points

Problem Statement

AtCoDeer the deer recently bought three paint cans.
The color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.
Here, the color of each paint can is represented by an integer between 1 and 100, inclusive.

Since he is forgetful, he might have bought more than one paint can in the same color.
Count the number of different kinds of colors of these paint cans and tell him.

Constraints

1≦a,b,c≦100

Input

The input is given from Standard Input in the following format:

a b c

Output

Print the number of different kinds of colors of the paint cans.

Sample Input 1

3 1 4

Sample Output 1

3

Three different colors: 1, 3, and 4.

Sample Input 2

3 3 33

Sample Output 2

2

Two different colors: 3 and 33.



Sample input:
3 1 4


Sample output:
3

Submission status: Wrong Answer

Solution code:
a = input().split()
s = {a[0]}
for i in a:
    s = s.union(i)
print(len(s))

Submission status: Wrong Answer

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

nums = list(map(int, input().split()))
a = nums[0]
b = nums[1]
c = nums[2]

if a-b == 0 & b-c == 0:
    print(1)
elif a != b & b != c:
    print(3)
else:
    print(2)

Submission status: Wrong Answer

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

nums = list(map(int, input().split()))
a = nums[0]
b = nums[1]
c = nums[2]

if a == b & b == c:
    print(1)
elif a != b & b != c:
    print(3)
else:
    print(2)

Submission status: Wrong Answer

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

nums = list(map(int, input().split()))
a = nums[0]
b = nums[1]
c = nums[2]

if a == b & b == c:
    print(1)
elif a == b | b == c | c == a:
    print(2)
else:
    print(3)

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
ans = 0
if a == b:
    if a == c:
        ans = 1
    else:
        ans = 2
else:
    if a == c:
        ans = 2
    if b == c:
        ans = 2
    else:
        ans = 3
print(ans)

Submission status: Wrong Answer

Solution code:
count = 0

a, b, c = map(int, input().split())
if a == b:
    count += 1
if b == c:
    count += 1
if b == c:
    count += 1
    
print(count)

Submission status: Wrong Answer

Solution code:
import re
x = raw_input()
l = re.split(" ", x)
a = len(set(l))

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
ans = 0
if a == b:
    if a == c:
        ans = 1
    else:
        ans = 2
else:
    if a == c:
        ans = 2
    else:
        ans = 3
print(ans)

Submission status: Accepted

Solution code:
print(len(set(map(int, input().split()))))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b:
  if b == c:
    print(1)
  else:
    print(2)
elif b == c:
  print(2)
elif a == c:
  print(2)
else:
  print(3)

Submission status: Accepted

Solution code:
s = set()
for i in input().split():
    s.add(i)

print(len(s))

Submission status: Accepted

Solution code:
a = list(input().split())
ans = len(set(a))
print(ans)

Submission status: Accepted

Solution code:

s = input().split()
s = set(s)

print(len(s))

Submission status: Accepted

Solution code:
import collections
color = map(int, input().split())
print(len(collections.Counter(color)))

Submission status: Accepted

Solution code:
def iroha():
    a, b, c = map(int, input().split())
    if a == b and b == c and a == c:
        print(1)
    elif a != b and b != c and a != c:
        print(3)
    else:
        print(2)

if __name__ == "__main__":
    iroha()

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

print(len(set(a)))

Submission status: Accepted

Solution code:
a, b, c=map(int, input().split(" "))
ink=[a, b, c]
print(len(set(ink)))

Submission status: Accepted

Solution code:
print(len(set(map(int,input().split()))))

Submission status: Accepted

Solution code:
a = set(map(int,input().split()))

print(len(a))

Submission status: Accepted

Solution code:
lst = input().split()
if len(lst) == len(set(lst)):
	print('3')
if len(lst)-1 == len(set(lst)):
	print('2')
if len(lst)-2 == len(set(lst)):
	print('1')

Submission status: Accepted

Solution code:
paint = map(int,input().split())
print(len(set(paint)))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

if a == b and b == c:
  print(1)
elif a == b and b != c:
  print(2)
elif a != b and a == c:
  print(2)
elif a != b and b == c:
  print(2)
else:
  print(3)

Submission status: Accepted

Solution code:
N = map(int,input().split())
print(len(set(N)))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
ans=1
if b!=a:ans+=1
if a!=c and b!=c:ans+=1
print(ans)

Submission status: Accepted

Solution code:
import collections

n = list(input().split())

c = collections.Counter(n)

print(len(c))

Submission status: Accepted

Solution code:
a, b, c = map(int, (input().split()))
print(len(set([a, b, c])))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

if a==b==c:
  print("1")
elif a==b or b==c or c==a:
  print("2")
else:
  print("3")

Submission status: Accepted

Solution code:
import numpy as np
a = list(map(int, input().split()))


print(len(set(a)))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b == c: print(1)
elif a == b or b == c or c == a: print(2)
else: print(3)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

print(len(set([a, b, c])))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

if a==b and b==c:
    ans=1
elif a==b and b!=c:
    ans=2
elif a!=b and b==c:
    ans=2
elif a==c and a!=b:
    ans=2
else:
    ans=3
print(ans)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    x = list(map(int, input().split()))
    print(len(set(x)))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a==b and b==c:
    print(1)
elif a==b or b==c or a==c:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(len(set([a,b,c])))

Submission status: Accepted

Solution code:
l = input().split()
print(len(set(l)))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
st = set()
st.add(a)
st.add(b)
st.add(c)
print(len(st))

Submission status: Accepted

Solution code:
s = set()
l = list(input().split())
for e in l:
  s.add(e)
print(len(s))

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(len(set(a)))

Submission status: Accepted

Solution code:
#ABC046
s = input().split()
print(len(set(s)))

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if a == b == c:
  print(1)
elif a == b or b == c or c == a:
  print(2)
else:
  print(3)

Submission status: Accepted

Solution code:
x = set(map(int, input().split()))
print(len(x))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
s = set({a, b, c})
print(len(s))

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a = set(a)
print(len(a))

Submission status: Accepted

Solution code:
li=a,b,c=list(map(int,input().split()))
print(len(set(li)))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
s={a,b,c}
print(len(s))

Submission status: Accepted

Solution code:
arr = list(map(int, input().split()))
print(len(set(arr)))

Submission status: Accepted

Solution code:
def solve():
    print(len(set(input().split())))


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
L = []
L.append(a)
L.append(b)
L.append(c)

L = list(set(L))

print(len(L))

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
data = [a]
if not b in data:
    data.append(b)
if not c in data:
    data.append(c)
print(len(data))

Submission status: Accepted

Solution code:
l = map(int, input().split())
print(len(set(l)))

Submission status: Accepted

Solution code:
def main():
    print(len(set(list(map(int, input().split())))))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=set(map(int,input().split()))
print(len(s))

Submission status: Accepted

Solution code:
ary = list(map(int, input().split()))
print(len(set(ary)))

Submission status: Accepted

Solution code:
s = list(map(int,input().split()))
print(len(set(s)))

Submission status: Accepted

Solution code:
L=set(list(map(int,input().split())))
print(len(L))

Submission status: Accepted

Solution code:
a = map(int, input().split())
paint_list = list(a)

if paint_list[0] == paint_list[1] == paint_list[2]:
    print(1)
elif paint_list[0] == paint_list[1] and paint_list[0] != paint_list[2]:
    print(2)
elif paint_list[0] == paint_list[2] and paint_list[0] != paint_list[1]:
    print(2)
elif paint_list[1] == paint_list[2] and paint_list[0] != paint_list[1]:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a=set(map(int,input().split()))
print(len(a))

Submission status: Accepted

Solution code:
data=list(input().split())
s=1
for i in range(1,len(data)):
    for j in range(0,i):
        if data[i]==data[j]:
            data[i]=-1
    if data[i]!=-1:
        s=s+1            
print(s)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def main():
    a, b, c = map(int, input().split())
    ans = {a, b, c}
    print(len(ans))






if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b and b == c:
  print(1)
elif a != b and b != c and c != a:
  print(3)
else:
  print(2)

Submission status: Accepted

Solution code:
import sys

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


def main():
    x = list(map(int, readline().split()))
    s = set(x)

    print(len(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(len(set(input().split())))

Submission status: Accepted

Solution code:
print(len(set(input().split())))

Submission status: Accepted

Solution code:
al = list(map(int, input().split()))
print(len(set(al)))

Submission status: Accepted

Solution code:
a = list(input().split())
print(len(set(a)))

Submission status: Accepted

Solution code:
a=set(input().split())
print(len(a))

Submission status: Accepted

Solution code:
abc=list(map(int , input().split()))
count=0
for i in range(0,len(abc)-1):
    abc.sort()
    if(abc[i] != abc[i+1]):
        count+=1
        
        
    
    
print(count+1)

Submission status: Accepted

Solution code:
print(len(set(map(int, input().split()))))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(len(set([a,b,c])))

Submission status: Accepted

Solution code:
abc = list(map(int,input().split()))
set_abc = set(abc)
print(len(set_abc))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
m = set([a, b, c])
print(len(m))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a == b == c:
    print(1)
elif a == b or b == c or c == a:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
abc=list(map(int,input().split()))
print(len(set(abc)))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b and b == c:
    print(1)
elif a == b and b != c:
    print(2)
elif a != b and b == c:
    print(2)
elif a == c and a != b:
    print(2)
elif a != b and b != c:
    print(3)

Submission status: Accepted

Solution code:
print(len(set(list(map(int,input().split())))))

Submission status: Accepted

Solution code:
a,b,c = map( int, input().split())
if a == b == c :
    print(1)
elif a!=b==c or b!=c==a or c!=a==b :
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
paint_list = input().split()
print(len(set(paint_list)))

Submission status: Accepted

Solution code:
print len(set(raw_input().split()))

Submission status: Accepted

Solution code:
#
# abc046 a
#

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3 1 4"""
        output = """3"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """3 3 33"""
        output = """2"""
        self.assertIO(input, output)


def resolve():
    a, b, c = map(int, input().split())

    ans = 0
    if a == b == c:
        print("1")
    elif a == b or b == c or c == a:
        print("2")
    else:
        print("3")


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
str_line = input().split(" ")
num_line = [int(n) for n in str_line]

num_line.sort()
num_list = [num_line[0]]
for i in range(1,len(num_line)):
    if num_line[i] != num_line[i-1]:
        num_list.append(num_line[i])

#print(num_list)
print(len(num_list))

Submission status: Accepted

Solution code:
a,b,c=input().split()
ls=[a,b,c]
ls.sort()
if ls[0]==ls[1]==ls[2]:
  print("1")
else:
  if ls[0]==ls[1]:
    print("2")
  else:
    if ls[1]==ls[2]:
      print("2")
    else:
      print("3")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
l = list(map(int, input().split()))
l = set(l)
print(len(l))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 3

if a == b == c:
    print(1)
    exit()
if a == b:
    count -=1
if a == c:
    count -=1
if b == c:
    count -=1
print(count)

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

print(len(set(l)))

Submission status: Accepted

Solution code:
penki=list(map(int,input().split()))
ans=len(set(penki))
print(ans)

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
print(len(set(l)))

Submission status: Accepted

Solution code:
import numpy as np
array = list(map(int, input().split(' ')))
print(len(np.unique(array)))

Submission status: Accepted

Solution code:
def main():
    c = list(map(int, input().split()))

    c_set = set(c)
    print(len(c_set))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
C=list(map(int,input().split()))
C=set(C)
print(len(C))

Submission status: Accepted

Solution code:
paint_list = set(map(int,input().split()))
print(len(paint_list))

Submission status: Accepted

Solution code:
paint_list = map(int,input().split())
print(len(set(paint_list)))

Submission status: Accepted

Solution code:
print(len(set([int(i) for i in input().split()])))

Submission status: Accepted

Solution code:
s = set(map(int, input().split()))
print(len(s))

Submission status: Accepted

Solution code:
s = list(input().split())
print(len(set(s)))

Submission status: Accepted

Solution code:
l = set(list(map(int, input().split())))
print(len(l))

Submission status: Accepted

Solution code:
def main():
    color = set(input().split())
    print(len(color))

if __name__ == '__main__':
    main()

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():
    ans = len(set(LI()))
    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
count = 0
if a!=b and a!=c: 
    if b!=c: 
        count = 3
    elif b==c: 
        count = 2
else:
    if a==b or a==c:
        count+=1
    if b!=c:
        count+=1
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = 1

if(a != b and a != c):
    ans += 1
if(b != c):
    ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif a == b or b == c or c == a:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
p_list = [int(x) for x in input().split()]
print(len(set(p_list)))

Submission status: Accepted

Solution code:
# A - AtCoDeerくんとペンキ
def main():
    abc = list(map(int, input().split()))

    print(len(set(abc)))


if __name__ ==  "__main__":
    main()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
dic = {}
for i in range(len(a)):
    dic.setdefault(a[i],0)
    dic[a[i]]+=1
print(len(dic))

Submission status: Accepted

Solution code:
Set = {int(x) for x in input().split()}
print(len(Set))

Submission status: Accepted

Solution code:
sample = input()
sample_list = sample.split(" ")
count = 0
flag = 0
i = 0
j = 1
for i in range(len(sample_list)):
  for j in range(i):
    if sample_list[i] == sample_list[j]:
      flag = 1
  if flag == 0:
    count += 1
  flag = 0
print(count)

Submission status: Accepted

Solution code:
j = (input())

x = j.split()
y = []

for i in x:
  if(i not in y):
    y.append(i)
print(len(y))

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
from collections import Counter
abc2 = Counter(abc).most_common()
print(len(abc2))

Submission status: Accepted

Solution code:
l = set(map(int, input().split()))
print(len(l))

Submission status: Accepted

Solution code:

def main():
    N = map(int, input().split())
    print(len(set(N)))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
cnt=3

if a==b:
    cnt-=1

if b==c:
    cnt-=1

if c==a:
    cnt-=1

if a==b==c:
    cnt+=1

print(cnt)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
print(len(set(a)))

Submission status: Accepted

Solution code:
S = set(input().split())
print(len(S))

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
a = set(a)
print(len(a))

Submission status: Accepted

Solution code:
list = list(map(int,input().split()))

counter = 0

for i in range(len(list)):
    if list[i] in list[i+1:]:
        continue
    else:
        counter += 1

print(counter)

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
print(len(set(l)))

Submission status: Accepted

Solution code:
print(len(set(map(int,input().split()))))

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

ans = 0
if (a != b and a != c and b != c):
    ans = 3
elif (a == b and a == c and b == c):
    ans = 1
else:
    ans = 2
print(ans)

Submission status: Accepted

Solution code:
a = set(input().split())
print(len(a))

Submission status: Accepted

Solution code:
colors = list(map(int,input().split()))
print(len(set(colors)))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

if a == b == c:
  	print(1)
elif a == c or a == b or b == c:
  	print(2)
else:
  	print(3)

Submission status: Accepted

Solution code:
abc = list(input().split())
print(len(set(abc)))

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
if a == b == c:
  print(1)
else:
  if a == b or b == c or c == a:
    print(2)
  else:
    print(3)

Submission status: Accepted

Solution code:
lst = list(map(int, input().split()))
print(len(set(lst)))

Submission status: Accepted

Solution code:
colors = list(map(int, input().split()))

kinds = len(set(colors))
print(kinds)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

if a==b==c:
    print(1)
elif a!=b and a!=c and b!=c:
    print(3)
else:
    print(2)

Submission status: Accepted

Solution code:
abc=sorted(list(map(int,input().split())))
if abc[0]==abc[2]:
    print(1)
elif abc[0]==abc[1] or abc[1]==abc[2]:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
penkis = list(map(int, input().split()))
print(len(set(penkis)))

Submission status: Accepted

Solution code:
abc = set([int(i) for i in input().split()])
print(len(abc))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif a == b and b != c:
    print(2)
elif a == c and c != b:
    print(2)
elif b == c and c != a:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
s = input()
l = s.split()
 
 
count = 6
 
if l[0] == l[1]:
  count -= 1
if l[1] == l[2]:
  count -= 1
if l[2] == l[0]:
  count -= 1
  
print(int(count/2))

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

a,b,c = I()
print(len(list(set([a,b,c]))))

Submission status: Accepted

Solution code:
L=list(map(int,input().split()))
print(len(set(L)))

Submission status: Accepted

Solution code:
l = map(int, input().split())
s = set(l)
print(len(s))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())


if a == b and b == c:
    print(1)
elif a == b:
    print(2)
elif b == c:
    print(2)
elif a == c:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

from collections import Counter
c = Counter(MAP())
print(len(c.keys()))

Submission status: Accepted

Solution code:
a = input().strip().split(" ")
lst = []
for i in range(len(a)):
    lst.append(int(a[i]))
b = set(lst)
print(len(b))

Submission status: Accepted

Solution code:
print(len(list(set(list(map(lambda n: int(n), input().split(" ")))))))

Submission status: Accepted

Solution code:
from sys  import stdin,stdout

import bisect

import math

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")

def soe(limit):
    l=[1]*(limit+1)
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0

    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a,b=b,a%b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r

    
def solve():
    l=li()
    s=set(l)
    print(len(s))
for _ in range(1):
    solve()

Submission status: Accepted

Solution code:
import collections
a,b,c =map(int,input().split())
ls = [a,b,c]
counter = collections.Counter(ls)
print(len(counter))

Submission status: Accepted

Solution code:
list = input().split()
print(len(set(list)))

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
print(len(set(x)))

Submission status: Accepted

Solution code:
inp=list(map(int,input().split()))
l = [0] * 100
for i in inp:
    l[i-1]+=1
if 2 in l:
    print(2)
elif 3 in l:
    print(1)
else:
    print(3)

Submission status: Accepted

Solution code:
import collections
l=input().split()

c = collections.Counter(l)

print(len([i[0] for i in c.items() if i[1] >= 1]))

Submission status: Accepted

Solution code:
s = set(input().split())
print(len(s))

Submission status: Accepted

Solution code:
a, b, c = input().split()
colors = 0
if a == b and b == c:
  colors = 1
elif a == b or b == c or c == a:
  colors = 2
else:
  colors = 3
print(colors)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b == c:
    print(1)
elif a == b != c or a == c != b or b == c != a:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
mylist = list(map(int,input().split()))
mylist = list(dict.fromkeys(mylist))
print(len(mylist))

Submission status: Accepted

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

def main():

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

    color = {a, b, c}

    ans = len(color)

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
print(len(list(set(l))))

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
b=set(a)
print(len(b))

Submission status: Accepted

Solution code:
from collections import Counter

abc=list(map(int,input().split()))
c=Counter(abc)
print(len(c))

Submission status: Accepted

Solution code:
st=set(input().split())
print(len(st))

Submission status: Accepted

Solution code:
print(len(set(list(map(int, input().split())))))

Submission status: Accepted

Solution code:
x = set(map(int, input().split()))
print(len(x))

Submission status: Accepted

Solution code:
col=list(map(int,input().split()))
col_uni=set(col)
print(len(col_uni))

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
s = set(li)

print(len(s))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    P = set(map(int, readline().split()))

    print(len(P))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=input().split()
print(len(set(a)))

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())
a, b, c = M()
l = [0]*101
l[a] = 1
l[b] = 1
l[c] = 1
print(sum(l))

Submission status: Accepted

Solution code:
def resolve():
    paint_color_list = input().split()
    print(len(set(paint_color_list)))

resolve()

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

print(len(set([a,b,c])))

Submission status: Accepted

Solution code:
import sys
A = list(map(int,sys.stdin.readline().rstrip().split()))
print(len(set(A)))

Submission status: Accepted

Solution code:
List = list(map(int, input().split()))
s= set(List)
print(len(s))

Submission status: Accepted

Solution code:
import sys
import math
from functools import reduce
import bisect


def getN():
    return int(input())


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


def getList():
    return list(map(int, input().split()))


def input():
    return sys.stdin.readline().rstrip()


# input = sys.stdin.buffer.readline

def index(a, x):
    i = bisect.bisect_left(a, x)
    if i != len(a) and a[i] == x:
        return i
    return False


#############
# MAIN CODE #
#############

a, b, c = getNM()
print(len({a, b, c}))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b and b==c:
    print(1)
    exit()
elif a==b and a!=c:
    print(2)
    exit()
elif b==c and c!=a:
    print(2)
    exit()
elif c==a and a!=b:
    print(2)
    exit()
else:
    print(3)

Submission status: Accepted

Solution code:
s=set(map(int,input().split()))

print(len(s))

Submission status: Accepted

Solution code:
s=set(map(int,input().split()))

print(len(s))

Submission status: Accepted

Solution code:
abc=list(set(list(map(int,input().split()))))
print(len(abc))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
 
l=sum([a==b,b==c,c==a])
print([3,2,0,1][l])

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x in input().split())
if a == b:
  if a == c:
    print (1)
  else:
    print (2)
else:
  if a == c:
    print (2)
  else:
    if b == c:
      print (2)
    else:
      print (3)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
s = set([a, b, c])
print(len(s))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
i=0
if a!=b:
    i+=1
if a!=c:
    i+=1
if b!=c:
    i+=1
if i==0:
    i+=1
print(i)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
if a[0]==a[1]==a[2]:
  print(1)
else:
  if a[0]==a[1] or a[1]==a[2] or a[2]==a[0]:
    print(2)
  else:
    print(3)

Submission status: Accepted

Solution code:
def main():
    paints = list(map(int, input().split()))
    ans = len(set(paints))
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
colors = []
colors.append(a)
colors.append(b)
colors.append(c)
print(len(set(colors)))

Submission status: Accepted

Solution code:
from collections import Counter
count = list(map(int, input().split()))
count = Counter(count)
print(len(count))

Submission status: Accepted

Solution code:
print(len(set(list(input().split()))))

Submission status: Accepted

Solution code:
Array= list(input().split())
print(len(set(Array)))

Submission status: Accepted

Solution code:
arr = list(map(int, input().split()))
arr = set(arr)
print(len(arr))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

print(len({a, b, c}))