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

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)

else:
    print(3)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if abc[0]==abc[1]==abc[2]:
    print("1")
elif abc[0]==abc[1] or abc[1]==abc[2] or abc[2]==abc[0]:
    print("2")
else:
    print("3")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

checklist = []
for i in list:
    if i not in checklist:
        checklist.append(i)
print(len(checklist))

Submission status: Accepted

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

c = set(s)
print(len(c))

Submission status: Accepted

Solution code:
import collections

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

print(len(collections.Counter(pen)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(_) for _ in input().split()]
if all(1 <= i <= 100 for i in a):
    a.sort();print(1 if a[0] == a[1] == a[2] else 2 if a[0] == a[1] or a[1] == a[2] else 3)
else:
    print('hoge!')

Submission status: Accepted

Solution code:
N = input().split()
colors = []
for i in range(len(N)):
    if N[i] not in colors:
        colors.append(N[i])
print(len(colors))

Submission status: Accepted

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

Submission status: Accepted

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

num_list = [0 for i in range(101)]
num_list[a] = num_list[b] = num_list[c] = 1
print(sum(num_list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

mod = 10 ** 9 + 7

li = na()
c = Counter(li)
print(len(c.keys()))

Submission status: Accepted

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

A.sort()

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = list(map(int, input().split()))
    if a == b:
        if a == c:
            print(1)
        else:
            print(2)
    elif a == c:
        print(2)
    elif b == c:
        print(2)
    else:
        print(3)
    
    pass
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# A - AtCoDeerくんとペンキ / AtCoDeer and Paint Cans

A = list(map(str, input().split()))
count = 0
for i in range(len(A)-1):
    if A[i] != A[i+1]:
        count += 1
    else:
        pass
if A[0] != A[2]:
    count += 1
else:
    pass
if A[0] == A[1] ==A[2]:
    count = 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
List = [int(i) for i in input().split()]
print(len(set(List))) #{33, 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:
s = set(map(int,input().split()))
print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(ans)))

Submission status: Accepted

Solution code:
def main():

    a, b, c = map(int, input().split())
    A = set([a, b, c])
    return len(A)

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

Submission status: Accepted

Solution code:
import argparse
from sys import stdin

"""
parser = argparse.ArgumentParser()
# パーサーを作る
parser = argparse.ArgumentParser(
            prog='a', # プログラム名
            usage='Count paint number', #プログラムの利用方法
            description='Description', # 引数のヘルプの前に表示
            epilog='end', # 引数のヘルプの後で表示
            add_help=True, # -h/–help オプションの追加
            )
 
# 引数の追加
parser.add_argument('infile', help='inputfile',
                    type=argparse.FileType('r'))
 
# 引数を解析する
args = parser.parse_args()
 
message = args.infile.read()
args.infile.close();

parser.add_argument('arg1', help='input flie name')

a = message[0]
b = message[1]
c = message[2]
"""

a, b, c = [int(x) for x in stdin.readline().rstrip().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 or b==c or c==a:
  if a==b==c:
    out = 1
  else:
    out = 2
else:
  out = 3
print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 a==c!=b:
	print(2)
elif a!=b!=c:
	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:
s = {int(i) for i in input().split()}
print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

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

elif (a==b and b!=c) or (b==c and a!=b) or (a==c and b!=a):
    print(2)

else:
    print(3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

li = list(map(int, input().split()))
c = collections.Counter(li)

print(len(c.keys()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
line = input().split()
count = 0
if line.count(line[0])==3:
    print(1)
elif line.count(line[1])==2 or line.count(line[0])==2:
    print(2)
else:
    print(3)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:
import collections

a = input()
c = collections.Counter(a.split())

print(len(c))

Submission status: Accepted

Solution code:
import collections
a = collections.Counter(list(map(int, input().split()))).most_common()
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 a == c or b == 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:
arr = list(map(int, input().split()))

print(len(set(arr)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
cs = list(map(int, input().split()))
count = 0
arr = []
for i in range(len(cs)):
    if cs[i] not in arr:
        count += 1
    arr.append(cs[i])

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import bisect
input = sys.stdin.readline
 
def main():
    s = list(map(int,input().split()))
    s.sort()
    
    ans=1
    if(s[0]!=s[1]):
        ans+=1
    if(s[1]!=s[2]):
        ans+=1
    
    print(ans)
    
main()

Submission status: Accepted

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

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

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

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


else:
    print(3)

Submission status: Accepted

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

print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
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:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = list(input().split())
num = sorted(num)
count = 0
for i in range(2):
  if num[i] == num[i+1]:
    count += 1
print(3 - count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ptn = {}
numstr = input()
for n in numstr.split():
    ptn[n] = 1

print(len(ptn))

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:
a =list(map(int, input().split()))
ans = 0
data = []
for i in a:
	if i not in data:
		data.append(i)
		ans+=1
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

if cnt == 0:
    cnt = 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
  print(1)
else:
  print(2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

set_a = set(a)

print(len(set_a))

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, raw_input().split())

cnt = 1

if a <> b:
    cnt += 1

if b <> c and a <> c:
    cnt += 1

print cnt

Submission status: Accepted

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

unique = set(array)

print(len(unique))

Submission status: Accepted

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

cnt = 0

if a == b:
    cnt += 1

if b == c:
    cnt += 1

if c == a:
    cnt += 1

if cnt == 0:
    print(3)
elif cnt == 1:
    print(2)
elif cnt == 3:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import bisect
import math

def div(a, b):
    if a % b == 0:
        return a // b
    else:
        return (a // b) + 1

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




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(a: int, b: int, c: int):
    ret = len({a, b, c})
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(x)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
if x == y and y==z:
  print(1)
elif x == y or y == z or z ==x :
  print(2)
else:
  print(3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

# solve
if a == b and b == c:
    ans = 1
elif a == b and b != c:
    ans = 2
elif a == c and b != c:
    ans = 2
elif b == c and c != a:
    ans = 2
else:
    ans = 3

# output
print(ans)

Submission status: Accepted

Solution code:
color = set(list(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 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())
if a == b and b == c:
    print(1)
elif (a != b and b == c) or (a == b and b != c) or (a == c and c != b):
    print(2)
else:
    print(3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

l = LIST()
s = Counter(l)
# print(s)
# print(Counter(l))
print(len(s))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
lst = [A]
if B not in lst:
	lst.append(B)
if C not in lst:
	lst.append(C)
print(len(lst))

Submission status: Accepted

Solution code:

penki = input().split()

if penki[0] == penki[1] and penki[1] == penki[2]:
    print(1)

elif penki[0] == penki[1] and penki[1] != penki[2]:
    print(2)
    
elif penki[0] != penki[1] and penki[1] == penki[2]:
    print(2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = list(map(int,input().split()))
s_num = list(set(num)) #重複なし
print(len(s_num))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

dic = {}

for i in a:

    dic[i] = 1

print(len(dic))

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
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = LI()
    print(len(list(set(a))))
    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:
l=list(map(int, sorted(input().split())))
if l[0]==l[1]==l[2]:print(1)
elif l[0]!=l[1]!=l[2]!=l[0]:print(3)
else:print(2)

Submission status: Accepted

Solution code:
a = list(map(int, ("0 " + input()).split()))
b = 0
a.sort()
for i in range(1, 4):
    if a[i] != a[i-1]:
        b += 1
print(b)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
b = 1
a.sort()
for i in range(1, 3):
    if a[i] != a[i-1]:
        b += 1
print(b)

Submission status: Accepted

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

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

Submission status: Accepted

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

tup = set(list(map(int, input().split())))
print(len(tup))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(a))

Submission status: Accepted

Solution code:

int_list = list(map(int, input().split()))
s = set(int_list)
print(len(s))

Submission status: Accepted

Solution code:
dict = {}
for s in input().split():
    if s not in dict:
        dict[s] = True

print(len(dict))

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def solve():
    a, b, c = list(map(int, input().split()))
    penki_set = set()
    penki_set.add(a)
    penki_set.add(b)
    penki_set.add(c)
    print(len(penki_set))

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
nums = list(input().split())

print(len(set(nums)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
color = list(map(int, input().split()))
l = []
for c in color:
    if l.count(c) == 0:
        l.append(c)
print(len(l))

Submission status: Accepted

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

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 == c:
	print(1)
else:
	print(2)

Submission status: Accepted

Solution code:
a,b,c=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:
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 = list(map(int, input().split()))
l = [a != b, b != c, c != a].count(True)
if l == 0:
	print(1)
else:
	print(l)

Submission status: Accepted

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

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 and c != a:
	ans = 3
else :
	ans = 2 

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b, c = nl()
seen = set()
seen.add(a)
seen.add(b)
seen.add(c)
print(len(seen))

Submission status: Accepted

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

print(len(set(A)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
penki = input().split()
a = penki[0]
b = penki[1]
c = penki[2]
count = 1
if b != a:
    count +=1
if c != a and c != b:
    count +=1
print(count)

Submission status: Accepted

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

print(len(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

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

Submission status: Accepted

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

#b = int(input())
#h = int(input())
print(len(set(a)))

Submission status: Accepted

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

ans = 3

if a == b:
  if a == c:
    ans = 1
  else:
    ans = 2
elif a == c:
  ans = 2
elif b == c:
  ans = 2

print(ans)

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 abc():
    p = set(input().rstrip().split())
    print(len(p))


abc()

Submission status: Accepted

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

Submission status: Accepted

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

ans = 1


if S[0] != S[1]:
  ans += 1
  
if S[1] != S[2]:
  ans += 1

print(ans)

Submission status: Accepted

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

print(len(S))

Submission status: Accepted

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

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

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

Submission status: Accepted

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