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: Wrong Answer

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

for i in range(num):
    n = int(input())
    a.append(n)
    
myset = set(a)

len_list = len(frozenset(myset))

print(myset)

print(len_list)

Submission status: Wrong Answer

Solution code:
s = list(str(input()))
t = list(str(input()))

asc_s = sorted(s)
desc_t = sorted(t, reverse=True)

print("Yes" if ''.join(asc_s) < ''.join(desc_t) else "No")

Submission status: Wrong Answer

Solution code:
import sys

a = []
for l in sys.stdin:
    a.append(int(l))
    
myset = set(a)

len_list = len(frozenset(myset))

print(len_list - 1)

Submission status: Wrong Answer

Solution code:
import sys

a = []
for l in sys.stdin:
    a.append(int(l))
    
myset = set(a)

len_list = len(frozenset(myset))

print(len_list - 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()
a = sorted(list(map(int,input().split())),reverse=True)

print(sum(a[::2])-sum(a[1::2]))

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=A.copy()
counter=0
for num in range(len(A)):
  if A[num] in B:
    counter+=1
    while A[num] in B:
      B.remove(A[num])
  
print(counter)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
D = sorted([int(input()) for _ in range(N)])
if len(D) > 1:
    i,prev = 0,None
    while i < (len(D)-1):
        if D[i] == D[i+1]: 
            D.pop(i+1)
        else:
            prev = D[i]
            i +=1
            
        print(i)
print(len(D))

Submission status: Wrong Answer

Solution code:
N = int(input())
D = sorted([int(input()) for _ in range(N)])
if len(D) > 1:
    i,prev = 1,D[0]
    while True:
        if D[i] == prev: 
            D.pop(i)
        else:
            i +=1
            prev = D[i]
        if i == (len(D)-1):
            break
print(len(D))

Submission status: Wrong Answer

Solution code:
N = int(input())
D = sorted([int(input()) for _ in range(N)])
if len(D) > 1:
    i,prev = 1,D[0]
    while i != (len(D)-1):
        if D[i] == prev: 
            D.pop(i)
        else:
            i +=1
            prev = D[i]
print(len(D))

Submission status: Wrong Answer

Solution code:
N = int(input())
D = sorted([int(input()) for _ in range(N)])
i,prev = 0,D[0]
while i != (len(D)-1):
    if D[i] == prev: 
        D.pop(i)
    else:
        i +=1
        prev = D[i]
print(len(D))

Submission status: Wrong Answer

Solution code:
n = int(input())
d = [int(input()) for _ in range(n)]
cnt = 1
r = 1
for i in range(n-1):
    if d[i] > d[i+1]:
        cnt += 1
        cnt = max(cnt, r)
    else:
        cnt == 1
        
print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
d = [int(input()) for _ in range(n)]
cnt = 1
r = 1
for i in range(n-1):
    if d[i] > d[i+1]:
        cnt += 1
        cnt = max(cnt, r)
    else:
        cnt == 0
        
print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

len(list(set(d_i_list)))

Submission status: Wrong Answer

Solution code:
n = int(input())

s = set()
for i in range(n):
  s.add(int(input()))

print(min(3,len(s)))

Submission status: Wrong Answer

Solution code:
# ABC 085 B - Kagami Mochi
N = int(input())

dn = [0] * N
for i in range(N):
    dn[i] = int(input())

j = N
for i in range(100):
    k = dn.count(i)
    if k >= 2:
        j = j - (k - 1)
print(j)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
B=[]
print(A)
while len(A)!=0:
  if A[0] not in B:
    B.append(A[0])
  A.pop(0)
print(len(B))

Submission status: Wrong Answer

Solution code:
n=int(input())
b=int(input())
ct=1
for i in range(n-1):
    a=int(input())
    if a<b:
        ct+=1
    b=a
print(ct)

Submission status: Wrong Answer

Solution code:
N=int(input())
ls=[int(input()) for i in range(N)]
ls=sorted(ls,reverse=True)
A=0
i=0
while i<N:
  if ls[i-1]==ls[i]:
    A=A+1
  i=i+1
print(N-A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#from heapq import heapify,heappush,heappop
N = int(input())

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

print(len(S))

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []
for i in range(N):
  a.append(int(input()))
a.sort
count = 1
i = 0
while i < N-1:
  if a[i] != a[i+1]:
    count += 1
  i += 1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())

strlist = [input() for i in range(n)]
intlist = [int(x) for x in strlist]
sortlist = sorted(intlist)

print(sortlist)

temp = 0
ans = 0

for d in sortlist:
  if int(d) > temp:
    temp = int(d)
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
N = list(map(int,input().split()))
S = set(N[1:])
print(int(len(S)))

Submission status: Wrong Answer

Solution code:
N = list(map(int,input().split()))
S = set(N[1:])
print(len(S))

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
for i in range(n):
  s0 = int(input())
  l.append(s0)
l.sort()
ans = 1
for i in range(1,n-1):
  if l[i] > l[i-1]:
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n_d = list(map(int, input().split()))
d = n_d[1:]
max_d = len(set(d))
print(max_d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


d.sort()
now = 0
ans = 0
for di in d:
  if di > now:
    ans += 1
    now = di
    
print(ans)

Submission status: Wrong Answer

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

a = sorted(a, reverse=True)

for i in range(n-1):
  if a[i]<a[i+1]:
    break
  else:
    ans+=1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
D = list(map(int, input().split()))
D.sort(reverse=True)
ans = 0
pre_d = float('inf')
for d in D:
  if d < pre_d:
    ans += 1
    pre_d = d

print(ans)

Submission status: Wrong Answer

Solution code:
import sys


def main(lines):
    print(len(set(lines[1:-1])))


if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Wrong Answer

Solution code:
# Problem: https://atcoder.jp/contests/abc085/tasks/abc085_b
# Python 2nd Try

import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solver(riceCakesList):
    result = 0
    print("LIST={}".format(riceCakesList))
    # algorithm
    result = len(set(riceCakesList))
    return result
if __name__ == "__main__":
    N = II()
    DI = list()
    for _ in range(N):
        DI.append(II())
    print("{}".format(solver(DI)))

Submission status: Wrong Answer

Solution code:
n = int(input())

dList = [] 

count = 1

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

i = 1

for d in dList:
  if i < len(dList):
    if d > dList[i]:
      count += 1
    i += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

d.sort(reverse=True)
cnt = 0
for i in range(N):
    if i==0:
        cnt += 1
        continue
    try:
        if d[i]==d[i+1]:
            continue
        else:
            cnt += 1
    except:
        break

print(cnt)

Submission status: Wrong Answer

Solution code:
P = [1,2,3,4,5]
S = sum(P)
print(S)

Submission status: Wrong Answer

Solution code:
import numpy as np

n = int(input())
d = [int(input()) for _ in range(n)]
i0 = 101
count = 0
d.sort()
d.reverse()
for i in range(0, n - 1):
    if i0 > d[i]:
        count += 1
        i0 = d[i]

print(count)

Submission status: Wrong Answer

Solution code:
N=int(input())
d=[0 for i in range(N)]
for i in range(N):
	d[i]=int(input())
for i in range(N):
	for j in range(N-1):
		if d[j]<d[j+1]:
			temp=d[j]
			d[j]=d[j+1]
			d[j+1]=temp
i=0
while(i<len(d)-1):
	if d[i]==d[i+1]:
		del(d[i+1])
	i=i+1
print(len(d))

Submission status: Wrong Answer

Solution code:
n=int(input())
d=int(input())
k=1
for i in range(n-1):
  s=int(input())
  if d>s:
    k+=1
  d=s
print(k)

Submission status: Wrong Answer

Solution code:
def resolve():
    # 整数 1 つ
    n = int(input())
    # 整数複数個
    # a, b, c = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    D = [int(input()) for i in range(n)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    Dsort = sorted(D)
    cnt = 1
    for i in range(1, n-1):
        if Dsort[i] > Dsort[i-1]:
            cnt += 1

    print(cnt)
resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# n, total = map(int, input().split())
n, total = 9, 45000
min = n * 1000
max = n * 10000
if (total > max) or (total < min):
    print('-1 -1 -1')
else:
    min_man = (total - (5000 * n)) // 10000
    n -= min_man
    total -= min_man*10000
    min_sen = (total % 5000) // 1000
    total -= min_sen*1000
    n -= min_sen
    success = False
    for i in range(int(total // 10000)+1):
        if success:
            break
        ii = total - i*10000
        for j in range(int(ii // 5000)+1):
            jj = ii - j*5000
            k = jj//1000
            if i + j + k + min_sen + min_man == n:
                print(str(i+min_man) + ' ' + str(j) + ' ' + str(k+min_sen))
                success = True
                break

    if not success:
        print('-1 -1 -1')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,*L = map(int,open(0).read().split())
print(set(L))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result_list=[]

for i in range(len(N_list)):
    if i==(a for a in N_list):
        result_list.append(i)

print(len(result_list))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(len(d))

Submission status: Wrong Answer

Solution code:
num = int(input())
mochi = [int(input()) for m in range(0, num)]

mx = max(mochi)
mn = min(mochi)

maisuu = [n for n in mochi if n > mn and mx > n ]
ans = len(set(maisuu))+2 
print(ans)

Submission status: Wrong Answer

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

d.sort()
counter = 0

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

print(N-counter)

Submission status: Wrong Answer

Solution code:
n = int(input())
c = 0
list = []
for i in range(n):
    if not i in list:
        list.append(i)
        c += 1
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input()) #1行目のNを取得する
s = [input() for i in range(N)] #複数行の数値の入力を取得

s_set = set(s)

l = len(s)

print(l)

Submission status: Wrong Answer

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

s_set = set(s)

length = len(s)

print(length)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
d = [int(input()) for i in range(N)]
count = 1
for j in range(N-1):
    if (d[j] != d[j+1]):
        count += 1
print(count)

Submission status: Wrong Answer

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

print(set(arr))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

#sort
d.sort()

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

#output
print(count)

Submission status: Wrong Answer

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

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

#sort
d.sort()

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

#output
print(count)

Submission status: Wrong Answer

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

    ret = 0
    tmp = float('inf')
    for line in lines:
        if tmp > line:
            ret += 1
        tmp = line

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
D = []
for _ in range(N):
    D.append(int(input()))
total=len(D)
total+=len(D)
for i in D:
    for j in D:
        if i==j:
            total-=1
print(total)

Submission status: Wrong Answer

Solution code:
n = int(input())
mochi = len(set(map(int,input())))

print(mochi)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = []

for i in set(list):
    a.append(list.count(i))
    
if len(set((a))) == 1:
    print(1)
else:
    print(len(set((a))))

Submission status: Wrong Answer

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

a = []

for i in range(n):
    a.append(list.count(i))
print(len(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(0, N-1):
  if d[i] < d[i+1]:
    count += 1
    
print(count)

Submission status: Wrong Answer

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

d.sort()
first = d[0]

for i in range(1, n):
  if first < d[i]:
    res += 1
  first = d[i]
  
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
d = list(int(input()) for _ in range(n))
ans = 0
d.sort(reverse=True)
for i in range(len(d)):
    if i >= len(d)-1:
        break
    elif d[i] > d[i+1]:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
d = list(input() for _ in range(n))
ans = 0
d.sort(reverse=True)
for i in range(len(d)):
    if i >= len(d)-1:
        break
    elif d[i] > d[i+1]:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

lst = list(map(int, [input() for i in range(n)]))

set(lst)

print(len(lst))

Submission status: Wrong Answer

Solution code:

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

print(d)

print(len(set(d)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

mochi = []
for i in range(N):
    if mochi.count(d[i]) == 0:
        print(d[i])
        mochi.append(d[i])

print(len(mochi))

Submission status: Wrong Answer

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

# d = [3,15,15]

d.sort(reverse=True)

current_mochi = 0
next_mochi = 0
counter = 0

for i,num in enumerate(d):
    next_mochi = num
    if i == 0:
        counter+=1
        current_mochi = num
    elif i + 1 == len(d):
        break
    elif current_mochi > next_mochi:
        counter+=1
        current_mochi = num

print(counter)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

d_2 = sorted(d, reverse=True)
ans = 1
for i in range(1, n):
    if d_2[i] < d_2[i-1]:
        ans += 1
    else:
        break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
b = int(input())
nums = [int(input()) for i in range(b)]
print(len(set(nums)) if not len(set(nums)) == 1 else "0")

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 1
d = []
for i in range(N):
  d.append(int(input()))
sorted(d,reverse=True)
for i in range(len(d)-1):
  if d[i+1]<d[i]:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input()) 
d = [int(input()) for i in range(n)] 
k=0
c=0
for i in range(n):
  for j in range(n-i-1):
    if d[j] > d[j+1]:
      k = d[j]
      d[j] = d[j+1]
      d[j+1] = k
      
for i in range(n-1):
  if d[i]==d[i-1]:
    c=c+1
      
print(n-c)

Submission status: Wrong Answer

Solution code:
n = int(input()) 
d = [int(input()) for i in range(n)] 
k=0
c=0
for i in range(n):
  for j in range(n-i-1):
    if d[j] > d[j+1]:
      k = d[j]
      d[j] = d[j+1]
      d[j+1] = k
      
for i in range(n-1):
  if d[i]==d[j-1]:
    c=c+1
      
print(n-c)

Submission status: Wrong Answer

Solution code:
n = int(input()) 
d = [int(input()) for i in range(n)] 
k=0
c=0
for i in range(n):
  for j in range(n-i-1):
    if d[j] > d[j+1]:
      k = d[j]
      d[j] = d[j+1]
      d[j+1] = k
      
for i in range(n-1):
  if d[i]!=d[i+1]:
    c=c+1
    if i==n-2:
      c=c+1
      
print(c)

Submission status: Wrong Answer

Solution code:
n = int(input()) 
d = [int(input()) for i in range(n)] 
k=0
c=0
for i in range(n):
  for j in range(i-1):
    if d[j] > d[j+1]:
      k = d[j]
      d[j] = d[j+1]
      d[j+1] = k
      
for i in range(n-1):
  if d[i]!=d[i+1]:
    c=c+1
    if i==n-2:
      c=c+1
      
print(c)

Submission status: Wrong Answer

Solution code:
import numpy as np

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


print(len(np.unique(d)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
a = sorted(map(int, [input() for i in range(N)]), reverse=True)

dan = 1

for i in range(N-1):
	if a[i] > a[i+1]:
		dan += 1
	else:
		break

print(dan)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = sorted(map(int, [input() for i in range(N)]), reverse=True)

dan = 0

for i in range(N-1):
	if a[i] > a[i+1]:
		dan += 1

print(dan)

Submission status: Wrong Answer

Solution code:
n = int(input())

a_L = []
for val in range(n):
    a_L.append(int(input()))

a_L = list(set(a_L))
print(len(a_L)-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
lst = [int(input()) for x in range(n)]
if n==1:
    print(1)
else:
    split_info = [0] + [i for i in range(1, n) if lst[i-1]<=lst[i]] + [n-1]
    if len(split_info)==2:
        print(n)
    else:
        result = [len(lst[split_info[i]:split_info[i+1]]) for i in range(len(split_info)-1)]
        print(max(result))

Submission status: Wrong Answer

Solution code:
n=int(input())
d=[int(input()) for _ in range(n)]
d.sort()
print(d)
cnt=1
for i in range(n-1):
    if(d[i]!=d[i+1]):
        cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
n=int(input())
d=[int(input()) for _ in range(n)]
d.sort()
cnt=1
for i in range(n-1):
    if(d[i]!=d[i-1]):
        cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [0]*N
#最大値を記録しておく
m = 0
#答えとなる変数
ans = 0
#重なっている数をカウントする変数
count = 0
#入力を受け付ける
for i in range(N):
    A[i] =  int(input())
    if(m>A[i]):
        m = A[i]
    elif(m == A[i]):
        count +=1
ans =N-count
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    number_of_steps = 0
    previous_diameter = 0
    for i in range(N):
        if d[i] > previous_diameter:
            number_of_steps += 1
        previous_diameter = d[i]

    print(number_of_steps)

# solve()

Submission status: Wrong Answer

Solution code:
n = int(input())
d = [int(input()) for i in range(n)]
cnt = 1
d = sorted(d)
print(d)
for i in range(n-1):
    if d[i+1] > d[i]:
        cnt += 1
    elif d[i+1] < d[i]:
        break
print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(len(mochi))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
d = list(int(input()) for i in range(n))
a = 0

d.sort(reverse=True)
for i in range(n):
  if d[i] == d[i-1]:
    continue
  else:
    a += 1
  
print(a)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n=int(input())
d_list=list(map(int,input().split()))
d_set = set(d_list)
print(len(d_set))

Submission status: Wrong Answer

Solution code:
#nが総数
n = int(input ())
print(n)


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

d2 = sorted(d)
#print(d2)

count=1
for i in range(n-1):
    if( d2[i] < d2[i+1] ):
        count += 1
        
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
num = list()

for i in range (0,N-1):
  d = int (input())
  num.append(d)
  
print(len(set(num)))

Submission status: Wrong Answer

Solution code:
import sys
input1 = input().rstrip()
input_list = list()
for i in range(int(input1)):
    inputs = input().rstrip()
    input_list.append(int(inputs))

input_list.sort()
print(input_list)

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

Submission status: Wrong Answer

Solution code:
input()
a=sorted(map(int,input().split()))[::-1]
print(sum(a[::2])-sum(a[1::2]))

Submission status: Wrong Answer

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

lista=set(lista)
print(lista)
print(len(lista))

Submission status: Wrong Answer

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

print(len(set(sorted(A))))

Submission status: Wrong Answer

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

for i in range(n):
  getn = int(input())
  a.append(getn)
  
b = set(a)

print(len(a)-len(b)+1)

Submission status: Wrong Answer

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

dL.sort()
counter = 0
 
for n in range(N-1):
  n = n + 1
  if dL[n-1] == dL[n]:
    pass
  else:
    counter += 1
 
if counter == 0:
  counter = 1
 
print(counter)

Submission status: Wrong Answer

Solution code:
MOCHI_NUM = int(input())
MOCHIS = [int(MOCHI) for MOCHI in input().split(' ')]

print(len(set(MOCHIS)))

Submission status: Wrong Answer

Solution code:
n = int(input())

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

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

d.sort()

print(d)
print(len(d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
d = [int(input()) for i in range(N)]
print(d)
d_sorted = sorted(d)
size = 0
count = 0
for i in range(N):
    if(size < d_sorted[i]):
        count += 1
        size = d_sorted[i]
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
d = [int(input()) for i in range(N)]
print(d)
d_sorted = sorted(d)
size = 0
count = 0
for i in range(N):
    if(size < d_sorted[i]):
        count += 1
        size = d_sorted[i]
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = int(input())
d = list(map(int, input().split(" ")))
result = 1

d.sort()
for i in range(1, len(d)):
    if d[i-1] < d[i]:
        result += 1

print(result)

Submission status: Wrong Answer

Solution code:
length = int(input())
mochi = [int(input()) for i in range(length)]
sorted_mochi = sorted(mochi,reverse=True)
stage = 0
for i in range(0,length-1):
  if sorted_mochi[i] > sorted_mochi[i+1]:
    stage +=1
  else:
    pass
print(stage)

Submission status: Wrong Answer

Solution code:
N = int(input())
l = 0
count =	0
dlist = []
for i in range(N):
    dlist.append(int(input()))

for i in range(N):
    m =	max(dlist)
    if(l != m):
        count += 1
        dlist[dlist.index(m)] = 0
        l =	m

print(count)

Submission status: Wrong Answer

Solution code:
def twonumberlist(lists,compans,l):
    list1=[]
    list1.append(lists[l])
    for i in range(l+1,len(lists)):
        if lists[i]<list1[-1]:
            list1.append(lists[i])
        else:
            continue
    compans.append(len(list1))



N=int(input())
s=[int(input())for i in range(N)]
#渡された1数の間でリストを作成して、不等式満たす数数を返す
compans=[]
for i in range(len(s)):
    twonumberlist(s,compans,i)
print((max(compans)))

Submission status: Wrong Answer

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

cnt = 1
tmp = LIST.pop()
while True:
    if len(LIST) == 0:
        break
    if LIST.pop() < tmp:
        cnt = cnt + 1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(len(set(D)))

Submission status: Wrong Answer

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

print(len(set(D)))

Submission status: Wrong Answer

Solution code:
n = int(input())
an = []
cnt = 0

for i in range(n):
  an.append(int(input()))
  
sorted_an = sorted(an, reverse=True)

for i in range(len(sorted_an)-1):
  if i == 0:
    cnt += 1
  else:
    if sorted_an[i] > sorted_an[i+1]:
      cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

d = []

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

print(len(set(d)))

Submission status: Wrong Answer

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

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

    backet = {}
    for i in range(0, 101):
        backet[i] = 0

    for i in range(0, n):
        backet[d[i]] += 1

    count = 0
    for i in range(0, 100):
        if backet[i] > 0:
            count += 1
            
    print(count)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(len(dd))

Submission status: Wrong Answer

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

res = 0
data = 0
for i in range(N):
    if a[i] > data:
        res += 1
        data = a[i]

print(res)