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())
d = {int(input()) for _ in range(n)}

print(len(d))

Submission status: Accepted

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

d = list(d)
d.sort()
print(len(d))

Submission status: Accepted

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

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

Submission status: Accepted

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

N=int(input())
d=set()
for _ in range(N):
	d.add(input())

print(len(d))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    x = []
    for i in range(N):
        x.append(int(input()))
    a = sorted(list(set(x)))
    print(len(a))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
d_list = []
for i in range(n):
    d_list.append(int(input()))
d_list.sort()
count_layer =1
for i in range(1,n):
    if d_list[i] != d_list[i-1]:
        count_layer +=1
print(count_layer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count=1
N=int(input())
c=[]
for i in range(N):
    d=int(input())
    c.append(d)
c.sort()
for i in range(N-1):
    if c[N-2-i]<c[N-1-i]:
        count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

d.sort(reverse=True)
  
res = 0
cur_diameter = max(d) + 1
for i in range(N):
  if d[i] < cur_diameter:
    res += 1
    cur_diameter = d[i]

print(res)

Submission status: Accepted

Solution code:
import collections
N = int(input())
D = [int(input()) for i in range(N)]
ans = 0          
DD = collections.Counter(D)
for k in DD.values():
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
d = [int(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(1,N+1)]
d=sorted(d)
moti=0
x=[]
for i in d:
  if i>moti:
    x.append(i)
    moti=i
print(len(x))

Submission status: Accepted

Solution code:
N=int(input())
d_dict={}
for n in range(N):
    d = int(input())
    if d in d_dict.keys():
        continue
    d_dict[d]=0
else:
    print(len(d_dict))

Submission status: Accepted

Solution code:
N = int(input())
num = [0]*N

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

Submission status: Accepted

Solution code:
n = int(input())

data = [input() for _ in range(n)]

data = list(set(data))

print(len(data))

Submission status: Accepted

Solution code:
n=int(input())
d={}
for _ in range(n):
  s=input().strip()
  d[s]=1

print(len(d.keys()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
 
n = int(input())
d = [int(input()) for i in range(n)]
d.sort()
 
#初期値
now = d.pop() #一番大きい値
ans = 1 # １段目
#print(" ")
while len(d) != 0:
    next = d.pop()
    #print(next)
    if now > next:
        ans += 1
        now = next
 
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(d)))

Submission status: Accepted

Solution code:
N=int(input())
d=[int(input()) for x in range(0,N)]
d.sort(reverse=True)
c=1

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

Submission status: Accepted

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

n = INT()
d = [INT() for _ in range(n)]
print(len(list(set(d))))

Submission status: Accepted

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

print(len(d))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    ans = set()
    for _ in range(N):
        ans.add(input())
    print(len(ans))
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
d = sorted([int(input()) for _ in range(n)])[::-1]
ans = 1
mx = d[0]
for i in d[1:]:
    if i < mx:
        ans += 1
        mx = i
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())
ans = []
for i in range(N):
  ans.append(int(input()))
  
print(len(set(ans)))

Submission status: Accepted

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

# 重複を排除して要素数を表示
print(len(list(set(mochi_cm))))

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:
n = int(input())
d_list = []
for i in range(n):
    d = int(input())
    d_list.append(d)
d_set = set(d_list)
print(len(d_set))

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

# 鏡餅の数
N = int(input())
# 違う大きさの鏡餅の集合
N_set = set()

# 重複排除しながら読み取る
for id in range(N):
    N_set.add(int(input()))

# 重複排除した鏡餅の個数
print(len(N_set))

Submission status: Accepted

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

print(len(set(d)))

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    d = {int(input()) for i in range(n)}
    print(len(d))
main()

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(d)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

n = int(input().rstrip())

print(len(set([int(input()) for i in range(n)])))

Submission status: Accepted

Solution code:
N = int(input())

d = []
for n in range(N):
    d += [int(input())]

d.sort()

ret = 0
dmin = 0
for i in range(N):
    if dmin<d[i]:
        ret += 1
        dmin = d[i]
print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_count = int(input())
mochis = { int(input()) for x in range(input_count) }
print(len(mochis))

Submission status: Accepted

Solution code:
# coding:utf-8
def main():
    n = int(input())
    s = set(map(int, [input() for i in range(n)]))
    print(len(s))

if __name__ == '__main__' :
    main()

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 = [int(input()) for _ in range(n)]
d = set(d)
print(len(d))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

ct = 0
m_ini=0 
while max(s)>0:
    m_ini = max(s)
    for i in range(n):
        if s[i]== m_ini:
            s[i]=0
        else:
            pass
    ct = ct+1
print(ct)

Submission status: Accepted

Solution code:
N = int(input())
D = list(int(input()) for i in range(N))
D.sort(reverse = True)

counter = 1
for i in range(N-1):
    if D[i]>D[i+1]:
        counter += 1
print(counter)

Submission status: Accepted

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

print(len(set(D)))

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Thu Mar 12 19:59:40 UTC 2020
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()

N = ni()
D = nin(N)
D.sort()

ans = 1
for i in range(N - 1):
    if D[i] < D[i + 1]:
        ans += 1

print(ans)

Submission status: Accepted

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

a.sort(reverse=True)

c = 1
b_i = a[0]
for i in a[1:]:
    if i >= b_i:
        continue
    c = c + 1
    b_i = i

print(c)

Submission status: Accepted

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

d.sort(reverse=True)

cnt=1
for i in range(N-1):
    if d[i]!=d[i+1]:
        cnt+=1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy
f=[]
for i in range(int(input())):f.append(int(input()))
print(len(numpy.unique(f)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
firstint = int(input())
inputary = [int(input()) for i in range(firstint)]
inputary.sort(reverse=True)
counter = 1
Comparisoner = inputary[0]
for elm in inputary:
    if Comparisoner > elm:
        counter +=1
    elif Comparisoner is elm:
        continue
    else:
        break
    Comparisoner = elm

print(counter)

Submission status: Accepted

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

print(len(D))

Submission status: Accepted

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

print(len(set(d)))

Submission status: Accepted

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

dan = len(set(d))

print(dan)

Submission status: Accepted

Solution code:
# Problem B - Kagami Mochi

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

d_list = set(d_list)
ans = len(d_list)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    d = [0] * 100
    for i in range(N):
        d[int(input()) - 1] = 1
    print(sum(d))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#sort＞＞イコールならマイナス
#input
N = int(input())

#複数段の整数を配列に入力
d=[int(input()) for i in range(N)]
count = N

#sort
d.sort()

for n in range(0,N):
    if d[n-1] == d[n]:
        count -=1

if count == 0:
    count= 1
#output
print(count)

Submission status: Accepted

Solution code:
n = int(input())
flag = [0] * 101

for i in range(n):
    d = int(input())
    flag[d] = 1

result = 0
for i in range(101):
    result += flag[i]

print(result)

Submission status: Accepted

Solution code:
n = int(input())
s = []
for _ in range(n):
    d = int(input())
    if not d in s:
        s.append(d)
print(len(s))

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())
d=[int(input()) for i in range(N)]
A=[]
d.sort(reverse=True)
for j, n in enumerate(d):
    if j==0:
        A.append(n)
    else:
        if A[-1]>n:
            A.append(n)
        else:
            pass
print(len(A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    n=int(input())
    d=[int(input()) for i in range(n)]

    print(len(set(d)))

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = [int(input()) for _ in range(int(input()))]
nums_dict = dict()
for i in nums:
    nums_dict[i] = True
print(len(nums_dict.keys()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


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

    N = int(sys.stdin.readline().rstrip())
    lines = [int(sys.stdin.readline().rstrip()) for _ in range(N)]
    print(len(set(lines)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
d = []
for _ in range(N):
  d.append(int(input()))
d.sort()
count = 0
max = 0
for i in range(N):
  if max < d[i]:
    count += 1
    max = d[i]
print(count)

Submission status: Accepted

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

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

resolve()

Submission status: Accepted

Solution code:
N = int(input())
array = {}
for i in range(N):
    array[input()] = 0
print(len(array.keys()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import Counter

def main():
    n = int(input())

    d = [0] * n
    for i in range(n):
        d[i] = int(input())

    item = Counter(d)
    print(len(item))

main()

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(D)))

Submission status: Accepted

Solution code:
n = int(input())
#s = input()
#n, k= map(int,input().split())
#da = list(map(int,input().split()))

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

print(len(set(d)))

Submission status: Accepted

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

print(len(set(di)))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
d = {}
for i in range(N):
    a = int(input())
    if d.get(a) is None:
        d[a] = 1
print(len(d))

Submission status: Accepted

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

for _ in range(N):
  D.append(int(input()))
print(len(set(D)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def Kagami_Mochi(n , dl):

    ans = len(set(dl))

    return ans

def main():
    n = int(input())
    dl = [str(input()) for i in range(n)]
    print(Kagami_Mochi(n , dl))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(len(set(l)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
## coding: UTF-8
N = int(input())
a = []

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

#print(a) #入力されたリストの受け取り

b = [] #被りがなかったものに関しては取り入れる
for i in range(len(a)):
    if( (a[i] in b) == False ):
        b.append(a[i])
    #print(a[i] in b)
    #b.append(a[i])
#print(b)
print(len(b))

Submission status: Accepted

Solution code:
# ABC 085 B
import numpy as np

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

d = np.array(d)
ans = len(np.unique(d))
print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC085

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

print(len(set(d)))

Submission status: Accepted

Solution code:
N = int(input())

d = []

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

s = list(set(d))

print(len(s))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 標準入力
num = int(input())
data = [int(input()) for i in range(num)]
# 降順にソート
data.sort(reverse=True)
# 初期化
res = 1

for i in range(len(data) - 1):
    if data[i] > data[i + 1]:
        res += 1

print(res)

Submission status: Accepted

Solution code:
n = int(input())
d = set([int(input()) for _ in range(n)])
print(len(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())

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

import numpy as np

n = np.unique(d_list)
print(len(n))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(s))

Submission status: Accepted

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

print(len(list(set(MOCHIS))))

Submission status: Accepted

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

for i in range(a):
  a_list.append(int(input()))
  
a_set = set(a_list)

print(len(a_set))

Submission status: Accepted

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

uniq_D = list(set(D))
print(len(uniq_D))

Submission status: Accepted

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

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

print(len(kagami_mochi))

Submission status: Accepted

Solution code:
#085_B
n=int(input())
S=[input() for _ in range(n)]
print(len(set(S)))

Submission status: Accepted

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

Submission status: Accepted

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

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()))
s=set(d)
print(len(s))

Submission status: Accepted

Solution code:
n = int(input())
x = []
ans_dict = {}
for _ in range(n):
    x.append(input())
for i in x:
    if i not in ans_dict:
        ans_dict[i] = 1
    else:
        ans_dict[i] = ans_dict[i]+1
print(len(ans_dict))

Submission status: Accepted

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

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

kagami_mochi = set()
for i in range(N):
    mochi_size = int(input())
    kagami_mochi.add(mochi_size)
    
print(len(kagami_mochi))

Submission status: Accepted

Solution code:
n = int(input())
d = []
for i in range(n):
    d.append(int(input()))
res = 0
for i in range(len(d)):
    a = 1
    some = d[i]
    if(i > 0):
        for j in range(i):
            if(some == d[j]):
                a = 0
                break
    res = res + a
print(res)

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 = list()
for i in range(n):
    d.append(int(input()))
print(len(set(d)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def resolve():
    N = int(input())
    t = dict()
    ans = 0
    for i in range(N):
        n = int(input())
        is_exists = t.get(n, False)
        if not is_exists:
            ans += 1
            t[n] = True
    print(ans)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

result = 1
if N == 0:
	result = 0
else:
	for i in range(N-1):
		if Dj[i] != Dj[i+1]:
			result += 1
print(result)

Submission status: Accepted

Solution code:
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7

N=I()
d=[0]*N
for i in range(N):
    d[i]=I()
    
d.sort()
ans=N
for i in range(N-1):
    if d[i+1]==d[i]:
        ans-=1
        
print(ans)

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:
n=int(input())
print(len(set([int(input()) for _ in range(n)])))

Submission status: Accepted

Solution code:
n = int(input())
d = sorted(map(int,[input() for i in range(n)]),reverse = True)
#list d 内の要素間で大きさを比較して同じ数である数aを数える。
a = 0
ans = 0
#
if n != 1:
     for j in range(n-1):
         if d[j]==d[j+1]:
             a+=1

ans = n - a
print(ans)

Submission status: Accepted

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

if __name__ == '__main__':
    resolve()

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())
S = []
for _ in range(N):
    S.append(input())
print(len(list(set(S))))

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    r = [int(input()) for i in range(n)]
    r.sort()
    counter = 0
    tmp = 0
    for i in range(n):
        if (r[i] > tmp):
            tmp = r[i]
            counter += 1
    print(counter)
main()

Submission status: Accepted

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

d = sorted(d)
cnt = 0

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

print(n - cnt)

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()
res = [a[i] for i in range(1, n) if not a[i] == a[i-1]]

print(len(res) + 1) # a[0]は内定済みなので+1

Submission status: Accepted

Solution code:
input()
D = set()
while True:
    try:
        D.add(int(input()))
    except EOFError:
        break
print(len(D))

Submission status: Accepted

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

Submission status: Accepted

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

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())
a = [int(input()) for i in range(N)]
a.sort()
for k in range(N-1):
    if a[k] == a[k+1]:
        a[k] =-1

b=[a[k] for k in range(N) if a[k] != -1]
print(len(b))

Submission status: Accepted

Solution code:
def solve():
    N = int(input())
    d = [int(input()) for _ in range(N)]
    return len(set(d))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
d=[list(map(int,input())) for _ in range(n)]
d.sort()
d.append(0)
ans=0
for i in range(n):
    if d[i]!=d[i+1]:
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

di = set(map(int, [input() for i in range(n)]))

print(len(di))

Submission status: Accepted

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

s=set(ls)
print(len(s))

Submission status: Accepted

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

ls.sort(reverse=True)
k=1

for i in range (n-1):
  if ls[i]>ls[i+1]:
    k+=1
    
print(k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input().strip())

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

final = list(set(nums))
print(len(final))