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

X = set()
for x in [a, b, c]:
    X.add(x)
ans = len(X)

print(ans)
print()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input().split()
count=3
if s[0]==s[1]:
    count-=1
if s[1]==s[2]:
    count-=1
if s[2]==s[0]:
    count-=1
if count==0:
    count=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
li = [int(i) for i in input().split()]
print(len(set(li)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
n={}
n[a]=1
n[b]=1
n[c]=1
m=0
for i in n:
    m+=n[i]
print(m)

Submission status: Accepted

Solution code:
""" AtCoder """

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

print(len(abc))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=map(int,input().split())
ls=[]
for i in l:
     ls.append(i)
k=set(ls)
print(len(k))

Submission status: Accepted

Solution code:
l=map(int,input().split())
ls=[]
for i in l:
     ls.append(i)
k=set(ls)
n=len(k)
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(Can))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
data=defaultdict(int)
x=input().split()
for i in range(3):
    data[x[i]]+=1
print(len(data))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def execute(a, b, c):
    return len({a, b, c})


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(execute(a, b, c))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set([A,B,C])))

Submission status: Accepted

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

Submission status: Accepted

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

if a==b:
    ans-=1
if b==c:
    ans-=1
if c==a:
    ans-=1
if a==b and b==c:
    ans+=1
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:
print(len(set((int(i) for i in input().split()))))

Submission status: Accepted

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

print(len(set(a)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

x = input().split()
#y = input().split()
a = []
for i in range(len(x)):
   a.append(int(x[i]))
num = 3
if a[0] ==a[2] or a[1] ==a[0] or a[2]==a[1]:num=2
if a[0] ==a[2] and a[1] == a[2]: print(1)
else: print(num)

Submission status: Accepted

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

Submission status: Accepted

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

print(len(A.keys()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,c = map(int,input().split())
L = [a,b,c]
S = set(L)
print(len(S))

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(3-(a==b)-(b==c)-(c==a)+(a==b==c))

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:
a, b, c = [int(_) for _ in input().split()]
x = bool(a-b)+bool(b-c)+bool(c-a)
if x:
    print(x)
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 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 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 = set(int(i) for i in input().split())
print(len(l))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().strip().split(" ")

b=[int(i) for i in a]

if(b[0]==b[1]==b[2]):
    print("1")
    
elif(b[0]==b[1] or b[2]==b[1] or b[0]==b[2]):
    print("2")

else:
    print("3")

Submission status: Accepted

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

res = []
for x in inp:
    if not res.__contains__(x):
        res.append(x)

print(res.__len__())

Submission status: Accepted

Solution code:
X=input()
penki=X.split(" ")
s_penki=set(penki)
print(len(s_penki))

Submission status: Accepted

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

print(len(list(set(A))))

Submission status: Accepted

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

if a[0]==a[1]:
  if a[1] == a[2]:
    print(1)
  else:
    print(2)
else:
  if a[0]==a[2] 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())
count = 0

if a != b:
    count += 1
if a != c:
    count += 1
if b != c:
    count += 1
if count == 0:
    print('{0}'.format(1))
else:
    print(count)

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] and a[1] != a[2] and a[2] != a[0]:
  print(3)
else:
  print(2)

Submission status: Accepted

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

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())
cou = 0
if a != b:
    cou += 1
if a != c:
    cou += 1
if b != c:
    cou += 1
if a == b and b == c:
    cou += 1
print(cou)

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))
n = 1
if nums[0] != nums[1]:
	n+=1
if nums[1] != nums[2] and nums[0] != nums[2]:
	n+=1
print(n)

Submission status: Accepted

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

    ans = 0
    if a == b and b == c:
        ans = 1
    elif a == b or b == c or c == a:
        ans = 2
    else:
        ans = 3

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = (a!=b) + (b!=c) + (c!=a)

ans = 1 if ans == 0 else ans

print(ans)

Submission status: Accepted

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

cnt=3
if a==b and b==c:
    cnt=1
elif a==b or b==c or a==c:
    cnt=2

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = input().split(" ")
b = set(a)
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 or B == C or C == A:
    print('2')
else:
    print('3')

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = list(map(int, input().split()))
a = S[0]
b = S[1]
c = S[2]
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())
a = set([a,b,c])
print(len(a))

Submission status: Accepted

Solution code:
#! /usr/bin/python3
# AtCoDeerくんとペンキ / AtCoDeer and Paint Cans

"""
1≦a,b,c≦100
"""

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

if a == b:
    variety -= 1
if a == c:
    variety -= 1
elif b == c:
    variety -= 1
print(variety)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
listA = list(map(int, input().split()))
listB = []

index=0
while index < len(listA):
    if listA[index] in listB:
        pass
    else:
        listB.append(listA[index])
    index+=1
print(len(listB))

Submission status: Accepted

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

print(len(b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
print(len(set([s for s in input().split()])))

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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(set((a,b,c))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

p_cnt  =len(set(paints))

print(p_cnt)

Submission status: Accepted

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

if a*3 == 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 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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
s = set(map(int, input().split()))

print(len(s))

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

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


def main():
    print(len(set(map(int, raw_input().split()))))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


class Combination:
    def __init__(self, n, mod):

        g1 = [1, 1]
        g2 = [1, 1]
        inverse = [0, 1]
        for i in range(2, n + 1):
            g1.append((g1[-1] * i) % mod)
            inverse.append((-inverse[mod % i] * (mod // i)) % mod)
            g2.append((g2[-1] * inverse[-1]) % mod)
        self.MOD = mod
        self.N = n
        self.g1 = g1
        self.g2 = g2
        self.inverse = inverse

    def __call__(self, n, r):
        if (r < 0 or r > n):
            return 0
        r = min(r, n - r)
        return self.g1[n] * self.g2[r] * self.g2[n - r] % self.MOD


# --------------------------------------------

dp = None


def main():
    print(len(set(li_input())))


main()

Submission status: Accepted

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

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())
ans=0
if a==b:
    ans+=1
    if b!=c:
        ans+=1
else:
    ans+=2
    if c not in [a,b]:
        ans+=1
print(ans)

Submission status: Accepted

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

def main():
    arry = list(input().split())
    print(len(set(arry)))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 11 14:28:39 2018
ABC046A
@author: maezawa
"""

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

Submission status: Accepted

Solution code:

def main():
    a , b , c = map(str,(input().split(' ')))
    result = 3
    if a == b:
        result = result - 1
    if a == c:
        result = result -1
    if b == c:
        result = result - 1

    if result == 0:
        print("1")
    else:
        print(result)



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
    spam = set([a, b, c])
    print(len(spam))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(abc)))

Submission status: Accepted

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

l=set(a)

print(len(l))

Submission status: Accepted

Solution code:
bought,bought_1,bought_2 = map(int,input().split())
lis = set([bought,bought_1,bought_2])
print(len(lis))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
count=3
n.sort()
for i in range(2):
  if(n[i]==n[i+1]):
    count-=1
print(count)

Submission status: Accepted

Solution code:
a, b, c = (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:
abc = list(map(int, input().split()))
penki = {}
for i in range(3):
    if not abc[i] in penki.keys():
        penki[abc[i]] = 1
    else:
        continue
print(len(penki.keys()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
if a != b:
    count = count + 1
if a != c:
    count = count + 1
if b != c:
    count = count + 1

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

Submission status: Accepted

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

print(len(set(List)))

Submission status: Accepted

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

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

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:
        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 and a==c:
    res = 1
elif a==b or b==c or a==c:
    res = 2
else:
    res = 3

print(int(res))

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

Submission status: Accepted

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

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

print(len(set(abc)))

Submission status: Accepted

Solution code:
t=[int(i) for i in input().split()]
t.sort()
#print(t)
a=1
for j in range(1,len(t)):
    if t[j-1]<t[j]:
        a=a+1
print(a)

Submission status: Accepted

Solution code:
from collections import Counter
cs=map(int,raw_input().split())
c = Counter(cs)
print len(c)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#
# FILE: 2138-AtCoDeer_and_Paint_Cans.py
#
# @author: Arafat Hasan Jenin <opendoor.arafat[at]gmail[dot]com>
#
# LINK: https://abc046.contest.atcoder.jp/tasks/abc046_a?lang=en
#
# DATE CREATED: 17-06-18 00:09:52 (+06)
# LAST MODIFIED: 17-06-18 00:19:32 (+06)
#
# VERDICT: Accepted
#
# DEVELOPMENT HISTORY:
# Date         Version     Description
# --------------------------------------------------------------------
# 17-06-18     1.0         Deleted code is debugged code.
#
#               _/  _/_/_/_/  _/      _/  _/_/_/  _/      _/
#              _/  _/        _/_/    _/    _/    _/_/    _/
#             _/  _/_/_/    _/  _/  _/    _/    _/  _/  _/
#      _/    _/  _/        _/    _/_/    _/    _/    _/_/
#       _/_/    _/_/_/_/  _/      _/  _/_/_/  _/      _/
#
##############################################################################

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#
# FILE: 2138-AtCoDeer_and_Paint Cans.py
#
# @author: Arafat Hasan Jenin <opendoor.arafat[at]gmail[dot]com>
#
# LINK: https://abc046.contest.atcoder.jp/tasks/abc046_a?lang=en
#
# DATE CREATED: 17-06-18 00:09:52 (+06)
# LAST MODIFIED: 17-06-18 00:19:32 (+06)
#
# VERDICT: Accepted
#
# DEVELOPMENT HISTORY:
# Date         Version     Description
# --------------------------------------------------------------------
# 17-06-18     1.0         Deleted code is debugged code.
#
#               _/  _/_/_/_/  _/      _/  _/_/_/  _/      _/
#              _/  _/        _/_/    _/    _/    _/_/    _/
#             _/  _/_/_/    _/  _/  _/    _/    _/  _/  _/
#      _/    _/  _/        _/    _/_/    _/    _/    _/_/
#       _/_/    _/_/_/_/  _/      _/  _/_/_/  _/      _/
#
##############################################################################

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#
# FILE: abc046_a.py
#
# @author: Arafat Hasan Jenin <opendoor.arafat[at]gmail[dot]com>
#
# LINK: https://abc046.contest.atcoder.jp/tasks/abc046_a?lang=en
#
# DATE CREATED: 17-06-18 00:09:52 (+06)
# LAST MODIFIED: 17-06-18 00:19:32 (+06)
#
# VERDICT:
#
# DEVELOPMENT HISTORY:
# Date         Version     Description
# --------------------------------------------------------------------
# 17-06-18     1.0         Deleted code is debugged code.
#
#               _/  _/_/_/_/  _/      _/  _/_/_/  _/      _/
#              _/  _/        _/_/    _/    _/    _/_/    _/
#             _/  _/_/_/    _/  _/  _/    _/    _/  _/  _/
#      _/    _/  _/        _/    _/_/    _/    _/    _/_/
#       _/_/    _/_/_/_/  _/      _/  _/_/_/  _/      _/
#
##############################################################################

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=input().split();print([3,2,0,1][(a==b)+(b==c)+(c==a)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!C:\Users\daichi\Anaconda3/python.exe
# -*- coding: utf-8 -*-

C = input().split()
a = C[0]
b = C[1]
c = C[2]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
k=0
if l[0]== l[1]==l[2]:
    k+=1
if l[0]!=l[1]:
    k+=1
if l[1]!=l[2]:
    k+=1
if l[2]!=l[0]:
    k+=1
if k>3:
    k=3
print('{}'.format(k))

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

print(len(list(set(numlist))))

Submission status: Accepted

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

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

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

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

p = 3
if a==b:
    p = p-1
    if b==c:
        p = p-1
    else:
        pass
elif b==c:
    p = p-1
elif a==c:
    p = p-1
else:
    pass

print(p)

Submission status: Accepted

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

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)