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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))
if a[0]==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:
li = list(map(int, input().split()))
print(len(set(li)))

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:
#入力
lst = input().split()

#整数値化
for i in range(len(lst)):
   lst[i] = int(lst[i])

#ソート
lst.sort()

#出力
if lst[0] == lst[2]:
   print(1)
elif lst[0] == lst[1] or lst[1] == lst[2]:
   print(2)
else:
   print(3)

Submission status: Accepted

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

Submission status: Accepted

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

print(len(a))

Submission status: Accepted

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

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

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:
print(len({*input().split()}))

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
color = set(map(int,input().split())) #set型　集合を扱う型(重複要素は含まない)
print(len(color))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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 b!=c):
    print("2")

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

else: print("3")

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(s))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b and b==c:
    print(1)
elif a==b and a!=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=input().split()
a.sort()
cnt=0
while len(a)>0:
    i=a.count(a.pop(0))
    for j in range(i):
        a.pop(0)
    cnt+=1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(lst)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
import math

# import copy
# from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7

def divide(k):
    return pow(k, MOD-2, MOD)


def make_nck(n):
    ret = [1]
    for i in range(1, n+1):
        ret.append((ret[-1] * (n + 1 - i) * divide(i)) % MOD)

    # print(ret)
    return ret

def make_nigojyo(n):
    ret = [1]

    for i in range(1, n+1):
        ret.append((ret[-1] * 25) % MOD)

    # print(ret)
    return ret


def solve():
   a = getList()
   print(len(list(set(a))))



def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve()

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

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

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

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

# ddict = defaultdict(lambda: 0)
# ddict = defaultdict(lambda: 1)
# ddict = defaultdict(lambda: int())
# ddict = defaultdict(lambda: list())
# ddict = defaultdict(lambda: float())

a,b,c = MI()
l = [a,b,c]
print(len(set(l)))

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


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


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

Submission status: Accepted

Solution code:
def paint():
    s = input()
    slist = s.split(' ')

    a = int(slist[0])
    b = int(slist[1])
    c = int(slist[2])
    count = 1
    if a != b:
        count += 1
    if a != c and b != c:
        count += 1

    print(count)

paint()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	abc = set(LI())
	print(len(abc))




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
"""
int #整数
float #小数

#標準入力
a=input()
a,b=map(int,input().split()) #入力は行ごと
#標準出力
print(a)
ptrint("Hello")
#for
for name in fruits: #fruitの頭から操作
    print(name)
#リスト
list0 = [] #リスト生成
list0 = [1,2,3,4] #初期化
list0 = [0]*10 #[0,0,0,0,0,0,0,0,0,0]
list1 = list(map(int, input().split()))　# 複数の入力をリストに入れる
list1 = list1 + [6, 7, 8] #リストの追加
list2.append(34) #リストの追加　最後に（）内が足される
list.insert(3,10) #リストの追加　任意の位置（追加したい位置,追加したい値）
len(list4) #リストの要素数
max(sa) #list saの最小値
list5.count(2) #リスト内の2の数
abs(a) #aの絶対値
max(a,b) min(a,b) #最大値　最小値

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

comprehension_1= [i for i in range(10)]
comprehension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
"""
a,b,c = map(int,input().split())
if a==b and b==c:
    print("1")
elif a==b:
    print("2")
elif b==c:
    print("2")
elif a==c:
    print("2")
else:
    print("3")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

a = list(input().split())
ans = len(collections.Counter(a))
print(ans)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
import collections
A = input().split()
c = collections.Counter(A)
print(len(c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(arr)))

Submission status: Accepted

Solution code:
ns=input()

nsl=ns.split(' ')

nsc=[]
for i in range(3):
  nsc.append(nsl.count(nsl[i]))

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

Submission status: Accepted

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

Submission status: Accepted

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

set_list_penki = list(set(list_penki))

print(len(set_list_penki))

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    abc=MI()
    s=set(abc)
    print(len(s))

main()

Submission status: Accepted

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

print(len(set(A)))

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 c!=a) or (c==a and a!=b):
  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:
import collections
list = list(input().split())
l=collections.Counter(list)
print(len(l))

Submission status: Accepted

Solution code:
import sys
def v():
    x=[x for x in sys.stdin.readline().split()]
    print(len(set(x)))
if __name__=='__main__':v()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
a=sorted(s)
if a[0]<a[1]:
  if a[1]<a[2]:
    c=3
  else:
    c=2
else:
  if a[1]<a[2]:
    c=2
  else:
    c=1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#一昨日(a),昨日(b),今日(c)のペンキの色
a,b,c = input().split()
#買ったペンキの数
S = 1
#aとbが違う色か
if not a == b:
    S = S + 1
#aとc、かつbとcが違う色か
if not a == c and not b == c:
    S = S + 1
#買ったペンキの数を出力
print(S)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#おとといa、きのうb、今日c
a,b,c = (int(x) for x in input().split())
penki_list = [a,b,c]
print(len(set(penki_list)))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input()
arr = l.split(' ')
s = set()
if 1 <= int(arr[0]) <= 100 and 1 <= int(arr[1]) <= 100 and 1 <= int(arr[2]) <= 100:
  for e in arr:
    s.add(e)
s = list(s)
print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限
s = set(map(int,input().split()))
print(len(s))

Submission status: Accepted

Solution code:
import sys
import math
 
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
 
def main():
    s = map(int,input().split())
    print(len(set(s)))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
d =[]
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:
# -*- coding: utf-8 -*-
a,b,c = map(int, input().split())
cnt = 0
if a != b:
  cnt += 1
if a != c:
  cnt += 1
if b != c:
  cnt += 1
if a==c and b==c:
  cnt += 1
print(int(cnt))

Submission status: Accepted

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

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

elif a!=b!=c!=a:
    print(3)

else:
    print(2)

Submission status: Accepted

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

a = int(paints[0])
b = int(paints[1])
c = int(paints[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
penki = [i for i in map(int, input().split())]
count = 3
if penki[0] == penki[1]:
    count -= 1
if penki[0] == penki[2]:
    count -= 1
if penki[1] == penki[2]:
    count -= 1
if penki[1] == penki[2] == penki[0]:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()))
b = set(a)
print(len(b))

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
count = 1
if x != y:
    count += 1
if x != z and y != z:
    count += 1
print(count)

Submission status: Accepted

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

l = set(map(int,stdin.readline().rstrip().split()))

print(len(l))

Submission status: Accepted

Solution code:
a = input().split()
li = []
for i in a:
    if i not in li:
        li.append(i)
print(len(li))

Submission status: Accepted

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

Submission status: Accepted

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

s = set(abc)
print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A,B,C=map(float,input().split())
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:
a,b,c = map(int,input().split())

abc = [a,b,c]

abc=set(abc)

print(len(abc))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = mi()
    print(len(list(set([a, b, c]))))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
s=[a,b,c]
s=list(set(s))
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:
a,b,c=(int(x) for x in input().split())
if a==b==c:
    print('1')
elif a!=b and b!=c and c!=a:
    print('3')
else:
    print('2')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
 num = list(map(int,input().split()))
 ans = 1 ;
 if num[0]!=num[1]:
  ans+=1
 if num[0]!=num[2] and num[1]!=num[2]:
  ans+=1
 print(ans)
 
main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 18:26:24 2020

@author: shinba
"""

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

print(len(A))

Submission status: Accepted

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

Submission status: Accepted

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