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:
a, b, c = map(int, input().split())
ans = [a]
if b in ans:
  pass
else:
  ans.append(b)
  
if c in ans:
  pass
else:
  ans.append(c)
  
print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Cans = 0

if a == b:
    Cans += 1
    if b != c:
        Cans += 1

if a != b:
    Cans += 2
    if a != c and b != c:
        Cans += 1

print(Cans)

Submission status: Accepted

Solution code:
a, b, c = [int(s) for s in input().split()]
cntA = 3
cntB = 3
if a == b:
    cntA -= 1
if a == c:
    cntA -= 1
if b == c:
    cntB -= 1

print(min(cntA, cntB))

Submission status: Accepted

Solution code:
a=input().split()
if a.count(a[0])>1:
    answer=4-a.count(a[0])
else:
    answer=4-a.count(a[1])
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(a)
# print(b)
# print(c)

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

print(len(x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a = f()
    print(len(set(a)))

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###template###
import sys
input = sys.stdin.readline
def mi(): return map(int, input().split())
###template###

abc = set(mi())

print(len(abc))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] == l[1] and l[1] == l[2]:
    s = s + 1
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a == b and a == 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = 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())
t = set([a,b,c])
print(len(t))

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())
d = 0
ans = 3
if a == b:
    d += 1

if a == c:
    d += 1

if b == c:
    d += 1
if d == 3:
    d = 2

print(ans - d)

Submission status: Accepted

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

answer=set(x)

print(len(answer))

Submission status: Accepted

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

count=0
n=len(x)

#選択ソート
for i in range(n):
	for j in range(i+1,n):
		if x[i]!=x[j]:
			count+=1


if count==0:
	count+=1


print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - AtCoDeerくんとペンキ / AtCoDeer and Paint Cans
https://abc046.contest.atcoder.jp/tasks/abc046_a

"""
import sys


def solve(colors):
    return len(set(colors))


def main(args):
    colors = input().split()
    ans = solve(colors)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

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

Submission status: Accepted

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

# スペース区切りの整数の入力
list_num = [int(num) for num in input().split()]

# 計算と出力
print(len(list(set(list_num))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = sorted(map(int,input().split(" ")))
if x[0] == x[2]:
  print(1)
elif x[0] == x[1] or x[1] == x[2]:
  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 a==c:
  print(2)
else:
  print(3)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if a == b and a == 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())

l=[a,b,c]

print(len(set(l)))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
penki = input().rstrip().split(' ')
penki.sort(key=int,reverse=False)

K = 0

for i in range(3):
    temp = penki[i]
    if i == 0:
        K += 1
    elif i > 0 and penki[i-1] == temp:
        pass
    else:
        K += 1

print(K)

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
    list = [int(x) for x in input().split()]
    list = set(list)

    print(len(list))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import collections
L = [int(i) for i in input().split()]

c = collections.Counter(L)
print(len(c))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
num = [0]*101
num[a] += 1
num[b] += 1
num[c] += 1

ans = 0
for i in num:
    if i > 0:
        ans += 1
    
print(ans)

Submission status: Accepted

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


def submit():
    a, b, c = read_input()

    d = {}
    d[a] = 1
    d[b] = 1
    d[c] = 1

    print(len(d))

if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def solve(a, b, c):
    A = []
    A.append(a)
    A.append(b)
    A.append(c)
    print(len(set(A)))
                
if __name__ == '__main__':
    a, b, c = map(int, input().split())

    solve(a, b, c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))
b=3
if a[0]==a[1]:
  b-=1
if a[1]==a[2]:
  b-=1
if a[0]==a[2]:
  b-=1
if b==0:
  b+=1
print(b)

Submission status: Accepted

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

s = set(map(int, input().split()))

print(len(s))

Submission status: Accepted

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

n = set(map(int, input().split()))

print(len(n))

Submission status: Accepted

Solution code:
a,b,c=(int(x) for x in input().split())

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

Submission status: Accepted

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

a, b, c = map(int, input().split())
color = [a, b, c]
color_unique = set(color)
print(len(color_unique))

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 sys

def main():
    input = sys.stdin.readline
    A = list(map(int, input().split()))

    return len(set(A))


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

Submission status: Accepted

Solution code:
# ABC046A - AtCoDeerくんとペンキ / AtCoDeer and Paint Cans
print(len(set(list(map(int, input().rstrip().split())))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
cnt = 3
if li[0] == li[1]:
	cnt -= 1
if li[0] == li[2]:
	cnt -= 1
if li[1] == li[2]:
	cnt -= 1
if li[0] == li[1] and li[1] == li[2]:
	cnt = 1
print(cnt)

Submission status: Accepted

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

if(s[0] == s[1] and s[1] == s[2]):
    print(1)
elif(s[0] == s[1] or s[1] == s[2] or s[0] == s[2]):
    print(2)
else:
    print(3)

Submission status: Accepted

Solution code:
a,b,c = list(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 and a!=c and b!=c:
    print(3)
else:
    print(2)

Submission status: Accepted

Solution code:
from collections import Counter
CO = list(map(int, input().split()))
CNT = Counter(CO)
CNTL = list(CNT.keys())
N = len(CNTL)
print (N)

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 = list(map(int,input().split()))

print(len(set(A)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

Solution code:
from sys import stdin
input=stdin.readline().rstrip().split()
input=list(set(input))
print(len(input))

Submission status: Accepted

Solution code:
p = list(map(int,input().split()))
if p[0] != p[1] and p[1] != p[2] and p[2] != p[0]:
  print(3)
elif p[0] == p[1] == p[2]:
  print(1)
else:
  print(2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
dic={}
dic[a]=1
dic[b]=1
dic[c]=1
print(len(list(dic)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c =map(int, open(0).read().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:
s = input().split()
myset = set([])
myset.add(s[0])
myset.add(s[1])
myset.add(s[2])
m = len(myset)
print(m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = [a, b, c]
y = []
for i in x:
    if i not in y:
        y.append(i)

print(int(len(y)))

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:
def atcodeer_and_paint_cans(a: int, b: int, c: int) -> int:
    return len(set([a, b, c]))


if __name__ == "__main__":
    a, b, c = map(int, input().split())
    ans = atcodeer_and_paint_cans(a, b, c)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()
arr = map(int, line.split())
motteru = dict.fromkeys(arr, 0)
print(len(motteru))

Submission status: Accepted

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

print(len(set(abc)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
ans=3
if a[0]==a[1] and a[1]==a[2]:
  ans=1
else:  
  for i in range(0,2):
    for j in range(i+1,3):
      if a[i]==a[j]:
        ans = 2
        break
      else:
        j += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

a, b, c = MAP()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(set(lis_x)))

Submission status: Accepted

Solution code:
import collections
from functools import reduce

def main():
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10

    # 1文字のみを読み込み
    # s = input().rstrip()
    
    # スペース区切りで標準入力を配列として読み込み
    # s = input().rstrip().split(' ')

    # 1文字ずつ標準入力を文字列として読み込み
    # s = list(input().rstrip())
    
    # 位置文字ずつ標準入力を数値配列として読み込み
    # X = [int(_) for _ in input().split()]
    X = [int(_) for _ in input().split()]
    if X[0] == X[1] and X[0] == X[2] and X[1] == X[2]:
        ans = 1
    elif X[0] == X[1] or X[0] == X[2] or X[1] == X[2]:
        ans = 2
    else:
        ans = 3
    print(ans)


    # c = collections.Counter(X)
    # print(c.most_common()[0][1])
        
   
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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:
list=[]
a,b,c=map(int,input().split())
list.append(a)
list.append(b)
list.append(c)
print(len(set(list)))

Submission status: Accepted

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

b = set(a)
print(len(b))

Submission status: Accepted

Solution code:
import collections
a = list(input().split())
m = collections.Counter(a)
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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    s = LI()
    s = list(set(s))
    print(len(s))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a.count(a[1])==3:
  print(1)
  
elif a.count(a[1])==2:
  print(2)
  
elif a.count(a[1])==1 and a.count(a[2])==1:
  print(3)
  
else:
  print(2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
print(len(Counter(int(s) for s in input().split())))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = [int(x) for x in input().split()]
li.sort()
ans = 1
ans += 1 if li[1]!=li[0] else 0
ans += 1 if li[2]!=li[1] else 0
print(ans)

Submission status: Accepted

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

print(len(list(set(a))))

Submission status: Accepted

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

abc = list(map(int, input().split()))
count = (len(abc) + len(set(abc))) - 3
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
color = list(map(int, input().split()))

print(len(list(set(color))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#46
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:
abc=list(map(int,input().split()))
d=[]
for i in abc:
    if i not in d:
        d.append(i)
print(len(d))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
a, b, c = map(int, input().split())
kind = 0
if a != b:
    kind += 1
if a != c:
    kind += 1
if b != c:
    kind += 1
print(kind if kind != 0 else 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main() -> None:
    a, b, c = map(int, input().split())
    l = [a, b, c]
    t = set(l)
    print(len(t))


if __name__ == '__main__':
    main()

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 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 = input().split()
print(len(list(set(l))))

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())
li = [a, b, c]
print(len(set(li)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019-3-11 18:29
num = 0
a, b, c = map(int, input().split())
if a == b and a == c and b == c:
	num = 1
elif a != b and a != c and b != c:
	num = 3
else:
	num = 2

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

	ans = 1
	if a != b:
		ans = ans + 1
	if a != c and b != c:
		ans = ans + 1

	print(ans)

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
from sys import stdin
l = [int(x) for x in stdin.readline().rstrip().split()]
print(len(set(l)))

Submission status: Accepted

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

Submission status: Accepted

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

l = list(input().split())
c = collections.Counter(l)
print(len(c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

checked = [False]*100

for i in range(3):
    checked[penki[i]-1]=True

ans = checked.count(True)

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 and b!=c and a!=c : print(3)
else:print(2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
res=0
for i in range(100):
  if A.count(i+1)==2:
    print(2)
    res+=1
  elif A.count(i+1)==3:
    print(1)
    res+=1
if res==0:
  print(3)

Submission status: Accepted

Solution code:
# ABC 046 A - AtCoDeerくんとペンキ / AtCoDeer and Paint Cans
print(len(set(map(int,input().split()))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=sorted(list(map(int,input().split())))
print(4-A.count(A[1]))

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

if sum(li)/len(li) == li[0]:
  print(1)
  exit()
else:
  for i in range(len(li)):
    for j in range(i,len(li)):
      if li[i] != li[j]:
        count += 1
print(count)

Submission status: Accepted

Solution code:

ans = len(set(map(int, input().split())))

print(ans)

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 or b==c or a==c:
    print(2)
else:
    print(3)