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

N = int(input())

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

mochi_list.sort()

y = -1
num = 0
for i in mochi_list:
	if y < i:
		num += 1
		y = i
	
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> None:
    dic = set()
    n = int(next_str())

    for i in range(n):
        dic.add(int(input()))

    print(len(dic))


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(input())
a=[]
for i in range(0,n):
  a.append(int(input()))
b=set(a)
print(len(b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input());
mochi = [];
for x in range(n):
    n = int(input());
    mochi.append(n);


mochi.sort(reverse=True)
dan = 0;
low = 101;
for x in mochi:
    if x < low:
        dan += 1;
        low = x;
print(dan);

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
d = list(map(int, [input() for i in range(n)]))

d.sort()
d.reverse()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections as c

N = int(input())
d = []
for _ in range(N):
    cnt = c.Counter(d)
    foo = input()
    if cnt[foo] == 0:
        d.append(foo)

print(len(d))

Submission status: Accepted

Solution code:
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 = int(input())
    D.append(d)
D = sorted(D,reverse = True)
D = list(set(D))
print(max(len(D),1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n = ni()
ds = set()
for _ in range(n):
    ds.add(ni())
    
print(len(ds))

Submission status: Accepted

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

import collections
d_c=collections.Counter(d_list)
d_val, d_count=zip(*d_c.most_common())
print(len(d_val))

Submission status: Accepted

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
prev = 0
cnt = 0
for a in A:
    if a > prev:
        prev = a
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

a = list(set(a))

print(len(a))

Submission status: Accepted

Solution code:
n = int(input())
d = sorted([int(input()) for x in range(n)], reverse = True)
d2 = []
for x in d:
    if x not in d2:
        d2.append(x)
print(len(d2))

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:
n = int(input())
d = []
for i in range(n):
	d.append(int(input()))
import collections

d = collections.Counter(d)
print(len(d.keys()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def answer():

    N = int(input())
    d = {}

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

    print(len(d))


answer()

Submission status: Accepted

Solution code:
def answer():

    N = int(input())

    s = set()

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

    print(len(s))


answer()

Submission status: Accepted

Solution code:
import math as M
N=int(input())
list=[]
for i in range(N):
    n=int(input())
    if n not in list:
        list.append(n)

print(list.__len__())

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

print(len(collections.Counter(d)))

Submission status: Accepted

Solution code:
n = int(input())

d_set = set(map(int, [input() for _ in range(n)]))
print(len(d_set))

Submission status: Accepted

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

Submission status: Accepted

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

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())
nl = [int(input()) for i in range(1, n + 1)]
print(len(set(nl)))

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
d = []
flag = 0

for i in range(0, 101):
    d.append(0)
for i in range(0, N):
    x = int(input())
    d[x] = 1
for i in d:
    flag += i

print(flag)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

d = []

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

#d.sort()
s = set(d)

print(len(s))

Submission status: Accepted

Solution code:
n = int(input())
index=0
mochiL =[]
while index < n:
    d = int(input())
    if d in mochiL:
        pass
    else:
        mochiL.append(d)
    index+=1

print(len(mochiL))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
count = 0
ans_list = []
while count < n:
    ans_list.append(int(input()))
    count += 1
print(len(set(ans_list)))

Submission status: Accepted

Solution code:
a = int(input())
ans = []
for i in range(a):
    b = int(input())
    if not b in ans:
        ans.append(b)

print(len(ans))

Submission status: Accepted

Solution code:
#AtCorder Beginner Contest 085 B Kagami Mochi
n = int(input())
line = list(set(list(map(int, [ input() for i in range(n)]))))
print(len(line))

Submission status: Accepted

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

arr = list(set(arr))
print(len(arr))

Submission status: Accepted

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

print(len(set(list)))

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())
D=[]
count=1
for i in range(N):
  D.append(int(input()))
x=max(D)  
D.sort()
for i in range(N):
  if D[i]==x:
    break
  elif D[i]==D[i+1]:
    continue
  elif D[i]<D[i+1]:
    count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
d = list(map(int,[input() for i in range(N)]))
ans = []
for i in range(N):
    if not d[i] in ans:
        ans.append(d[i])
print(len(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(len(set(moti)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

N = int(stdin.readline().rstrip())
d = [int(stdin.readline().rstrip()) for _ in range(N)]
d.sort()

ans = 1
prev_mochi = d[0]
for i in range(1, len(d)):
    if d[i] > prev_mochi:
        ans += 1

    prev_mochi = d[i]

print(ans)

Submission status: Accepted

Solution code:
#encoding: utf-8
import os, sys
import math

def read_items_in_line(cast=int):
    return [cast(x) for x in sys.stdin.readline().strip(' \n').split(' ')]

N = read_items_in_line()[0]
d = []
for i in range(N):
    d += [read_items_in_line()[0]]

print(len(set(d)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(raw_input())
l = []
for i in range(n):
  l.append(int(raw_input()))
#print(l)

flag = [0] *110
#print(flag)
for j in l:
  if flag[j] == 0:
    flag[j] = 1
#print(flag)

num = 0
for k in flag:
#  print(k)
  if k == 1:
    num += 1
print(num)

"""
##これだとエラーでる
##flag[k]だとflag[0]かflag[1]にしかならないことに注意
num = 0
for k in flag:
  print(flag[k])
  if flag[k] == 1:
    num += 1
print(num)
"""

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(d)))

Submission status: Accepted

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

Submission status: Accepted

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

cnt_list = []
for i in range(N):
   if d[i] not in cnt_list:
       cnt_list.append(d[i])
print(len(cnt_list))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

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


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


def main():
    N = int(input())
    D = []
    for _ in range(N):
        D.append(int(input()))

    ans = 0
    pre = INF
    for d in sorted(D, reverse=True):
        if d < pre:
            ans += 1
            pre = d
    print(ans)


if __name__ == '__main__':
    main()

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:
#85b
n=int(input())
d=[input() for i in range(n) ]
d=set(d)
print(len(d))

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in range(N):
    tempD.append(D[i])

for i in range(len(D)):
    while tempD.count(D[i]) >= 2:
        tempD.remove(D[i])

print(len(tempD))

Submission status: Accepted

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

print(len(set(d_list)))

Submission status: Accepted

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

Submission status: Accepted

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

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(sorted(d_list))))

Submission status: Accepted

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

print(len(set(c)))

Submission status: Accepted

Solution code:
a = int(input())
b = []
for i in range(a):
    b.append(int(input()))
b.sort(reverse=True)
c = 0
cnt = 0
for i in b:
    if not i == c:
        cnt += 1
    c = i
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(len(set(list(input()for _ in[0]*int(input())))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

d_unique = list(set(d_list))

print(len(d_unique))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
list_d=[input() for i in range(n)]
new_list_d = set(list_d)
sum1 = len(list(new_list_d))
print(sum1)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    #入力
    n = int(input())
    lists = []
    for i in range(n):
        lists.append(int(input()))
    
    #リストからダブりを消す
    lists = list(set(lists))
    print(len(lists))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
list_d = [int(input()) for i in range(n)]
j = 101
ans = 0                                                                                                           

for i in sorted(list_d, reverse=True):
    if j <= i:
        continue
    else:
        ans += 1
        j = i

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int( input())
D = []
for i in range(N):
    D.append(int(input()))
D = sorted(D)
ans = 1
d_now = D[0]
for i in range(1,N):
    if d_now < D[i]:
        ans += 1
        d_now = D[i]
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N = int(input())
mochi = []
for i in range(N):
    mochi.append(int(input()))
    
mochi = sorted(mochi)
ans = 1
for m,n in zip(mochi[:-1],mochi[1:]):
    if not m == n:
        ans += 1
        
print(ans)

Submission status: Accepted

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

print(len(ans))

Submission status: Accepted

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

num_list = sorted(set(num_list))
print(len(num_list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())
print len(set([raw_input() for _ in xrange(n)]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input());
list = [];
for i in range(0,N):
	list.append(int(input()));

list.sort(reverse=True);

ans = 1;
for i in range(1,N):
	if list[i] != list[i - 1]:
		ans += 1;

print(ans);

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
print(np.unique(np.array([int(input()) for _ in range(n)])).shape[0])

Submission status: Accepted

Solution code:
N = int(input())
D = []
for i in range(N):
	D.append(int(input()))
D.sort()
d = 0
num = 0
for i in range(N):
	if d != D[i]:
		num += 1
	d = D[i]

print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# [2,2,4,5] = [3,3,3]
# 重複を排除したときの要素の数がその段数となる

def getElementNum(N,a):    
    """ 
    >>> getElementNum(4,[2,4,6,8])
    4
    """
    b = list(set(a))
    return len(b)

def main():
    N = int(input())
    a = []
    for i in range(N):
        a.append( int( input() ) )
    result = getElementNum(N,a)
    print(result)

if __name__ == '__main__':
    main()

# if __name__ == '__main__':
#    import doctest
#     doctest.testmod()

Submission status: Accepted

Solution code:
# ABC085 B Kagami Mochi
def main():
    n = int(input().strip())
    ds = [int(input()) for _ in range(n)]

    mochi = list(set(ds))
    mochi.sort()
          
    print(len(mochi))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

N=int(input())
A=[0]*N
for i in range(0,N):
    A[i]=input()
B=list(set(A))
print(len(B))

Submission status: Accepted

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

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

cout = 0
b = 500

for i in range(n):
	if b > max(a):
		cout += 1
		b = max(a)
	a.remove(max(a))
print(cout)

Submission status: Accepted

Solution code:
import collections

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

dic = collections.Counter(d)

print(len(dic.keys()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
#入力値を読み取る
N = input()
j = []
for i in range(int(N)):
    d = input()
    j = np.append(j,int(d))

#読み込んだjを降順にsort
sort = np.sort(j)
z = [sort[0]]
for i in range(len(j)-1):
    if (sort[i]<sort[i+1]):
        z = np.append(z,sort[i+1])
print(len(z))

Submission status: Accepted

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

d.sort()
d.append(0)
e.append(d[1])
for i in range(len(d)-1):
    if int(d[i])<int(d[i+1]):
        e.append(d[i+1])
print(len(e))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
f = [False]*101
c = 0
for i in range(N):
    d = int(input())
    if f[d]:
        continue
    f[d] = True
    c +=1

print(c)

Submission status: Accepted

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

unique = []

for i in a:
  if i not in unique:
    unique.append(i)

print(len(unique))

Submission status: Accepted

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

for i in range(0,N):
	li.append(int(input()))

print (len(set(li)))

Submission status: Accepted

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

l_unique = list(set(d))

print(len(l_unique))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
n=int(input())
dd=defaultdict(int)
for _ in range(n):
    dd[input()]+=1
print(len(dd.keys()))

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())
d = set([input() for i in range(N)])

print(len(d))

Submission status: Accepted

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

out=[]
for i in numbers:
  if i not in out:
    out.append(i)
print(len(out))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 19 03:01:30 2018

@author: ashida
"""

N = int(input())

ans = []

for i in range(N):
    d = int(input())
    if d in ans:
        tmp = 1
    else:
        ans.append(d)
        
print(len(ans))

Submission status: Accepted

Solution code:
N = int(input())
d = []
for n in range(N):
    d.append(int(input()))
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:
d = []
a = input()
a = int(a)
for i in range(a):
    i = input()
    i = int(i)
    d.append(int(i))
d.sort()
pre_i = -1
cnt = 0
for i in d:
    if(pre_i!=i):
        cnt = cnt + 1
    pre_i = i

print(cnt)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n=int(input())
S=set()
for i in range(n):
    
    S.add(int(input()))
    
print(len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(len(sorted(set([int(input()) for _ in [0]*int(input())]))))

Submission status: Accepted

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

cnt = int(input())
mochi_list = []
for i in range(cnt):
    mochi_list.append(int(input()))
# 餅リストから重複を削除
res_list = list(set(mochi_list))
# 結果リストの長さを出力
print(len(res_list))

Submission status: Accepted

Solution code:
N = int(input())
mochis = sorted([int(input()) for _ in range(N)], reverse=True)
res = 1
for idx in range(1, N):
  if mochis[idx] < mochis[idx - 1]:
    res += 1

print(res)

Submission status: Accepted

Solution code:
import numpy
import re
import math

def main():
	"""
	テストコード実行
	:return:
	"""
	n = int(input())
	print(len(set(list(map(int, [input() for i in range(n)])))))


if __name__ == '__main__':
	main()

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())

a=[]
for i in range(N):
 a.append(int(input()))
 a=list(set(a))

print(len(a))

Submission status: Accepted

Solution code:
print(len({input()for _ in[0]*int(input())}))

Submission status: Accepted

Solution code:
num = int(input())
InA = [int(input()) for i in range(num)]

ans = set(InA)

print (len(ans))

Submission status: Accepted

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

#個数を計算
size_syurui_uniq = set(size_syurui)
#print(size_syurui_uniq)
print(len(size_syurui_uniq))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = [input() for i in range(n)]
print('{}'.format(len(set(a))))

Submission status: Accepted

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

list.sort(reverse = True)

j = 0
cnt = 1
temp = list[0]

for j in range(N):
    if(temp > list[j]):
        temp = list[j]
        cnt = cnt + 1

print(cnt)

Submission status: Accepted

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

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:
def main():
    num_mochi = int(input())
    mochi_list = []
    for i in range(num_mochi):
        mochi_list.append(int(input()))
    print(len(set(mochi_list)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
input_lines = int(input())
num_list = []
for i in range(input_lines):
    s = input()
    num_list.append(s)

# print(num_list)

set_num = set(num_list)
# print(set_num)

set_length = len(set_num)
print(set_length)

Submission status: Accepted

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

Submission status: Accepted

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

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())
mochi = []
for i in range(N):
    mochi.append(int(input()))

mochi.sort()

count = N
for i in range(1,N):
    if(mochi[i-1] == mochi[i]):
        count = count - 1
print(count)

Submission status: Accepted

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

    ans = len(set(mochi))
    print(ans)

Submission status: Accepted

Solution code:

N = int(input())

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

print(len(set(D)))

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

D.sort()
for num in range(len(D)-1):
    if D[num] == D[num+1]:
        N -= 1
print(N)

Submission status: Accepted

Solution code:
n = int(input())
mlst = list()
for i in range(n):
  mochi = int(input())
  if not mochi in mlst:
    mlst.append(mochi)
print(len(mlst))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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