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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

s = inputIL()
print(len(set(s)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect
 
def main():
    A = list(map(int, input().split()))
    print(len(set(A)))
 
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
print(len(set(A)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
colors = input().split()
arr = {}
for color in colors:
    arr[color] = 1

print(len(arr))

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

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

Submission status: Accepted

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

color_list = set(color_list)
print(len(color_list))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc_list = list(map(int,input().split()))
abc_list_len = len(abc_list)
dum = set(abc_list)
dum_len = len(dum)
print(dum_len)

Submission status: Accepted

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

print(len(abc))

Submission status: Accepted

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

print(len(set(ans)))

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(len(set(abc)))

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

Submission status: Accepted

Solution code:

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

list = [a, b, c]

print(len(list) if len(list)==len(set(list)) else len(set(list)) )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst=(list(map(str,input().split())))
a=set()
for i in range(3):
  a.add(lst[i])
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:
# ペンキの種類を求めよ

abc = input()

ls_abc = abc.split()
len_abc = len(ls_abc)

for i in range(len_abc):
    ls_abc[i] = int(ls_abc[i])

# print(ls_abc)

counter = {}
# この状態では，カウンターがからッぽ．０にするためには１８．１９行目
for i in range(len_abc):
    x = ls_abc[i]

    if not x in counter:
        counter[x] = 0

    counter[x] = counter[x] + 1

print(len(counter))

Submission status: Accepted

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

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

print(len(s))

Submission status: Accepted

Solution code:
#AtCoDeerくんとペンキ
def ABC_46_A():
    A,B,C = map(int, input().split())
    iroha = [0 for i in range(3)]
    iroha = []
    iroha.append(A)
    iroha.append(B)
    iroha.append(C)

    if iroha.count(A)==3:
        print(1)
    elif iroha.count(A)==2 or iroha.count(B)==2:
        print(2)
    else:
        print(3)

if __name__ == '__main__':

    ABC_46_A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Nlis= [a, b, c]

print(len(set(Nlis)))

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:
s=list(map(int, open(0).read().split()));print(len(set(s)))

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
d=[a,b,c]
for i in range(2):
    if d.count(d[i])!=1:
        del d[i]
print(len(d))

Submission status: Accepted

Solution code:

def resolve():
    colors = input().split()
    print(len(set(colors)))
    
    


if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

list = [a,b,c]

num = len(set(list))

print(num)

Submission status: Accepted

Solution code:
#ABC046A https://atcoder.jp/contests/abc046/tasks/abc046_a

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

Submission status: Accepted

Solution code:
c=dict.fromkeys(list(map(str,input().split())))
print(len(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]
ans = 0
dic = {}
for x in A:
  if not x in dic:
    dic[x] = True
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
l = input().split(' ')

print(len(set(l)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7


col=list(set(LI()))
print(len(col))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = list(map(int,input().split()))
a = [0]*100
for i in r:
  a[i-1]=1
  
print(sum(a))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
a, b, c = map(int, input().split())
cnt = defaultdict(int)
cnt[a] += 1
cnt[b] += 1
cnt[c] += 1
print(len(cnt))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(len(list(set(list(map(int,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())

if A == B and B == C:
    print(1)
elif A == B or B == C or C == A:
    print(2)
else:
    print(3)

Submission status: Accepted

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

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:
from collections import Counter
li = list(map(int, input().split()))
c = Counter(li)
print(len(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = set(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==c:
  print(1)
else:
  if 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 or a == c or b== c:
  print('2')
else:
  print('3')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
  s = input()
  a= [int(elem) for elem in s.rstrip().split(' ')]
  print(len(set(a)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A=set(list)

print(len(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A = set(A)

print(len(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

i = 3
if a==b:
    i-=1
if b==c:
    i-=1
if c==a:
    i-=1
if not i:
    i=1
print(i)

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:

import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

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

print(len(set(abc)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
	s = input().split()
	uni = []
	for i in s:
		if i not in uni:
			uni.append(i)
	print(len(uni))
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

print(len(color))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num = [0] * 100
for i in map(int, input().split()):
    num[i-1] += 1

count = 0
for i in num:
    if i >= 1:
        count += 1

print(count)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a = na()
s = set(a)
print(len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
a=s[0]
b=s[1]
if s.count(a)==3:
    print(1)
elif s.count(a)==2:
    print(2)
elif s.count(b)==2:
    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:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
A,B,C = map(int,input().split())
ans = len(set([A,B,C]))

print(ans)

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
tmp = []
count=0
for i in l:
    if not i in tmp:
        count+=1
        tmp.append(i)
print(count)

Submission status: Accepted

Solution code:
icase=46    
if icase==46:
    a=list(map(int,input().split()))
    icnt=1
    if a[0]!=a[1]:
        icnt=icnt+1
    if a[0]!=a[2] and  a[1]!=a[2]:
        icnt=icnt+1
    print(icnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l = [0]*101

for i in a:
  l[i] += 1

print(len(list(filter(lambda x: x !=0, l))))

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:
a, b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    p = il()
    print(len(set(p)))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc046/tasks/abc046_a
a, b, c = map(int, input().split())
print(len(set([a, b, c])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

li = sorted(l)

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

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

Submission status: Accepted

Solution code:
paint = list(map(int,input().split()))
cnt = {}

for c in paint:
    cnt.setdefault(c,0)
    cnt[c] += 1
    
print(len(cnt))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
url = "https://atcoder.jp/contests/abc046/tasks/abc046_a"

def main():
    li = list(input().split())
    print(len(set(li)))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

import collections

c=collections.Counter(l)
print(len(c.keys()))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    ans = 3
    if a == b == c:
        ans = 1
    else:
        if a == b:
            ans -= 1
        if b == c:
            ans -= 1
        if c == a:
            ans -= 1
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c = map(list,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:
import collections as c
a = list(map(int, input().split()))
p = c.Counter(a)
print(len(p))

Submission status: Accepted

Solution code:
# solution

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

print( len( cols ) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = len(se)
print(str(n))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(input().split())
d = {}
for i in l:
    if i in d:
        d[i] +=1
    else:
        d.setdefault(i,1)
print(len(d))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = input().split()
if li[0] == li[1] or li[0] == li[2] or\
    li[1] == li[2]:
    if  li[0]==li[1]==li[2]:
        print(1)
    else:
        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:
L = list(map(int,input().split()))
def main():
  print(len(set(L)))

if __name__ == '__main__':
  main()

Submission status: Accepted

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

print(len(p))

Submission status: Accepted

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

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