Problem:


Score : 200 points

Problem Statement

An X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.

Lunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?

Constraints

1 ≤ N ≤ 100

1 ≤ d_i ≤ 100

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
d_1
:
d_N

Output

Print the maximum number of layers in a kagami mochi that can be made.

Sample Input 1

4
10
8
8
6

Sample Output 1

3

If we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.

Sample Input 2

3
15
15
15

Sample Output 2

1

When all the mochi have the same diameter, we can only have a 1-layered kagami mochi.

Sample Input 3

7
50
30
50
100
50
80
30

Sample Output 3

4



Sample input:
4
10
8
8
6


Sample output:
3

Submission status: Accepted

Solution code:
n = int(input())
list_original = [int(input()) for i in range(n)]
check = 101
count = 0

list = sorted(list_original, reverse=True)

for k in list:
    if k < check:
        count += 1
        check = k

print(count)

Submission status: Accepted

Solution code:
N = int( input() )
d = [ int(input()) for i in range(N) ]

d.sort( reverse=True )
ans = 1
for i in range(1,N):
    if d[i-1] > d[i] : ans += 1

print( ans )

Submission status: Accepted

Solution code:
n = int(input())
list_original = [int(input()) for i in range(n)]
check = 101
count = 0

list_mid = sorted(list_original)
list = []

for j in range(1, n+1):
    list.append(list_mid[-j])

for k in list:
    if k < check:
        count += 1
        check = k

print(count)

Submission status: Accepted

Solution code:
n = int(input())
D = [input() for i in range(n)]
print(len(set(D)))

Submission status: Accepted

Solution code:
n = int(input())
D = [int(input()) for i in range(n)]
D = set(sorted(D))
print(len(D))

Submission status: Accepted

Solution code:
n = int(input())
m = [int(input()) for i in range(n)]
mso = sorted(m)
count = 0
for s in range(1,n):
  if mso[s] == mso[s-1]:
    count += 1
print(n-count)

Submission status: Accepted

Solution code:
N=int(input())
D=[int(input()) for _ in range(N)]
ans=0
dict={}
for d in D:
  dict[d]=1

for d in dict:
  ans+=1

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
d=[]
for i in range(N):
    d.append(int(input()))

X=0

for i in range(N):
    s=0
    for j in range(i):
       if d[i]==d[j]:
           s=1
    if s==0:
        X+=1

print(X)

Submission status: Accepted

Solution code:
N = int(input())
arr = [i for i in range(0,N)]
for i in range(0,N):
    arr[i] = int(input())

arr.sort()
t=0
new=[]
for ii in arr:
    if t==0:
        new.append(ii)
        t+=1
        continue
    if arr[t-1]==ii:
        t+=1
        continue
    else:
        new.append(ii)
    t+=1
print(len(new))

Submission status: Accepted

Solution code:
N = int(input())
L = [ int(input()) for _ in range(N)]

L = set(L)

print(len(L))

Submission status: Accepted

Solution code:
n = int(input())
dd = [int(input()) for _ in range(n)]
dd = set(dd)
print(len(dd))

Submission status: Accepted

Solution code:
n=int(input())
d=[]
for i in range(n):
    d.append(int(input()))
ans=0
for i in range(n):
    m=max(d)
    for _ in range(d.count(m)):
        d.remove(m)
    ans+=1
    if(len(d)==0):
        break
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
D = [int(input()) for _ in range(N)]
print(len(list(set(D))))

Submission status: Accepted

Solution code:
n=int(input())
d=set()
for i in range(n):
    d.add(int(input()))
print(len(d))

Submission status: Accepted

Solution code:
""" AtCoder """

N = int(input())
d = [int(input()) for _ in range(N)]

d = set(d)
print(len(d))

Submission status: Accepted

Solution code:
n=int(input())
li=[0]*n
for i in range(n):
    li[i]=int(input())
print(len(set(li)))

Submission status: Accepted

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

N = int(input())
mochi_set = [input() for _ in range(N)]
print(len(set( mochi_set )))

Submission status: Accepted

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

N = int(input())
mochi_set = set()

for _ in range(N):
    mochi_set.add(int(input()))

print(len(mochi_set))

Submission status: Accepted

Solution code:
from sys import stdin
N=int(stdin.readline().rstrip())
a=[]
for i in range(N):
    a.append(int(input()))
print(len(set(a)))

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())


#n = ip()                              #入力整数1つ
#a,b= (int(i) for i in input().split())      #入力整数横2つ
#k,a,b = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列

n = ip()                      #入力セット(整数改行あり)
a=[ip() for i in range(n)]    #入力セット(整数改行あり)

#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意

print(len(set(a)))

Submission status: Accepted

Solution code:
lst=[]
for i in range(int(input())):
    lst.append(input())
print(len(set(lst)))

Submission status: Accepted

Solution code:
n = int(input())
D = set(list(input() for _ in range(n)))
print(len(D))

Submission status: Accepted

Solution code:
N=int(input())
list=[]
for i in range(N):
    num=int(input())
    list.append(num)
set=set(list)
ans=len(set)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int, [input() for i in range(N)]))
print(len(set(a)))

Submission status: Accepted

Solution code:
N = int(input())
d = []
for _ in [0]*N:
    s = int(input())
    if s in d:
        continue
    else:
        d.append(s)
print(len(d))

Submission status: Accepted

Solution code:
N=int(input())
list1=[input() for i in range(N)]
list1_uniq=list(set(list1))
print(len(list1_uniq))

Submission status: Accepted

Solution code:
import collections
n = int(input())
d = [int(input()) for i in range(n)]
print(len(collections.Counter(d)))

Submission status: Accepted

Solution code:
n = int(input())
d = set([input() for i in range(n)])

print(len(d))

Submission status: Accepted

Solution code:
N = int(input())
D = set()

for i in range(N):
    D.add(input())

print(len(D))

Submission status: Accepted

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

n = int(input())

if n == 0:
    print('0')
    exit()

d_list = []
for i in range(0, n):
    d_list.append(int(input()))


d_list.sort()
d_list.reverse()

cnt = 1
for i in range(1, len(d_list)):
    if d_list[i] != d_list[i - 1]:
       cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
N = int(input())
d = {}

for _ in range(N):
    i = int(input())
    if i in d.keys():
        d[i] += 1
    else:
        d[i] = 1

print(len(d))

Submission status: Accepted

Solution code:
n=int(input())
D=list(map(int,[input() for i in range(n)]))
print(len(set(D)))

Submission status: Accepted

Solution code:
n = int(input()) 
t = [int(input()) for i in range(n)] 

l_unique = list(set(t))
print(len(l_unique))

Submission status: Accepted

Solution code:
n=int(input())
A=[]
for i in range(n):
  A.append(int(input()))
A=list(set(A))
print(len(A))

Submission status: Accepted

Solution code:
N = int(input())
D = sorted(list(set([int(input()) for _ in range(N)])))
print(len(D))

Submission status: Accepted

Solution code:
N = int(input())
mochies = set()
for n in range(N):
    mochies.add(int(input()))
print(len(mochies))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = int(input())

    d = []
    for i in range(n):
        d.append(int(input()))

    print(len(set(d)))

Submission status: Accepted

Solution code:
N = int(input())
D = []
for d in range(N):
    D.append(input())

D = list(set(D))
D.sort()
print(len(D))

Submission status: Accepted

Solution code:
int_n = int(input())
int_array = []

for d in range(int_n):
    int_array.append(int(input()))

int_set = set(int_array)

print(len(int_set))

Submission status: Accepted

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

N = int(input())
d_arr = [input() for i in range(N)]
d_arr_omit = list(set(d_arr))

print(len(d_arr_omit))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())

mochi =[]
for i in range(0,N):
    d = int(input())
    if not d in mochi:
        mochi.append(d)

print(len(mochi))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
d = [0]*n
for i in range(n): d[i] = int(input())
d.sort()
d_max = 0
col = 0
for di in d:
    if d_max<di: 
        d_max = di
        col += 1
print(col)

Submission status: Accepted

Solution code:
inp = int(input())
g = []
for i in range(inp):
  m = input()
  if m in g:
    pass
  else:
    g.append(m)
print(len(g))

Submission status: Accepted

Solution code:
N = int(input())
mochi = [int(i) for i in [input() for j in range(N)]]

kagami = 0
while(len(mochi) is not 0):
    tmp = mochi[0]
    for i in range(len(mochi) - 1):
        if(mochi[i] < tmp):
            tmp = mochi[i]
    mochi = [i for i in mochi if i != tmp]
    kagami += 1
print(kagami)

Submission status: Accepted

Solution code:
n = int(input())
d = [None]*n
for i in range(n):
    d[i] = int(input())

print(len(set(d)))

Submission status: Accepted

Solution code:
N=int(input())
d=[0]*N
for i in range(N):
    d[i]=int(input())
D=set(d)
print(len(D))

Submission status: Accepted

Solution code:
N=int(input())
d_list=list()
for _ in range(N):
    d_list.append(int(input()))

print(len(set(d_list)))

Submission status: Accepted

Solution code:
N = int(input())
d = []
for ni in range(N):
    d.append(int(input()))

ds = set(d)
print(len(ds))

Submission status: Accepted

Solution code:
N = int(input())
diams = []

for i in range(N):
    di = int(input())
    diams.append(di)

diams.sort(reverse = True)

count = 1

for i in range(1, N):
    if diams[i-1] != diams[i]:
        count +=1

print(count)

Submission status: Accepted

Solution code:
n = int(input())
d = [int(input()) for i in range(n)]

s =set(d)

print(len(s))

Submission status: Accepted

Solution code:
n = int(input())
mochi = []
for i in range(n):
    mochi.append(int(input()))

mochi_use = sorted(mochi,reverse = True)

ans = 1

for i in range(n-1):
    if mochi_use[i] > mochi_use[i+1]:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

d = [input() for _ in range(N)]

print(len(set(d)))

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    m = []
    for i in range(n):
        m.append(int(input()))

    print(len(set(m)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(100000)
import heapq
n=int(input())
data=[]
for i in range(n):
    heapq.heappush(data,int(input()))
print(len(set(data)))

Submission status: Accepted

Solution code:
n = int(input())
li = []
for _ in range(n):
    li.append(int(input()))

print(len(set(li)))

Submission status: Accepted

Solution code:
n = int(input())
d = []
count = 1

for i in range(n):
    d.append(int(input()))
d.sort()

for i in range(n-1):
    if(d[i] != d[i+1]):
        count += 1

print(count)

Submission status: Accepted

Solution code:
n = int(input())

l = [int(input()) for _ in range(n)]

m = []

for i in l:
  if i not in m:
    m.append(i)
    
print(len(m))

Submission status: Accepted

Solution code:
n = int(input())
nums = map(int, [input() for i in range(n)])
print(len(set(nums)))

Submission status: Accepted

Solution code:
n=int(input())
arr=sorted(set([int(input()) for i in range(n)]), reverse=True)
print(len(arr))

Submission status: Accepted

Solution code:
N=int(input())
d=set()
for i in range(N):
  d.add(input())
print(len(d))

Submission status: Accepted

Solution code:
#encoding:utf-8

N = int(input())
d = []
for i in range(N):
    d.append(int(input()))

d = set(d)
print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
d = []
for i in range(n):
    d.append(int(input()))

d = list(set(d))
d.sort(reverse=True)
print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
A = [int(input()) for i in range(n)]

print(len(set(A)))

Submission status: Accepted

Solution code:
N = int(input())
d = list(int(input()) for i in range(N))

print(len(list(set(d))))

Submission status: Accepted

Solution code:
n = int(input())
d = list(int(input()) for _ in range(n))
d.sort(reverse=True)
a = 1
for i in range(n):
    if d[i] < d[i-1]:
        a += 1
print(a)

Submission status: Accepted

Solution code:
X = int(input())
mochi = []
for i in range(X):
    diameter = int(input())
    mochi.append(diameter)
print(len(list(set(mochi))))

Submission status: Accepted

Solution code:
n = int(input())
dict = {}
for i in range(n):
  dict[input()] = i
print(len(dict))

Submission status: Accepted

Solution code:
def inpl(): return list(map(int, input().split()))


N = int(input())
print(len({int(input()) for _ in range(N)}))

Submission status: Accepted

Solution code:
from collections import Counter

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


N = int(input())
print(len(Counter([int(input()) for _ in range(N)])))

Submission status: Accepted

Solution code:
def main(N,xs):
    # type: (int, List[int]) -> None
    print(len(set(xs)))

if __name__ == '__main__':
    N = int(input())
    ds = list(map(lambda s: int(input()), range(N)))
    main(N,ds)

Submission status: Accepted

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]
a = set(a)
print(len(a))

Submission status: Accepted

Solution code:
n = int(input())
d = set()
for i in range(n):
  d.add(input())
print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
print(len(sorted(list(set(map(int, [input() for i in range(n)]))), reverse=True)))

Submission status: Accepted

Solution code:
n=int(input())
a=map(int, [input() for i in range(n)])
b=len(list(set(a)))
print(b)

Submission status: Accepted

Solution code:
N = int(input())
D = [int(input()) for _ in range(N)]
from collections import Counter
C = list(Counter(D).most_common())
print(len(C))

Submission status: Accepted

Solution code:
# 085 B
n = int(input())
s = set([])
for i in range(n):
    s.add(int(input()))
print(len(s))
#print(s)#

Submission status: Accepted

Solution code:
print(len(set([input()for i in range(int(input()))])))

Submission status: Accepted

Solution code:
n=int(input())
print(len(set([int(input())for i in range(n)])))

Submission status: Accepted

Solution code:
N = int(input())
d = []
for i in range(N):
    d.append(int(input()))
d_unique = []
d_unique.append(d[0])
for i in range(N):
    if not(d[i] in d_unique):
        d_unique.append(d[i])
print(len(d_unique))

Submission status: Accepted

Solution code:
N = int(input())
list = []
for i in range(N):
    list.append(input())
ans = len(set(list))
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
d = [int(input()) for i in range(n)] 

print(len(list(set(d))))

Submission status: Accepted

Solution code:
N = int(input())
d = []
ans = 0
for i in range(N):
    a = int(input())
    if a in d:
        pass
    else:
        ans+=1
    d.append(a)
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
d=[]
for i in range(n):
  d.append(int(input()))
print(len(list(set(d))))

Submission status: Accepted

Solution code:
N = int(input())

d = []
for i in range(N):
    temp_d = int(input())
    if temp_d in d:
        continue
    d.append(temp_d)

print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
d = []
for i in range(n):
    d.append(int(input()))

d = list(set(d))
print(len(d))

Submission status: Accepted

Solution code:
a=int(input())
b=[int(input()) for i in range(a)]
c=sorted(b)
#print(c)
d=1
for i in range(a-1):
	if c[i]<c[i+1]:
		d=d+1
print(d)

Submission status: Accepted

Solution code:
n=int(input())
print(len(set(input() for i in range(n))))

Submission status: Accepted

Solution code:
n=int(input())
x=set()
for i in range(n):
    x.add(int(input()))
print(len(x))

Submission status: Accepted

Solution code:
import numpy as np
num = int(input())
ary = []
for _ in range(num):
    ary += [int(input())]
ary = np.array(ary)

print(len(np.unique(ary)))

Submission status: Accepted

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
a.sort()
ans=1
for i in range(n-1):
	if(not a[i]==a[i+1]):
		ans+=1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
d = [0 for _ in range(N)]
for i in range(N):
    d[i] = int(input())
print(len(set(d)))

Submission status: Accepted

Solution code:
N = int(input())
T = []
for i in range(N):
    T.append(int(input()))
H=list(set(T))
I=sorted(H)
print(len(I))

Submission status: Accepted

Solution code:
N = int(input())
d = list(set([int(input()) for _ in range(N)]))
print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
d = []
for i in range(n):
  d.append(int(input()))
  
d = list(set(d))
print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
d = []

for i in range(n):
    d.append(int(input()))

d_sort = []
d_sort = sorted(d)
count = 0

for i in range(len(d_sort)-1):
    if(d_sort[i] == d_sort[i+1]):
        count += 1

print(len(d)-count)

Submission status: Accepted

Solution code:
N = int(input())
l = []
i = 0
while i < N:
    l.append(int(input()))
    i += 1

size = 0
tmp = -1
while len(l) > 0:
    if tmp != max(l):
       size += 1
    tmp = max(l)
    l.remove(max(l))
print(size)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def iml(N: int, t: type = int):
    return [t(input()) for _ in range(N)]


N = ii()
D = iml(N)

print(len(set(D)))

Submission status: Accepted

Solution code:
import sys

import numpy as np

input = sys.stdin.readline


def ii(t: type = int):
    return t(input())


def il(t: type = int):
    return list(map(t, input().split()))


def iml(N: int, t: type = int):
    return [t(input()) for _ in range(N)]


N = ii()
D = iml(N)

print(np.unique(D).size)

Submission status: Accepted

Solution code:
N = int(input())
D = [int(input()) for _ in range(N)]

ans = len(set(D))

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
D = [int(input()) for _ in range(N)]

ans = len(set(sorted(D)))

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict

n = int(input())
d = defaultdict(int)
for _ in range(n):
    tmp = int(input())
    d[tmp] += 1

print(len(d.keys()))

Submission status: Accepted

Solution code:
# _*_ coding:utf-8 _*_
#  Atcoder_Beginners_Contest085-B
#  https://atcoder.jp/contests/abc085/tasks/abc085_b

def  motiTower(givenRange):
	distMeter = []
	for i in givenRange:
		distMeter.append(int(input().strip()))
	setKagamiMoti = set()
	for i in givenRange:
		setKagamiMoti.add(distMeter[i])
	answer = len(setKagamiMoti)
	return answer

if __name__ == '__main__':
	N=int(input())
	distRange = range(0,N,+1)
	solution=motiTower(distRange)
	print("{}".format(solution))

Submission status: Accepted

Solution code:
moti_total = int(input())
moti = []
for n in range(moti_total):
  moti.append(int(input()))
moti.sort()
tower = 1
for n in range(moti_total-1):
  if moti[n] is not moti[n+1]:
    tower += 1
print(tower)

Submission status: Accepted

Solution code:
#入力
N = int(input())

d = []
i = 0
while N>i:
    d.append(int(input()))
    i += 1

#setにすると重複する要素が覗かれる（順番が変わってしまうことに注意）
print(len(list(set(d))))

Submission status: Accepted

Solution code:
N = int(input())
d = []
for i in range(N):
    d.append(int(input()))
d = sorted(d,reverse = True)

c = 1
for i in range(N-1):
    if d[i] == d[i+1]:
        pass
    else:
        c += 1
print(c)

Submission status: Accepted

Solution code:
N = int(input())
mochi = list()
for i in range(N):
  	mochi.append(input())
    
unique = list(set(mochi))
print(len(unique))

Submission status: Accepted

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


def main():
    n = int(input())
    d = set([int(input()) for _ in range(n)])
    print(len(d))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
se = set([input() for _ in range(N)])
print(len(se))

Submission status: Accepted

Solution code:
N = int(input())

A = []

for i in range(N):
    A.append(int(input()))

print(len(set(A)))

Submission status: Accepted

Solution code:
n = int(input())
k=[]
for i in range(n):
    k.append(int(input()))
p = set(k)
print(len(p))

Submission status: Accepted

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

def main():
    n = int(input())
    d = []
    for i in range(n):
        d.append(int(input()))

    s = set()
    for di in d:
        s.add(di)

    print(len(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
s = set()
for _ in range(N):
    s.add(int(input()))

print(len(s))

Submission status: Accepted

Solution code:
def abc085_b():
    n = int(input())
    d = [int(input()) for _ in range(n)]
    print(len(set(d)))


abc085_b()

Submission status: Accepted

Solution code:
N = int(input())
d = list(map(int, [input() for i in  range(N)]))

print(len(set(d)))

Submission status: Accepted

Solution code:
N = int(input())
a = [int(input()) for i in range(N)]
li_uniq = list(set(a))
print(len(li_uniq))

Submission status: Accepted

Solution code:
N = int(input())
le = [int(input()) for i in range(N)]

motiarray = []

for i in range(0,N):
    if motiarray.count(le[i])==0:
        motiarray.append(le[i])


print(len(motiarray))

Submission status: Accepted

Solution code:
N = int(input())
D = [int(input()) for i in range(N)]
ans = len(set(D))
print(ans)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    ds = [int(input()) for _ in range(n)]
    print(len(set(ds)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
dat = []
for i in range(n):
  a = int(input())
  if dat.count(a)==0:
    dat.append(a)
print(len(dat))

Submission status: Accepted

Solution code:
n = int(input())
d = []
for i in range(n):
    d.append(int(input()))

s = set(d)
print(len(s))

Submission status: Accepted

Solution code:
n = int(input())
ms = []
for _ in range(n):
  ms.append(int(input()))
mset = set(ms)
print(len(mset))

Submission status: Accepted

Solution code:
n = int(input())
print(len({int(input()) for _ in range(n)}))

Submission status: Accepted

Solution code:
N = int(input())
mochi = []
for i in range(N) :
    mochi.append(int(input()))

mochi = set(list(mochi))
print(len(mochi))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
a=[]

for i in range(N):
    d=int(input())
    a.append(d)

a=set(a)

print(len(a))

Submission status: Accepted

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
A = list(set(A))
print(len(A))

Submission status: Accepted

Solution code:
cnt = int(input())
width_list = []
for x in range(cnt):
    width = int(input())
    width_list.append(width)

width_sort = sorted(width_list)
dan = 0
now_width = 0
for x in width_sort:
    if now_width != x:
        dan += 1
    now_width = x
print(dan)

Submission status: Accepted

Solution code:
n =  int(input())
d = list()

for i in range(n):
    d.append(int(input()))
d.sort()
    
count = 0
prevd = 0

for i in range(n):
    if d[i] != prevd:
        count += 1
    prevd = d[i]
print(count)

Submission status: Accepted

Solution code:
times = int(input())
num = list(map(int,[input() for _ in range(times)]))
print(len(set(num)))

Submission status: Accepted

Solution code:
N = int(input())
list_d = set()
for i in range(N):
	list_d.add(int(input()))
print(len(list_d))

Submission status: Accepted

Solution code:
N = int(input().strip())
ds= []
for i in range(N):
    ds.append(int(input().strip()))

print(len(list(set(ds))))

Submission status: Accepted

Solution code:
n = int(input())
d_list = set([int(input()) for _ in range(n)])

print(len(d_list))

Submission status: Accepted

Solution code:
# Kagami Mochi
n = int(input())
print(len({int(input()) for _ in range(n)}))

Submission status: Accepted

Solution code:
# Kagami Mochi
n = int(input())
d = set()
for i in range(n):
    d.add(int(input()))
print(len(d))

Submission status: Accepted

Solution code:
from collections import Counter
n=int(input())
D=[int(input()) for i in range(n)]
D=Counter(D)
print(len(D))

Submission status: Accepted

Solution code:
#ABC7
N = int(input())
#空のリストを作成
d = [] 
#リストdに先頭から入力値を埋めていく
for i in range(N):
	d.append(int(input()))
#dを降順でソート
d.sort(reverse  = True )

counter = 1

for j in range(N-1):
	if d[j] > d[j+1]:
		counter += 1

print(counter)

Submission status: Accepted

Solution code:
N=int(input())
d=[0]*N
for i in range(N):
    d[i]=int(input())
d=set(d)
print(len(d))

Submission status: Accepted

Solution code:
N = int(input())

L = [ int(input()) for i in range(N) ]

L = set(L)

print(len(L))

Submission status: Accepted

Solution code:
n = int(input())
print(len(set(map(int, [input() for i in range(1,n+1)]))))

Submission status: Accepted

Solution code:
N = int(input())
ans = set()
for i in range(0,N):
  d = int(input())
  ans.add(d)
print(len(ans))

Submission status: Accepted

Solution code:
n = int(input())
r_list = [int(input()) for i in range(n)]
r_set = set(r_list)
print(len(r_set))

Submission status: Accepted

Solution code:
N = int(input()) 


l = sorted([input() for _ in range(N)])

print(len(set(l)))

Submission status: Accepted

Solution code:
N = int(input())
inputVal = [int(input()) for i in range(N)]
print(len(set(inputVal)))

Submission status: Accepted

Solution code:
N = int(input())
inputVal = [int(input()) for i in range(N)]
inputVal.sort()
default = 0
count = 0

for i in inputVal:
    if i != default:
        count += 1
        default = i

print(count)

Submission status: Accepted

Solution code:
a = int(input())
ar = []
for i in range(a):
    l = int(input())
    ar.append(l)
br = set(ar)
print(len(br))

Submission status: Accepted

Solution code:
n = int(input())
d_set = set(list(int(input()) for i in range(n)))
print(len(d_set))

Submission status: Accepted

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

if __name__ == "__main__":
    n = int(input())
    vals = set()

    for _ in range(n):
        dum = int(input())
        vals.add(dum)

    print(len(vals))

Submission status: Accepted

Solution code:
N = int(input())
A = [0] * 101
for _ in range(N):
    A[int(input())] = 1
print(sum(A))

Submission status: Accepted

Solution code:
n = int(input())
mochi_list = [int(input()) for i in range(n)]

mochi_list.sort()
count = 0
mochi = 0

for i in range(n):
    if mochi_list[i] != mochi:
        mochi = mochi_list[i]
        count += 1

print(count)

Submission status: Accepted

Solution code:
n = int(input())
a_list = list()

for i in range(n):
    a_list.append(int(input()))

a_list.sort()

d = 0
step = 0

for j in range(n):
    if a_list[j] > d:
        step += 1
        d = a_list[j]

print(step)

Submission status: Accepted

Solution code:
N = int(input())
print(len(set([ int(input()) for i in range(N)])))

Submission status: Accepted

Solution code:
N = int(input())
d = set([ int(input()) for i in range(N)])
print(len(d))

Submission status: Accepted

Solution code:
N = int(input())
d = [ int(input()) for i in range(N)]
d = sorted(set(d))[::-1]
count = 0

for j in range(len(d)):
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
N = int(input())
d = [ int(input()) for i in range(N)]
d = sorted(d)[::-1]
mochi = d[0]
count = 1

for j in range(1, N):
  if( d[j] < mochi ):
    count += 1
    mochi = d[j]

  else:
    continue
    
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
d = [input() for i in range(N)]

pre_v = 0
c = 0
for v in sorted(d):
	if v > pre_v:
		c += 1
	pre_v = v
print c

Submission status: Accepted

Solution code:
n = int(input())
d = [0 for i in range(n)]
for i in range(n):
    d[i] = int(input())
d = sorted(d)
count = 1
for i in range(1,n):
    if d[i] > d[i-1]:
        count += 1
print(count)

Submission status: Accepted

Solution code:
N = int(input())
li = [int(input()) for i in range(N)]

li_uniq = list(set(li))
print(len(li_uniq))

Submission status: Accepted

Solution code:
n = int(input())
print(len(list(set(map(int, [input() for i in range(n)])))))

Submission status: Accepted

Solution code:
n = int(input())

moti = set()

for _ in range(n):
    moti.add(input())
    
print(len(moti))

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-

N = int(input())
d = [int(input()) for i in range(N)]

print(len(set(d)))

Submission status: Accepted

Solution code:
a = int(input())
b = [input() for i in range(a)]

c = list(set(b))
print(len(c))

Submission status: Accepted

Solution code:
N=int(input())
List=[int(input()) for i in range(N)]
List.sort(key=lambda x:x)
n=1
So=[]
while n<=List[N-1]:
  if n in List:
    So.append(n)
  n+=1
print(len(So))

Submission status: Accepted

Solution code:
l = [input() for _ in range(int(input()))]

ans = len(set(l))

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
mochi = [input() for i in range(n)]

a = set(mochi)
a = len(a)
print(a)

Submission status: Accepted

Solution code:
n = int(input())
d = []
for i in range(n):
    d.append(input())
# [d1, d2, d3, ..., dN]
d = [int(m) for m in d]#int型に直す
e = set(d)
print(len(e))

Submission status: Accepted

Solution code:
def kagamimochi():
    n = int(input())
    li = []
    for _ in range(n):
        li.append(int(input()))

    return (len(list(set(li))))


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

Submission status: Accepted

Solution code:
n = int(input())
mochi = set(int(input()) for i in range(n))
print(len(mochi))

Submission status: Accepted

Solution code:
d = [int(input()) for i in range(int(input()))]
print(len(set(d)))

Submission status: Accepted

Solution code:
N=int(input())
moti={int(input())for i in range(1,N+1)}
print(len(moti))

Submission status: Accepted

Solution code:
N=int(input())
D=[int(input()) for i in range(N)]
print(len(list(set(D))))

Submission status: Accepted

Solution code:
N = int(input())
d = set()
for i in range(N):
    d.add(int(input()))

print(len(d))

Submission status: Accepted

Solution code:
n = int(input())
s = set(int(input()) for _ in range(n))
print(len(s))

Submission status: Accepted

Solution code:
N = int(input())
d = [int(input()) for _ in range(N)]
d = list(set(d))
print(len(d))