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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a==b==c:
    print(1)

elif li[0]==li[1] or li[1]==li[2]:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
# import numpy as np
# import math
import sys
input = sys.stdin.readline

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

s = set([a,b,c])

print(len(s))

Submission status: Accepted

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

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 = [i for i in input().split()]

print(len(set(x)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=list()
a=list(map(int,input().split()))
c=0
for x in a:
    if x not in l:
        l.append(x)
print(len(l))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(A))

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 046 - A
# -*- encoding: UTF-8 -*-
a,b,c = map(int, input().split())

colors = {}

colors[a] = 1

if b in colors :
  colors[b] = 2
else :
  colors[b] = 1

if c in colors :
  colors[c] = colors[c] + 1
else :
  colors[c] = 1

print(len(colors))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(p))

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
l=[]
for i in range(len(a)):
	if not a[i] in l:
		l.append(a[i])
print(len(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
 
def main(argv=sys.argv):
  
  set1 = set(input().split())
  print(len(set1))
  
  return 0
 
 
if __name__ == '__main__':
  sys.exit(main())

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):

    colors = input().split(' ')

    print(len(set(colors)))
    
    return 0


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

p = [int(x) for x in input().split()]
c = collections.Counter(p)
print(len(c))

Submission status: Accepted

Solution code:
# # -*- coding: utf-8 -*-
a_b_c = set(map(int, input().split()))
print(len(a_b_c))

Submission status: Accepted

Solution code:
s = input().split()
ans = {}
for ss in s:
  ans[ss] = 1
print(len(ans))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

A = list(map(int, input().split()))

R = 0
while len(A) > 0:
    A = [a for a in A if a != A[0]]
    R += 1

print(R)

Submission status: Accepted

Solution code:
a = set(list(map(int, input().split())))
print(len(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 a==c:
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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')
ans = 0 ;count = 0 ;pro = 1

s=set()
a,b,c=map(int,input().split())
s.add(a)
s.add(c)
s.add(b)
print(len(s))

Submission status: Accepted

Solution code:
import math

a = set(input().split())
print(len(a))

Submission status: Accepted

Solution code:
import sys

a = set(map(int, sys.stdin.readline().split()))
print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

print(max(1, (a != b) + (b != c) + (c != a)))

Submission status: Accepted

Solution code:
se = {int(i) for i in input().split()}

print(len(se))

Submission status: Accepted

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

Submission status: Accepted

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

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:
l = len(set(map(int, input().split())))
print(l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力

ans = 0

dic={}
for i in [int(a) for a in input().split()]:
    dic[i]=1
print(len(dic))

Submission status: Accepted

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

b = []
cnt = 0
for _a in a:
    if not _a in b:
        b.append(_a)
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

paints = sys.stdin.readline().split()

def main():
    ans = len(set(paints))
    return ans

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
paint = list(map(int, input().split()))
paint_unique = set(paint) # paintから重複した要素を削除

num_element = len(paint_unique) # 重複を削除したリストの要素数
print(str(num_element))

Submission status: Accepted

Solution code:
# 入力値をリスト->setにすると、重複排除できる。
# 
penki = set(list(map(int, input().split())))
print(len(penki))

Submission status: Accepted

Solution code:
c = list(input().split())
ans = len(set(c))
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:
a=input().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(li)))

Submission status: Accepted

Solution code:
abc = set(input().split())

print(len(abc))

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
import collections
print(len(collections.Counter(input().split())))

Submission status: Accepted

Solution code:
import collections
print(len(collections.Counter(input().split())))

Submission status: Accepted

Solution code:
import collections
print(len(collections.Counter(input().split())))

Submission status: Accepted

Solution code:
# 
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c = nm()
d = set()
d.add(a)
d.add(b)
d.add(c)

print(len(d))

Submission status: Accepted

Solution code:
n = list(int(x) for x in input().split(' '))

ans = set(n)
print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(list(set(lis))))

Submission status: Accepted

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

a.sort()

count = 1

if a[0] != a[1]:
    count += 1

if a[1] != a[2]:
    count += 1

print(count)

Submission status: Accepted

Solution code:
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")
elif a==b and b!=c:
    print("2")
elif a==c and c!=b:
    print("2")
elif c==b and a!=c:
    print("2")

Submission status: Accepted

Solution code:
from sys import stdin

li = list(map(int,stdin.readline().rstrip().split()))

li = list(set(li))

print(len(li))

Submission status: Accepted

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

lis = [a,b,c]
lis_count = int(len(set(lis)))

print(lis_count)

Submission status: Accepted

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

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

Submission status: Accepted

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

countlis=[a,b,c]
newlis=[]
for i in range(1,101):
    newlis.append(countlis.count(i))
cnt=0
for j in range(100):
    if newlis[j]>=1:
        cnt+=1

print(cnt)

Submission status: Accepted

Solution code:
# ABC046a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

print(len(set(map(int, input().split()))))

Submission status: Accepted

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


print(len(set(s)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

P=np.asarray(list(map(int,input().split(" "))))

print(len(np.unique(P)))

Submission status: Accepted

Solution code:
import math
from string import ascii_lowercase
 
line = input()
a, b, c = [int(x) for x in line.split()]
 
d = set((a, b, c))
print(len(d))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = map(int,input().split())
dic ={}
ans = 0
for p in a:
  if p in dic:
    continue
  dic[p]=1
  ans+=1
  
print(ans)

Submission status: Accepted

Solution code:
ans = set()
[ans.add(a) for a in list(map(int,input().split()))]
print(len(ans))

Submission status: Accepted

Solution code:
#ABC046_A

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

#処理内容
nums = getlist()

n = set(nums)

print(len(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M,K = map(int,input().split())
sum = 3
if (N == M or M == K or N == K) and not(N == M and M == K):
  sum = 2
elif N == M and M == K:
  sum = 1
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
paint = [int(item) for item in input().split()]
kind = len(set(paint))
print(kind)

Submission status: Accepted

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

Submission status: Accepted

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


# スペース区切りの整数の入力
a, b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
i,j,k,l = 0,0,0,0
if a == b:
    i = 1
if b == c:
    j = 1
if c == a:
    k = 1
if a == b & b == c:
    l = -1
print(3-(i+j+k+l))

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x in input().split())
list= [a,b,c]
print(len(set(list)))

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())
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:
a,b,c=map(int,input().split())
print("1" if (a==b==c) else "2" if (a==b!=c or a==c!=b or c==b!=a) else "3" )

Submission status: Accepted

Solution code:
a={int(i) for i in map(int, input().split())}

print(len(a))

Submission status: Accepted

Solution code:
# python3 (3.4.3)
import sys
input = sys.stdin.readline

# main
A,B,C = map(int,input().split())

print(len({A,B,C}))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    abc = LI()
    abc = set(abc)
    print(len(abc))


import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

l = [0] * 3

l[0] = a
l[1] = b
l[2] = c

k = [0] * 3

k[0] = l.count(a)
k[1] = l.count(b)
k[2] = l.count(c)

t = max(k)

if t == 1:
	t = 3
elif t ==3:
	t = 1
else:
	pass


print(t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
K = 1
if A != B:
    K = K + 1
else:
    pass
if A != C:
    if B != C:
        K = K + 1
    else:
        pass
else:
    pass
print(int(K))

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
#入力
a = list(map(int,input().split()))
b = set(a)

print(len(b))

Submission status: Accepted

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

Submission status: Accepted

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

    # print(lis)

    def unique_list(seq):
        _set = set()
        set_add = _set.add
        return [x for x in seq if x not in _set and not set_add(x)]

    return len(unique_list(lis))


if __name__ == '__main__':
    res = solve()
    print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

abc = list(map(int, input().split()))

print(len(set(abc)))

Submission status: Accepted

Solution code:
# A - AtCoDeerくんとペンキ / AtCoDeer and Paint Cans
paints = [int(s) for s in input().split()]
print(len(set(paints)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())

s = set()
s.add(a)
s.add(b)
s.add(c)

print(len(s))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
a, b, c = map(int, input().split())
if a != b:
    if a != c and b != c:
        print(3)
    else:
        print(2)
else:
    if a != c and b != c:
        print(2)
    else:
        print(1)

Submission status: Accepted

Solution code:
colors = [color for color in input().split()]
colors.sort()

first = colors[0]

current = first
count = 1
for i in range(1, 3):
    if colors[i] != current:
        count += 1
        current = colors[i]

print(count)

Submission status: Accepted

Solution code:
colors = [color for color in input().split()]

print(len(set(colors)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(abc)))

Submission status: Accepted

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

Submission status: Accepted

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

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:
l = input().split()
color = set(l)
print(len(l) if len(color) == len(l) else len(color))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i_list = input().split()
uni_list = set(i_list)

print(str(len(uni_list)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
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())
s = set([a,b,c])

print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

total=set(c)
print(len(total))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    colors = set(input().split())
    print(len(colors))

Submission status: Accepted

Solution code:
d = list(map(int,input().split()))
a=d[0]
b=d[1]
c=d[2]

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

Submission status: Accepted

Solution code:
penki = [int(_) for _ in input().split()]
p = set(penki)
print(len(p))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
l = list(input().split())

print(len(set(l)))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
A=a.split()
ans=3
if A[0]==A[1] or A[1]==A[2] or A[0]==A[2]:
  ans-=1
if A[0]==A[1]==A[2]:
  ans-=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(abc)))

Submission status: Accepted

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

print(len(set(S)))

Submission status: Accepted

Solution code:
[a,b,c]=list(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:
paint = input().split(" ")
print(len(set(paint)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
count=defaultdict(lambda: 0)
a,b,c=list(map(int,input().split(" ")))
count[a]+=1
count[b]+=1
count[c]+=1
print(len(count.keys()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(color)))

Submission status: Accepted

Solution code:
def slove():
    import sys
    import collections
    input = sys.stdin.readline
    abc = list(map(int, input().rstrip('\n').split()))
    abc = collections.Counter(abc).most_common()
    print(len(abc))


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=[int(i) for i in 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 sys

input = sys.stdin.readline


def main():
    print(len(set(input().split())))


if __name__ == "__main__":
    main()

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

ans = 1


if b != a:
    ans += 1
else:
    pass

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

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:
list_color = list(map(int, input().split(" ")))
print(len(set(list_color)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
paints = input().split()
set_paints = set(paints)
print(len(set_paints))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019/09/25
N = input().split()
print(len(set(N)))

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')


a=list(map(str,input().split()))

print(len(set(a)))

Submission status: Accepted

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

from collections import Counter

a, b, c = map(int, input().split())
c = Counter((a, b, c))
ans = len(c)
print(ans)

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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    a=LIST()
    s=set(a)
    print(len(s))
if __name__ == '__main__':
    do()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
input_ = input().split()

type = len(set(input_))

print(type)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  colors = [int(x) for x in raw_input().split()]
  print(len(set(colors)))

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

ABC = list(input().split())
print(len(Counter(ABC)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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