ZhenlongDai/ACPR huggingface dataset:
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
10
5
2

Expected output:
3


Actual output:
[2, 5, 10]
3


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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
d = list(map(int, input().split()))

d = list(set(d))

print(len(d))

Failing test case input:
4
46
19
20
4

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
d = [int(input()) for i in range(N)]

d = list(set(d))

print(len(d))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)      
    

Failing test case input:
4
46
19
19
4

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
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)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
size = 1
N = int(input())
d_s = []
for _ in range(N):
  d_s.append(int(input()))
d_s.sort()
d_s.reverse()
for i in range(1,N):
  if d_s[i] > d_s[i-1]:
    size += 1
print(size)

Failing test case input:
4
46
19
19
8

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
size = 1
N = int(input())
d_s = []
for _ in range(N):
  d_s.append(int(input()))
d_s.sort()
d_s.reverse()
for i in range(1,N):
  if d_s[i] < d_s[i-1]:
    size += 1
print(size)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
nums = map(int, input().split())
print(len(set(nums)))


Failing test case input:
3
29
36
2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
nums = [int(input()) for _ in range(int(input()))]
print(len(set(nums)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
ans = 1
d = []
for i in range(N):
  d.append(int(input()))
sorted(d,reverse=True)
print(set(d))


Failing test case input:
3
29
15
14

Expected output:
3


Actual output:
{29, 14, 15}


Fixed submission (verdict: Accepted):
N = int(input())
ans = 1
d = []
for i in range(N):
  d.append(int(input()))
sorted(d,reverse=True)
k = set(d)
K = list(k)
print(len(K))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
mochi = []
for i in range(N):
  mochi.append(int(input()))
print(list(set(mochi)))

               

Failing test case input:
4
27
19
20
7

Expected output:
4


Actual output:
[19, 27, 20, 7]


Fixed submission (verdict: Accepted):
N = int(input())
mochi = []
for i in range(N):
  mochi.append(int(input()))
print(len(list(set(mochi))))

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
7
50
40
50
110
50
34
59

Expected output:
5


Actual output:
7


Fixed submission (verdict: Accepted):
N = int(input())
a = []
for i in range(N):
  a.append(int(input()))
a.sort()
count = 1
j = 0
while j < N-1:
  if a[j] != a[j+1]:
    count += 1
  j += 1
print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
nums = list(map(int, input().split()))

print(len(set(nums)))

Failing test case input:
4
10
8
14
6

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
nums = [int(input()) for _ in range(int(input()))]

print(len(set(nums)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4
46
19
19
14

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
N = int(input())
d = list(map(int, [input() for i in range(N)]))
d.sort()
count = 1

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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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))

Failing test case input:
4
46
19
19
4

Expected output:
3


Actual output:
46
19
4
3


Fixed submission (verdict: Accepted):
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:
        mochi.append(d[i])

print("{}".format(len(mochi)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

n = int(input ())
print(n)


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


d2 = sorted(d)


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

Failing test case input:
4
72
4
20
1

Expected output:
4


Actual output:
4
4


Fixed submission (verdict: Accepted):

n = int(input ())



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


d2 = sorted(d)


count=1
for i in range(n-1):
    if( d2[i] < d2[i+1] ):
        count += 1
        
print(count)
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
*a,= [int(input()) for _ in range(n)]
len(set(a))

Failing test case input:
7
50
40
50
100
50
80
59

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
*a,= [int(input()) for _ in range(n)]
print(len(set(a)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
1
-5
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
d = [int(input()) for i in range(n)]
res = 1

d.sort()
first = d[0]

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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
moti_total = int(input())
moti = []
for n in range(moti_total):
  moti.append(int(input()))
moti.sort()
tower = 1
for n in range(moti_total-1):
  if moti[n] is not moti[n+1]:
    print('n ' + str(moti[n]) + ' n2 ' + str(moti[n+1]))
    tower += 1
print(tower)

Failing test case input:
4
12
8
16
6

Expected output:
4


Actual output:
n 6 n2 8
n 8 n2 12
n 12 n2 16
4


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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
MOCHI_NUM = int(input())
MOCHIS = [int(MOCHI) for MOCHI in input().split(' ')]

print(len(set(MOCHIS)))


Failing test case input:
4
46
19
19
8

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
MOCHI_NUM = int(input())
MOCHIS = list()
for i in range(MOCHI_NUM):
    MOCHIS.append(int(input()))

print(len(set(MOCHIS)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(len([int(input()) for i in range(int(input()))]))

Failing test case input:
4
90
19
19
1

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
a=[int(input()) for i in range(int(input()))]
print(len(set(a)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
d=[int(input()) for i in range(n)]
s=set(d)
print(len(d))

Failing test case input:
7
50
30
50
100
50
80
59

Expected output:
5


Actual output:
7


Fixed submission (verdict: Accepted):
n=int(input())
d=[int(input()) for i in range(n)]
s=set(d)
print(len(s))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
d = [int(input()) for i in range(n)]
set(d)

print(len(d))

Failing test case input:
3
29
15
15

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
d = [int(input()) for i in range(n)]
print(len(set(d)))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
len(set(sys.stdin.read().split("\n")[1:-1]))

Failing test case input:
4
149
34
19
1

Expected output:
4


Actual output:

Fixed submission (verdict: Accepted):
import sys
print(len(set(sys.stdin.read().split("\n")[1:-1])))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
d = {}
for i in range(int(input())):
  d[i] = i
  
print(len(d.keys()))

Failing test case input:
4
27
8
27
6

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
d = {}
for i in range(int(input())):
  k = int(input())
  d[k] = 1
  
print(len(d.keys()))

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))

Failing test case input:
3
29
15
15

Expected output:
2


Actual output:
0
1
2


Fixed submission (verdict: Accepted):
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(len(D))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4
60
4
14
1

Expected output:
4


Actual output:
3
[60, 4, 14, 1]


Fixed submission (verdict: Accepted):
n = int(input())
d = [0]*n
for i in range(n):
  d[i] = int(input())
d.sort(reverse = True)
count = 1
for i in range(n-1):
  if d[i]>d[i+1]:
    count += 1
print(count)

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys

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

len_list = len(frozenset(myset))

print(len_list - 1)


Failing test case input:
4
46
19
19
4

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
num = int(input())
a = []

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

len_list = len(frozenset(myset))

print(len_list)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
num = list()

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

Failing test case input:
3
42
5
1

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
N = int(input())
num = list()

for i in range (N):
  d = int (input())
  num.append(d)
  
print(len(set(num)))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int( input())
D = []
for i in range(N):
    D.append(int(input()))
sorted(D)
print(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)

Failing test case input:
7
10
40
91
110
3
60
59

Expected output:
7


Actual output:
[10, 40, 91, 110, 3, 60, 59]
2


Fixed submission (verdict: Accepted):
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)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())


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


d.sort()

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


print(count)


Failing test case input:
3
15
15
15

Expected output:
1

Actual output:
0


Fixed submission (verdict: Accepted):


N = int(input())


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


d.sort()

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

if count == 0:
    count= 1

print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
1
-5
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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

print(dan)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
for i in range(N):
  l = input()
print(len(set(l)))

Failing test case input:
3
42
11
2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
l = [input() for i in range(N)]
print(len(set(l)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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) 

Failing test case input:
4
22
8
16
6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
a=[]
ans=1
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
  elif a[i]==a[i+1]:
    continue
  else:
    ans+=1
 
print(ans)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4
266
34
11
1

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
D = [int(input()) for i in range(N)]
D.sort()
ans = 1
for i in range(N - 1):
    if D[i] < D[i + 1]: ans += 1
print(ans)
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
a = []
for i in range(N):
    a.append(int(input()))

count = 0
for i in range(N-1):
    for j in range(i+1,N):
        if a[i]==a[j]:
            count += 1

print(N-count)

Failing test case input:
7
50
40
50
100
50
80
59

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
N = int(input())
a = []
for i in range(N):
    a.append(int(input()))

a.sort()
count = 1
for i in range(N-1):
    if a[i]!=a[i+1]:
        count += 1

print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=[int(input()) for i in range(n)]
sorted(a)
ans=1
for i in range(n-1):
	if(a[i]==a[i+1]):
		continue
	else:
		ans+=1
print(ans)

Failing test case input:
7
50
30
50
100
50
80
30

Expected output:
4

Actual output:
7


Fixed submission (verdict: Accepted):
n=int(input())
a=[int(input()) for i in range(n)]
a.sort()
ans=1
for i in range(n-1):
	if(not a[i]==a[i+1]):
		ans+=1
print(ans)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
lst = list(map(int,input().split()))
print(len(set(lst)))


Failing test case input:
7
10
40
91
110
3
60
93

Expected output:
7


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
print(len(set(map(int,[input() for i in range(N)]))))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

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

count = 1
stock = 0
for i in range(0, n-1):
    stock = a[i]
    if stock > a[i+1]:
        count += 1
    else:
        pass
print(count)

Failing test case input:
4
27
13
20
5

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):

n = int(input())
a = []
count = 1
for i in range(n):
    a.append(int(input()))

a.sort()
a.reverse()
for i in range(1, n):
    if a[i] < a[i-1]:
        count += 1
print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
7
50
40
91
110
3
34
59

Expected output:
7


Actual output:
0


Fixed submission (verdict: Accepted):
n=int(input())
a=[]
for i in range(n):
  k=int(input())
  a.append(k)
g=set(a)
l=len(g)
print(l)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())

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

k=0


for i in range(n-1):
    print('i =',i)
    for j in range(i+1,n):
        if d[i]==d[j]:
            j -= 1
            break
    print('j =',j)
    if j == n-1:
        k += 1
k += 1

print('k =',k)

Failing test case input:
3
0
-2
1

Expected output:
3


Actual output:
n= 3
i = 0
j = 2
i = 1
j = 2
k = 3


Fixed submission (verdict: Accepted):
n=int(input())

d=[]

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

k=0


for i in range(n-1):

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

    if j == n-1:
        k += 1
k += 1

print(k)
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

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

print(d)

print(len(set(d)))


Failing test case input:
4
46
19
20
4

Expected output:
4


Actual output:
['46', '19', '20', '4']
4


Fixed submission (verdict: Accepted):

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

print(len(set(d)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int( input())
D = []
for i in range(N):
    D.append(int(input()))
D = sorted(D)
print(D)
ans = 1
d_now = D[0]
for i in range(1,N):
    if d_now < D[i]:
        print(D[i])
        ans += 1
        d_now = D[i]
print(ans)

Failing test case input:
4
27
19
20
5

Expected output:
4


Actual output:
[5, 19, 20, 27]
19
20
27
4


Fixed submission (verdict: Accepted):
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)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
7
50
40
91
110
50
34
59

Expected output:
6


Actual output:
4


Fixed submission (verdict: Accepted):
n = int(input())
d = [0]*n
for i in range(n):
  d[i] = int(input())
d.sort(reverse = True)
count = 1
for i in range(n-1):
  if d[i]>d[i+1]:
    count += 1
print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
d = [int(input()) for i in range(N)]

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


Failing test case input:
4
27
8
27
6

Expected output:
3


Actual output:
[8, 27, 6]
3


Fixed submission (verdict: Accepted):
N = int(input())
d = [int(input()) for i in range(N)]


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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

paper = int(input())


moti_list  = []
li_uniq    = []


for w in range(paper):
    paper = int(input())

    moti_list.append(paper)


Failing test case input:
4
27
8
27
6

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):

paper = int(input())


moti_list  = []
li_uniq    = []


for w in range(paper):
    paper = int(input())

    moti_list.append(paper)

li_uniq = list(set(moti_list))

print(len(li_uniq))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def sortex(X):
  X.sort()
  a=[]
  for i in range(len(X)-1):
    if X[i]!=X[i+1]:a.append(X[i])
  return a
n=int(input());a=[int(input())for i in range(n)];a=sortex(a);print(len(a))

Failing test case input:
7
10
40
91
110
3
34
59

Expected output:
7


Actual output:
6


Fixed submission (verdict: Accepted):
def sortex(X):
  b=sorted(X)
  b.append("null")
  a=[]
  for i in range(len(X)):
    if b[i]!=b[i+1]:a.append(b[i])
  return a
n=int(input());a=[int(input())for i in range(n)];a=sortex(a);print(len(a))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4
266
34
11
1

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
D = [int(input()) for i in range(N)]
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)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
42
37
2

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
an = []
cnt = 1

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

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

print(cnt)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
D = [input() for _ in N]

print(len(set(D)))

Failing test case input:
3
1
-5
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
D = [input() for _ in range(N)]

print(len(set(D)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
allrunrun = int(input())
moti = [int(i) for i in input().split()]

tyouhuku = set(moti)

print(len(tyouhuku))

Failing test case input:
3
29
33
2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
allrunrun = int(input())
moti = [int(input()) for i in range(allrunrun)]
tyouhuku = set(moti)
print(len(tyouhuku))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
7
50
30
50
100
50
80
59

Expected output:
5


Actual output:
4


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

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
7
10
49
104
110
3
60
93

Expected output:
7


Actual output:
6


Fixed submission (verdict: Accepted):
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):
  if l[i] > l[i-1]:
    ans += 1
print(ans)
Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))

Failing test case input:
4
72
4
20
1

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
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(len(D))

Problem: p03470
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def resolve():
    
    n = int(input())
    
    
    
    D = [int(input()) for i in range(n)]
    
    
    
    

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

    print(cnt)
resolve()

Failing test case input:
3
42
5
0

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
def resolve():
    
    n = int(input())
    
    
    
    D = [int(input()) for i in range(n)]
    
    
    
    

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

    print(cnt)
resolve()

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
d = list([int(input()) for i in range(N)])
print(set(d))


Failing test case input:
3
42
5
1

Expected output:
3


Actual output:
{1, 42, 5}


Fixed submission (verdict: Accepted):
print(len(set([int(input()) for _ in range(int(input()))])))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int( input())
d = [ int(input()) for i in range(N)]
sorted(d)
mochi = int(d[0])
count = 0

for j in range(N - 1):
  if( d[j + 1] <= mochi ):
    count += 1
    mochi == int(d[j + 1])
    
  else:
    continue
    
print(count)

Failing test case input:
4
88
5
14
1

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
d = [ int(input()) for i in range(N)]
d = sorted(d)[::-1]
mochi = d[0]
count = 1

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

  else:
    continue
    
print(count)

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())

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

len(list(set(d_i_list)))

Failing test case input:
3
0
8
-2

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())

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

print(len(set(d_i_list)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())

d = []

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

print(len(set(d)))


Failing test case input:
4
179
4
14
0

Expected output:
4


Actual output:
179
4
14
0
4


Fixed submission (verdict: Accepted):
N = int(input())

d = []

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

print(len(set(d)))
Problem: p03470
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):

N = int(input())

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

print(len(S))

Failing test case input:
3
29
15
15

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):

N = int(input())

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

print(len(S))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
for i in range(N):
  l = [input()]
print(len(set(l)))

Failing test case input:
4
75
2
4
1

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
l = [input() for i in range(N)]
print(len(set(l)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int( input())
d = [ int(input()) for i in range(N)]
sorted(d)
mochi = int(d[0])
count = 1

for j in range(N - 1):
  if( d[j + 1] < mochi ):
    count += 1
    mochi == int(d[j + 1])
    
  else:
    continue
    
print(count)

Failing test case input:
4
12
8
16
6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
d = [ int(input()) for i in range(N)]
d = sorted(d)[::-1]
mochi = d[0]
count = 1

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

  else:
    continue
    
print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
a = list(map(int,input().split()))
a = set(a)
print(len(a))


Failing test case input:
4
88
5
14
0

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
a = []
for n in range(N):
    a.append(int(input()))
a = set(a)
print(len(a))

Problem: p03470
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n=int(input())
d=list(map(int, input().split()))
print(len(set(d)))

Failing test case input:
7
50
30
50
100
50
80
30

Expected output:
4

Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
print(len(set(map(int, [input() for i in range(n)]))))

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())

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

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


Failing test case input:
7
10
49
91
110
3
60
93

Expected output:
7


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
 
s = set()
for i in range(n):
  s.add(int(input()))
 
print(len(s))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
S = set([int(input()) for i in range(n-1)])
print(len(S))

Failing test case input:
4
75
9
3
1

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
S = set([int(input()) for i in range(n)])
print(len(S))

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))
A = set(A)
print(str(len(A)))

Failing test case input:
3
1
-3
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
A = [int(input()) for _ in range(N)]
A = set(A)
print(str(len(A)))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = []

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

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

Failing test case input:
3
29
36
2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
a = []

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

print(len(b))

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))


Failing test case input:
4
72
9
3
1

Expected output:
4


Actual output:
[72, 9, 3, 1]
4


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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N = int(input())


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


d.sort()

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


print(count)

Failing test case input:
3
15
15
15

Expected output:
1

Actual output:
0


Fixed submission (verdict: Accepted):


N = int(input())


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


d.sort()

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

if count == 0:
    count= 1

print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

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

set(lst)

print(len(lst))

Failing test case input:
7
50
30
50
100
50
80
30

Expected output:
4

Actual output:
7


Fixed submission (verdict: Accepted):
n = int(input())

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

print(len(set(lst)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
a = sorted(set([int(input(i)) for i in range(N)]))
print(len(a))

Failing test case input:
7
50
30
50
100
50
80
35

Expected output:
5


Actual output:
01234565


Fixed submission (verdict: Accepted):
N = int(input())
a = sorted(set([int(input()) for i in range(N)]))
print(len(a))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=[int(input()) for i in range(n)]
a.sort()
ans=0
for i in range(n-1):
	if(not a[i]==a[i+1]):
		ans+=1
print(ans)

Failing test case input:
3
1
-5
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n=int(input())
a=[int(input()) for i in range(n)]
a.sort()
ans=1
for i in range(n-1):
	if(not a[i]==a[i+1]):
		ans+=1
print(ans)
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)      
    

Failing test case input:
3
1
-2
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)


Failing test case input:
4
88
5
14
0

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
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):
  if l[i] > l[i-1]:
    ans += 1
print(ans)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
7
50
40
50
110
50
34
59

Expected output:
5


Actual output:
3


Fixed submission (verdict: Accepted):
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:
        continue

print(ans)

Problem: p03470
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
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)


Failing test case input:
4
72
7
20
1

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
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))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(len(set(open(0).readlines()[1:]))-1)

Failing test case input:
4
75
2
4
1

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
print(len(set(open(0).readlines()[1:])))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
d = list(map(int, input().split()))

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

Failing test case input:
3
1
-6
1

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
d = []
for ni in range(N):
    d.append(int(input()))

ds = set(d)
print(len(ds))
Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
3
15
15
15

Expected output:
1

Actual output:
0


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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
print(len(set(sys.stdin.read().strip().split())))

Failing test case input:
4
27
19
20
7

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
import sys
input(), print(len(set(sys.stdin.read().strip().split())))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
d = [i for i in range(N)]
print(len(set(d)) - 1)

Failing test case input:
4
10
8
16
6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
d = [input() for i in range(N)]
print(len(set(d)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
lista=[]
for i in range(n):
    lista.append(int(input()))

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

Failing test case input:
4
88
5
14
1

Expected output:
4


Actual output:
{88, 1, 5, 14}
4


Fixed submission (verdict: Accepted):
n=int(input())
lista=[]
for i in range(n):
    lista.append(int(input()))

lista=set(lista)

print(len(lista))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
b = int(input())
nums = [int(input()) for i in range(b)]
print(len(set(nums)) if not len(set(nums)) == 1 else "0")

Failing test case input:
3
15
15
15

Expected output:
1

Actual output:
0


Fixed submission (verdict: Accepted):
b = int(input())
nums = [int(input()) for i in range(b)]
print(len(set(nums)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
i = 0
N = int(input())
list = [int(input()) for i in range(N)]
print("before sort",list)

list.sort(reverse = True)
print("after sort",list)

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

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

print(cnt)


Failing test case input:
3
1
-6
1

Expected output:
2


Actual output:
before sort [1, -6, 1]
after sort [1, 1, -6]
2


Fixed submission (verdict: Accepted):

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)

Problem: p03470
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
print(len(set(input for i in range(int(input())))))

Failing test case input:
3
0
4
-1

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
print(len(set(input() for i in range(int(input())))))
Problem: p03470
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
X = int(input())
A = list(map(int, input().split()))
A = list(set(A))
print(len(A))

Failing test case input:
4
10
8
14
6

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
X = int(input())
A = list(map(int, [input() for i in range(X)]))
A = list(set(A))
print(len(A))

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))

Failing test case input:
3
29
29
2

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
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(len(D))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
D=[]
for i in range(N):
    D.append(input(int()))
set_D=set(D)
ans=len(set_D)
print(ans)

Failing test case input:
3
29
29
2

Expected output:
2


Actual output:
0002


Fixed submission (verdict: Accepted):
N=int(input())
D=[]
for i in range(N):
    D.append(int(input()))
set_D=set(D)
ans=len(set_D)
print(ans)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
mochis = sorted([int(input()) for _ in range(N)], reverse=True)
res = 0
for idx in range(1, N):
  if mochis[idx] > mochis[idx - 1]:
    res += 1

print(res)


Failing test case input:
4
179
4
14
0

Expected output:
4


Actual output:
0


Fixed submission (verdict: Accepted):
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)

Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys

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

len_list = len(frozenset(myset))

print(len_list - 1)

Failing test case input:
4
46
19
20
4

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
num = int(input())
a = []

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

len_list = len(frozenset(myset))

print(len_list)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
d = []
for i in range(N):
    d.append(int(input()))

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

print(cnt)


Failing test case input:
7
50
30
50
100
50
80
59

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
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))
Problem: p03470
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
4
149
19
19
1

Expected output:
3


Actual output:
{1, 19, 149}
3


Fixed submission (verdict: Accepted):
num = int(input())
a = []

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

len_list = len(frozenset(myset))

print(len_list)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
d=[]
for i in range(n):
    d.append(int(input()))
ans=set(d)
print(ans)

Failing test case input:
4
12
8
16
6

Expected output:
4


Actual output:
{8, 16, 12, 6}


Fixed submission (verdict: Accepted):
n=int(input())
d=[]
for i in range(n):
    d.append(int(input()))
ans=set(d)
print(len(ans))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l = []
for i in range(0, n):
    l.append(int(input()))
len(set(l))

Failing test case input:
3
29
33
2

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
l = []
for i in range(0, n):
    l.append(int(input()))
print(len(set(l)))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
arr = [int(input()) for _ in range(N)]

print(set(arr))

Failing test case input:
4
27
8
20
5

Expected output:
4


Actual output:
{8, 27, 20, 5}


Fixed submission (verdict: Accepted):
N = int(input())
arr = [int(input()) for _ in range(N)]
new = set(arr)

print(len(new))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
List = [0]
count = 1
for i in range(N):
    List.append(int(input()))
List.pop(0)
List.sort()
for i in range(N - 1):
    if List[i] != List[i - 1]: count += 1
print(count)


Failing test case input:
3
1
-5
1

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
List = [0]
count = 1
for i in range(N):
    List.append(int(input()))
List.pop(0)
List.sort()
i = 1
for j in range(N - 1):
    if List[i] != List[i - 1]: count += 1
    i += 1
print(count)

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
d = [None]*n
for i in range(n):
    d[i] = int(input())

len(set(d))

Failing test case input:
3
2
0
1

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
d = [None]*n
for i in range(n):
    d[i] = int(input())

print(len(set(d)))
Problem: p03408
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
s=list(input() for i in range(n))
m=int(input())
t=list(input() for j in range(m))
l=list(set(s))
ans=(max(0,s.count(l[k])-t.count(l[k])) for k in range(len(l)))
print(ans)

Failing test case input:
1
voldemort
7
vnledmort
voldemort
vnldemort
dolvemort
uomdelort
voldemort
woleetorm
loledvort
tdomerlov
voldemosu

Expected output:
0


Actual output:
<generator object <genexpr> at 0x7fb22cdd9440>


Fixed submission (verdict: Accepted):
n=int(input())
s=list(input() for i in range(n))
m=int(input())
t=list(input() for j in range(m))
l=list(set(s))
ans=max(0,max(s.count(l[k])-t.count(l[k]) for k in range(len(l))))
print(ans)

Problem: p03408
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
BlueN = int(input())
BlueList = []
for i in range(0,BlueN):
  BlueList.append(input())

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

stocker = 0

for i in set(BlueList):
  if BlueList.count(i) * 1 + RedList.count(i) * -1 >= stocker:
    stocker = BlueList.count(i)

print(stocker)

Failing test case input:
6
red
red
blue
xolely
yellow
red
5
red
ree
yellow
sgeen
bluf

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
BlueN = int(input())
BlueList = []
for i in range(0,BlueN):
  BlueList.append(input())

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

stocker = 0

for i in set(BlueList):
  if BlueList.count(i) * 1 + RedList.count(i) * -1 >= stocker:
    stocker = BlueList.count(i) * 1 + RedList.count(i) * -1

print(stocker)

Problem: p03408
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=[]
b=[]
m=0

for _ in [0]*int(input()):
  a += input()
for _ in [0]*int(input()):
  b += input()

for s in a:
  m = max(m, a.count(s)-b.count(s))
print(m)


Failing test case input:
1
voldemort
5
tromedlnv
vpldemort
sromedlnv
tromevdok
troledmov
volderomt
polweterm
loledvort
tdomlreov
voldemosv

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a=[]
b=[]
m=0

for _ in [0]*int(input()):
  a += [input()]
for _ in [0]*int(input()):
  b += [input()]

for s in a:
  m = max(m, a.count(s)-b.count(s))
print(m)

Problem: p03408
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
from collections import Counter

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

M = int(input())
t = [input() for _ in range(M)]

c1 = Counter(s)
c2 = Counter(t)
print(max(v - c2[i] for i, v in c1.most_common()))


Failing test case input:
1
voldemort
10
vnledmort
voldemort
tromedlnv
voldemort
uoldemort
voldemort
woleetorm
voleelort
tromedlov
voldemort

Expected output:
0


Actual output:
-3


Fixed submission (verdict: Accepted):
from collections import Counter

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

M = int(input())
t = [input() for _ in range(M)]

c1 = Counter(s)
c2 = Counter(t)
ans = max(v - c2[i] for i, v in c1.most_common())
print(max(0, ans))