ZhenlongDai/ACPR huggingface dataset:
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = [int(x) for x in input().split(' ')]
count = 0
for i in range(a, b):
    if c != 1 and c % i == 0:
        count += 1
print(count)


Failing test case input:
2 34 34

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a, b, c = [int(x) for x in input().split(' ')]
count = 0
for i in range(a, b + 1):
    if c % i == 0:
        count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = list(map(int,input().split()))
count = 0
for i in range(a,b) :
    if (c % i) == 0 :
        count = count + 1
print(count)

Failing test case input:
5 20 80

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
a,b,c = list(map(int,input().split()))
count = 0
for i in range(a,b+1) :
    if (c % i) == 0 :
        count = count + 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c=map(int,input().split())
count = 0
for x in range(a,b):
    if (c%x==0):count += 1
print(count)

Failing test case input:
2 4 72

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())
count = 0
for x in range(a,b+1):
    if (c%x==0):count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
counter=0
a,b,c=map(int,input().split())
for i in range(a,b):
    if((c%i)==0):
        counter=counter+1
print(f"{counter}")



Failing test case input:
3 4 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
counter=0
a,b,c=map(int,input().split())
for i in range(a,b+1):
    if((c%i)==0):
        counter=counter+1
print(f"{counter}")

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
x,y,z = map(int,input().split())
i=0
for s in range(x,y):
 if z%s==0:
  i += 1
  print(i)

Failing test case input:
9 4 80

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
i=0
for s in range(a,b+1):
 if c % s == 0:
  i += 1
print(i)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
j=0
a,b,c=map(int,input().split())
for i in (a,b+1):
    if(c%i==0):
        j+=1
print(j)


Failing test case input:
7 25 80

Expected output:
4


Actual output:
0


Fixed submission (verdict: Accepted):
j=0
a,b,c=map(int,input().split())
for i in range(a,b+1):
    if(c%i==0):
        j+=1
print(j)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
number_list=[int(i) for i in input().split()]
counter=0
for r in range(number_list[0],number_list[1]):
    if number_list[2]%r==0:
        counter+=1
print(counter)

Failing test case input:
6 18 0

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):
number_list=[int(i) for i in input().split()]
counter=0
for r in range(number_list[0],number_list[1]+1):
    if number_list[2]%r==0:
        counter+=1
print(counter)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):

a,b,c = map(int,input().split())
count=0
for i in range(a,b):
    if c%i == 0:
        count +=1
print(count)

Failing test case input:
2 34 34

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):

a,b,c = map(int,input().split())
count=0
for i in range(a,b+1):
    if c%i == 0:
        count +=1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
x = a
count = 0
for _ in range(b - a):
    if c % x == 0 and x != 1:
        count += 1
    x += 1
print(count)


Failing test case input:
1 14 241

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
x = a
count = 0
for _ in range(b - a + 1):
    if c % x == 0:
        count += 1
    x += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = [int(i) for i in input().split()]
cnt = 0
for i in range(a,b) :
    if c % int(i) == 0:
        cnt = cnt + 1
print(cnt)

Failing test case input:
2 4 32

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
a, b, c = [int(i) for i in input().split()]
cnt = 0
for i in range(a, b+1) :
    if c % i == 0:
        cnt = cnt + 1
print(cnt)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
num = list(map(int, input().split()))

count = 0
for i in range(num[0], num[1]):
    if num[2] % i == 0:
        count += 1
print(count)

Failing test case input:
2 26 0

Expected output:
25


Actual output:
24


Fixed submission (verdict: Accepted):
num = list(map(int, input().split()))

count = 0
for i in range(num[0], num[1]+1):
    if num[2] % i == 0:
        count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = input().strip().split(' ')
a, b, c = [int(a), int(b), int(c)]

ans = 0

for i in range(a, b):
    if c % i == 0:
        ans += 1

print(ans)



Failing test case input:
2 4 72

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a, b, c = input().strip().split(' ')
a, b, c = [int(a), int(b), int(c)]

ans = 0

for i in range(a, b+1):
    if c % i == 0:
        ans += 1

print(ans)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
x = input().split(' ')
a = int(x[0])
b = int(x[1])
c = int(x[2])
e = int(0)
for i in range(a,b):
    d = (c % i == 0)
    if d == True:
        e += 1
print(e)

Failing test case input:
3 4 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
x = input().split(' ')
a = int(x[0])
b = int(x[1])
c = int(x[2])
e = int(0)
for i in range(a,b+1):
    if c % i == 0:
        e += 1
print(e)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
divisorsCount = 0
divideNum = a
for var in range(a, b):
    if c % divideNum == 0:
        divisorsCount += 1
        divideNum += 1
print(divisorsCount)

Failing test case input:
7 14 80

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
DivisorCount = 0
DivideNum = a
for var in range(a, b+1):
    if c % DivideNum == 0:
        DivisorCount += 1
    DivideNum += 1
print(DivisorCount)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
x = a
count = 0
for _ in range(b - a):
    if c % x == 0:
        count += 1
    x += 1
print(count)


Failing test case input:
3 4 12

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
x = a
count = 0
for _ in range(b - a + 1):
    if c % x == 0:
        count += 1
    x += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c=[int(i) for i in input().split()]
k=0
for i in range(a,b):
    if c==i:
        break
    if c%i==0:
        k=k+1
print(k)

Failing test case input:
7 8 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a,b,c=[int(i) for i in input().split()]
k=0
for i in range(a,b+1):
    if c%i==0:
         k=k+1
print(k)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c=[int(i) for i in input().split()]
k=0
for i in range(a,b):
    if c%i==0:
        k=k+1
print(k)

Failing test case input:
2 34 34

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a,b,c=[int(i) for i in input().split()]
k=0
for i in range(a,b+1):
    if c%i==0:
         k=k+1
print(k)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
l = input().split()
a = int(l[0])
b = int(l[1])
c = int(l[2])

d = []
for i in range(a,b):
    if c % i == 0:
        d.append(i)
print(len(d))

Failing test case input:
1 1 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
l = input().split()
a = int(l[0])
b = int(l[1])
c = int(l[2])

d = []
for i in range(a,b+1):
    if c % i == 0:
        d.append(i)
print(len(d))

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n = 0
a,b,c = list(map(int,input().split()))
for i in range(a,b):
  if i == 1:
    continue
  x = c % i
  if x == 0:
    n += 1
print(n)

Failing test case input:
1 1 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n = 0
a,b,c = list(map(int,input().split()))
for i in range(a,b + 1):
  x = c % i
  if x == 0:
    n += 1
print(n)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
counter = 0
for i in range(a, b):
        if c % i == 0:
            counter += 1
print(counter)



Failing test case input:
3 4 12

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
counter = 0
    
for i in range(a, b+1):
        if c % i == 0:
            
            counter += 1
print(counter)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
tmp = input().split()
a = int(tmp[0])
b = int(tmp[1])
c = int(tmp[2])
ans = 0
for n in range(a,b):
    if c % n == 0:
        ans +=1
    else:
        pass
if a == b:
    if c % a == 0:
        ans += 1
print(ans)



Failing test case input:
3 26 0

Expected output:
24


Actual output:
23


Fixed submission (verdict: Accepted):
tmp = input().split()
a = int(tmp[0])
b = int(tmp[1])
c = int(tmp[2])
ans = 0
if a == b:
    if c % a == 0:
        ans += 1
else:
    for n in range(a,b + 1):
        if c % n == 0:
            ans +=1
        else:
            pass
print(ans)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n=input().split(" ")
a=int(n[0])
b=int(n[1])
c=int(n[2])
count=0
for i in range(a+b+1):
    count+=1
    print(count)


Failing test case input:
9 11 80

Expected output:
1


Actual output:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21


Fixed submission (verdict: Accepted):
x=input().split()
a=int(x[0])
b=int(x[1])
c=int(x[2])
count=0
for i in range(a,b+1):
  if c%i==0:
   count+=1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
indata = input().split()
a = int(indata[0])
b = int(indata[1])
c = int(indata[2])
count = 0

for i in range(a,b):
    if (c % i) == 0:
        count += 1

print(count)

Failing test case input:
2 34 34

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
indata = input().split()
a = int(indata[0])
b = int(indata[1])
c = int(indata[2])
count = 0

for i in range(a,(b+1)):
    if (c % i) == 0:
        count += 1

print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n = 0
a,b,c = list(map(int,input().split()))
for i in range(a,b):
  if a == 1:
    continue
  x = c % i
  if x == 0:
    n += 1
print(n)

Failing test case input:
1 2 80

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
n = 0
a,b,c = list(map(int,input().split()))
for i in range(a,b + 1):
  x = c % i
  if x == 0:
    n += 1
print(n)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = [int(i) for i in input().split()]

count = 0

if 0 < a and 0 < b:
    for x in range(a,b):
        if c % x == 0:
            count += 1

print(count)

Failing test case input:
2 34 34

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a,b,c = [int(i) for i in input().split()]

count = 0

for x in range(a,b+1):
    if c % x == 0:
        count += 1

print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = map(int,input().split())

count = 0
for loop in range(a,b):
    if c % loop == 0:
        count +=1

print(count)



Failing test case input:
3 4 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
count = 0
for loop in range(a,b+1):
    if c % loop == 0:
        count +=1

print(count)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n=input().split(" ")
a=int(n[0])
b=int(n[1])
c=int(n[2])
count=0
for i in range(a+b+c+1):
    count=i+1
print(count)


Failing test case input:
9 3 84

Expected output:
0


Actual output:
97


Fixed submission (verdict: Accepted):
x=input().split()
a=int(x[0])
b=int(x[1])
c=int(x[2])
count=0
for i in range(a,b+1):
  if c%i==0:
   count+=1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n=input().split(" ")
a=int(n[0])
b=int(n[1])
c=int(n[2])
count=0
for i in range(c+1):
    count=i+1
print(count)


Failing test case input:
7 4 80

Expected output:
0


Actual output:
81


Fixed submission (verdict: Accepted):
x=input().split()
a=int(x[0])
b=int(x[1])
c=int(x[2])
count=0
for i in range(a,b+1):
  if c%i==0:
   count+=1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
instr = input()
instrSp = instr.split()

a = int(instrSp[0])
b = int(instrSp[1])
c = int(instrSp[2])

cnt = 0
for i in range(a, b):
    if c % i == 0:
        cnt += 1
print(cnt)



Failing test case input:
3 4 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
instr = input()
instrSp = instr.split()

a = int(instrSp[0])
b = int(instrSp[1])
c = int(instrSp[2])

cnt = 0
for i in range(a, b + 1):
    if c % i == 0:
        cnt += 1
print(cnt)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
[a, b, c] = list(map(int, input().split()))

num_divisor = 0
for i in range(a, b):
    if c % i == 0:
        num_divisor += 1

print(num_divisor)
    

Failing test case input:
5 20 80

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
[a, b, c] = list(map(int, input().split()))

num_divisor = 0
for i in range(a, b + 1):
    if c % i == 0:
        num_divisor += 1

print(num_divisor)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
( a, b, c) = [int(i) for i in input().split()]

count = 0
while True:
    for i in range( a, b):
        if c % i == 0:
            count += 1
    print( count)
    break

Failing test case input:
2 4 32

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
( a, b, c) = [int(i) for i in input().split()]

count = 0

for i in range( a, b+1):
    if c % i == 0:
        count += 1
print( count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = map(int,input().split())
l = []
for i in range(a,b + 1):
    if c % i == 0:
        l.append(i)
    print(len(l))
 

Failing test case input:
1 23 80

Expected output:
8


Actual output:
1
2
2
3
4
4
4
5
5
6
6
6
6
6
6
7
7
7
7
8
8
8
8


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
x = 0
for i in range(a,(b + 1)):
    if c % i == 0:
        x += 1
print(x)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):

a,b,c = map(int, input().split(" "))
count = 0
for w in range(a,b):
    if a == b:
        break
    elif c%w == 0:
        count += 1
print(count)

Failing test case input:
5 20 80

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):

a,b,c = map(int, input().split(" "))
count = 0

for w in range(a,b+1):
    if c%w == 0:
        count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
import sys

a, b, c = [ int( val ) for val in sys.stdin.readline().split( ' ' ) ]
cnt = 0
if a == b:
	cnt = 1
for divisor in range( a, b ):
	if ( c % divisor ) == 0:
		cnt += 1
print( "{}".format( cnt ) )

Failing test case input:
6 18 0

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):
import sys

a, b, c = [ int( val ) for val in sys.stdin.readline().split( ' ' ) ]
cnt = 0
i = a
while i <= b:
	if ( c % i ) == 0:
		cnt += 1
	i += 1
print( "{}".format( cnt ) )

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = map(int,input().split())
l = [i for i in range(a,b+1) if c % a ==0]
print(len(l))

Failing test case input:
2 4 46

Expected output:
1


Actual output:
3


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
x = 0
for i in range(a,(b + 1)):
    if c % i == 0:
        x += 1
print(x)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
num = list(map(int,input().split()))
c = 0
for i in range(num[0],num[1]):
    if(num[2]%i == 0): c = c+1

print(c)


Failing test case input:
1 1 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
num = list(map(int,input().split()))
c = 0
for i in range(num[0],num[1]+1):
    if(num[2]%i == 0): c = c+1

print(c)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
count = 0
for div in range(a, b):
    if c % div == 0:
        count += 1
print(count)

Failing test case input:
3 4 12

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
count = 0
for div in range(a, b+1):
    if c % div == 0:
        count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
num = input().split(" ")
a = int(num[0])
b = int(num[1])
c = int(num[2])
divide = a
count = 0

for i in range(b-a):
    if c % divide == 0:
        count += 1
    divide += 1

if a == b:
    count = 1
    
print(count)

Failing test case input:
2 4 80

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
num = input().split(" ")
a = int(num[0])
b = int(num[1])
c = int(num[2])
count = 0

for i in range(a,b+1):
    if c % i == 0:
        count += 1
    
print(count)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
counta = 0
if a == b:
    if c % a == 0:
        counta += 1
else:
  for i in range(a,b):
      if c % i == 0:
          counta += 1
print(counta)

Failing test case input:
1 2 80

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
counta = 0
if a == b:
    if c % a == 0:
        counta += 1
else:
  for i in range(a,b+1):
      if c % i == 0:
          counta += 1
print(counta)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
import sys


a,b,c = map(int, sys.stdin.readline().split())
count=0
for i in range(a,b):
    if c%i == 0 :
        count+=1
print(count)

Failing test case input:
2 4 80

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
import sys


a,b,c = map(int, sys.stdin.readline().split())
count=0
if a!=b :
    for i in range(a,b+1):

        if c%i == 0 :
            count+=1
else:
    if c%a == 0 :
        count+=1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c="1 1 1".split()
n=0
for i in range(int(a),int(b)+1):
	if int(c)%i ==0:
		n+=1

print(n)

Failing test case input:
2 1 46

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
a,b,c=input().split()
n=0
for i in range(int(a),int(b)+1):
	if int(c)%i ==0:
		n+=1

print(n)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
num = input().split(" ")
a = int(num[0])
b = int(num[1])
c = int(num[2])
divide = a
count = 0

for i in range(b-a):
    if c % divide == 0:
        count += 1
    divide += 1

if a > c:
    count = 0
elif a == b:
    count = 1
    
print(count)

Failing test case input:
5 20 80

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
num = input().split(" ")
a = int(num[0])
b = int(num[1])
c = int(num[2])
count = 0

for i in range(a,b+1):
    if c % i == 0:
        count += 1
    
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c=map(int,input().split())
count=0
for i in range(a,b):
  if c % i == 0:
    count+=1
print(count)

Failing test case input:
2 4 80

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())                                     
count=0
for i in range(a,b+1):
    if c % i == 0:
        count+=1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
(a, b, c) = [int(i) for i in input().split()]

count = 0

for i in range(a, b + 1):
    if c % 1 ==0:
        count += 1
print(count)

Failing test case input:
7 25 80

Expected output:
4


Actual output:
19


Fixed submission (verdict: Accepted):
a, b, c = [int(i) for i in input().split()]
 
total = 0
for d in range(a, b + 1):
    if c % d == 0:
        total += 1
 
print(total)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = map(int,input().split())
count = 0
for i in range(a,b+1):
        if c % i == 0:
                count += 1
        print(count)

Failing test case input:
3 19 113

Expected output:
0


Actual output:
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
count = 0
for i in range(a,b+1):
        if c % i == 0:
                count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a = list(map(int, input().split()))
cnt = 0
for i in range(a[0], a[1] + 1, 1):
    if (a[2] % i) == 0:
        cnt += 1

Failing test case input:
5 2 86

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
z = input()
a = list(map(int, z.split()))
cnt = 0
for i in range(a[0], a[1] + 1, 1):
    if a[2] % i == 0:
        cnt += 1
print(cnt)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())

yakusuu = []

for i in range(a, b+1):

    if (c % a == 0) and (c % b == 0):
 
        yakusuu.append(i)

print(len(yakusuu))


Failing test case input:
2 57 34

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())

yakusuu = []

for i in range(a, b+1):

    if (c % i == 0):
 
        yakusuu.append(i)

print(len(yakusuu))

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
i=0
a,b,c = map(int,input().split())
for x in range(a+1,b):
  if c % x == 0: i+=1
print(i)


Failing test case input:
2 4 32

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
i=0
a,b,c = map(int,input().split())
for x in range(a,b+1):
  if c % x == 0: i+=1
print(i)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
s = list(map(lambda x: c % x, range(a, b)))
print(s.count(0))

Failing test case input:
7 8 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
s = list(map(lambda x: c % x, range(a, b+1)))
print(s.count(0))

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
counter=0
a,b,c=map(int,input().split())
if(a==b):
    if((c%a)==0):
        counter=counter+1
for i in range(a,b):
    if((c%i)==0):
        counter=counter+1
print(f"{counter}")



Failing test case input:
2 4 32

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
counter=0
a,b,c=map(int,input().split())
for i in range(a,b+1):
    if((c%i)==0):
        counter=counter+1
print(f"{counter}")

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = map(int, input().split())
result = 0
for x in range(a, b):
    if c % x == 0:
        result += 1

print(result)



Failing test case input:
2 34 34

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
result = 0
for x in range(a, b+1):
    if c % x == 0:
        result += 1

print(result)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
num = [int(x) for x in input().split() if x.isdigit()]
count = 0
for i in range(num[0], num[1]):
    if num[2] % i == 0:
        count += 1
print(count)

Failing test case input:
6 18 0

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):
num = [int(x) for x in input().split() if x.isdigit()]
count = 0
for i in range(num[0], num[1]+1):
    if num[2] % i == 0:
        count += 1
print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
values = input()
a, b, c = [int(x) for x in values.split()]
cnt = 0
for i in range(a, b):
    if 0 == c % i:
        cnt += 1

print(cnt)

Failing test case input:
4 30 0

Expected output:
27


Actual output:
26


Fixed submission (verdict: Accepted):
values = input()
a, b, c = [int(x) for x in values.split()]
cnt = 0
for i in range(a, b + 1):
    if 0 == c % i:
        cnt += 1

print(cnt)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = map(int, input().split())
n = 0;
for i in range(a, b):
    if c % i == 0: n += 1
print(n)


Failing test case input:
1 1 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a,b,c = map(int, input().split())
n = 0;
for i in range(a, b+1):
    if c % i == 0: n += 1
print(n)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
(a, b, c) = [int(i) for i in input().split()]
count = 0
for i in range(a, b):
    if (c % i) == 0:
        count = count + 1
print(count)

Failing test case input:
6 18 0

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):
(a, b, c) = [int(i) for i in input().split()]
cnt = 0
for i in range(a, b + 1):
    if (c % i) == 0:
        cnt = cnt + 1
print(cnt)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a,b,c = [int(i) for i in input().split()]

count = 0

if 1 < a and 1 < b:
    for x in range(a,b):
        if c % x == 0:
            count += 1

print(count)

Failing test case input:
7 8 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a,b,c = [int(i) for i in input().split()]

count = 0

for x in range(a,b+1):
    if c % x == 0:
        count += 1

print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):


a, b, c = (int(i) for i in input().split())
count = 0

for i in range(a,b):
  if c % i == 0:
    count += 1

print(count)

Failing test case input:
1 1 80

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):


a, b, c = (int(i) for i in input().split())
count = 0

for i in range(a,b+1):
  if c % i == 0:
    count += 1

print(count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b):
    if c % i == 0:
        ans += 1
print(ans)

Failing test case input:
2 26 0

Expected output:
25


Actual output:
24


Fixed submission (verdict: Accepted):
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b + 1):
    if c % i == 0:
        ans += 1
print(ans)
Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):


a, b, c = (int(i) for i in input().split())
answer = 0

for i in range(a,b):
    if c % i == 0:
        answer += 1

print(answer)


Failing test case input:
5 20 80

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):


a, b, c = (int(i) for i in input().split())
answer = 0

for i in range(a,b+1):
    if c % i == 0:
        answer += 1

print(answer)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
( a, b, c) = [int(i) for i in input().split()]

count = 0
for i in range( a, b):
    if c % i == 0:
        count += 1
print( count)

Failing test case input:
6 18 0

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):
( a, b, c) = [int(i) for i in input().split()]

count = 0

for i in range( a, b+1):
    if c % i == 0:
        count += 1
print( count)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b):
    if c % i == 0:
        ans += 1
print(ans)

Failing test case input:
2 4 72

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b+1):
    if i == 1 or c % i == 0:
        ans += 1
print(ans)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):
n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
counta = 0

for i in range(a,b):
    if c % i == 0:
        counta += 1
print(counta)

Failing test case input:
3 4 12

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
counta = 0
if a == b:
    if c % a == 0:
        counta += 1
else:
  for i in range(a,b+1):
      if c % i == 0:
          counta += 1
print(counta)

Problem: p02398
Buggy submission (Python3, verdict: Wrong Answer):


count=0
a,b,c=map(int,input().split())
for i in range(a,b):
    if c%i==0:
        count+=1
print(count)
    




Failing test case input:
6 18 0

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):


count=0
a,b,c=map(int,input().split())
for i in range(a,b+1):
    if c%i==0:
        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()))

d.sort()

count = 0

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

print(count)

Failing test case input:
4
60
4
14
1

Expected output:
4


Actual output:
3


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

d.sort()

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())
nums = list(map(int, input().split()))
print(len(set(nums)))


Failing test case input:
3
42
37
2

Expected output:
3


Actual output:
1


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

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

Failing test case input:
3
29
27
2

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
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
    elif d[i]==d[i-1]:
        continue
    else:
        cnt += 1

print(cnt)

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



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)

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 j in range(N)]



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):
        if current_mochi > next_mochi:
            counter+=1
            break
        else:
            break
    elif current_mochi > next_mochi:
        counter+=1
        current_mochi = num

print(counter)

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


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)


Failing test case input:
4
75
9
3
1

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):


n = int(input())
d = []
result = 1

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

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

print(result)
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)
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
8
20
5

Expected output:
4


Actual output:
8
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=[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)


Failing test case input:
3
1
-6
1

Expected output:
2


Actual output:
3


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

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[i+1]:
    c=c+1
    if i==n-2:
      c=c+1
      
print(c)      
    

Failing test case input:
3
1
-6
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.4.3), verdict: Wrong Answer):
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)


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

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
import sys


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


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

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

Failing test case input:
3
1
-6
1

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
print(len(set([int(input()) for _ in range(n)])))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

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

Expected output:
5


Actual output:
7


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

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

print(cnt)

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 = d[0]
count = 1

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


Failing test case input:
4
22
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 = input()

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

cnt = []
for i in range(int(N)):
  cnt.append(a.count(a[0])-1)
  a.remove(a[0])
su = sum(cnt)
print(int(N)-su)

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

Expected output:
5


Actual output:
4


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

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

cnt = {s:(a.count(s)-1) for s in a}

print(int(N)-sum([int(j) for j in cnt.values()]))

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l = [int(input(i)) for i in [0]*n]
print(list(set(l)))


Failing test case input:
4
75
2
3
1

Expected output:
4


Actual output:
0000[3, 1, 2, 75]


Fixed submission (verdict: Accepted):
n = int(input())
l = [int(input()) for i in [0]*n]
print(len(list(set(l))))

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

Failing test case input:
4
90
19
19
1

Expected output:
3


Actual output:
1


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

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

Failing test case input:
4
46
19
20
4

Expected output:
4


Actual output:
{19, 20, 4, 46}


Fixed submission (verdict: Accepted):
N = int(input())
d = set()
for i in range(N):
    d.add(int(input()))
print(len(d))
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
42
5
0

Expected output:
3


Actual output:
[0, 5, 42]
3


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

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

Failing test case input:
3
29
15
15

Expected output:
2


Actual output:
1


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

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

Failing test case input:
4
46
19
19
14

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
n = int(input())
c = 0
record = []
for i in range(n):
    val = int(input())
    if not val in record:
        record.append(val)
        c += 1
print(c)

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

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


Failing test case input:
4
72
4
14
1

Expected output:
4


Actual output:
{'72', '14', '4', '1'}
4


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

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

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

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

Expected output:
7


Actual output:
{3, 104, 10, 110, 49, 60, 93}


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

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

size = 0
max = 9999999999

for m in mochi:
    if m < max:
        size += 1
        max = m

print(size)


Failing test case input:
4
319
8
14
0

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
mochi = [int(input()) for i in range(n)]
mochi.sort(reverse=True)

size = 0
max = 9999999999

for m in mochi:
    
    if m < max:
        size += 1
        max = m

print(size)

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 = 1

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

print(dan)

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

Failing test case input:
3
1
4
-1

Expected output:
3


Actual output:
{1, 4, -1}


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

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

dd = sorted(d, key=d.index)
print(len(dd))

Failing test case input:
4
10
8
8
6

Expected output:
3

Actual output:
4


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

print(len(set(d)))

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

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

Expected output:
7


Actual output:
4


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

def kagamimochi(diameters):
    return len(list(set(diameters)))

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

Failing test case input:
3
33
5
1

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
def kagamimochi(diameters):
    return len(list(set(diameters)))

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

Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
s=int(s)
input_data = [int(input()) for _ in range(s)]
print(len(list(input_data)))


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

Expected output:
4

Actual output:
7


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

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


Failing test case input:
4
12
8
16
6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
import sys
import os


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

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


if __name__ == '__main__':
    main()
Problem: p03470
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
list=[int(input()) for i in range(N)]
print(len(list))

Failing test case input:
4
27
8
27
6

Expected output:
3


Actual output:
4


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

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

mochi_use = sorted(mochi,reverse = True)

ans = 1

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

print(ans)


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

Expected output:
5


Actual output:
[50, 40, 50, 100, 50, 80, 59]
5


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

mochi_use = sorted(mochi,reverse = True)

ans = 1

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

print(ans)

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

Failing test case input:
3
42
37
2

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
nums = [input() for i in range(N)]
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)
for i in range(len(d)-1):
  if d[i+1]<d[i]:
    ans += 1
print(ans)

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

Expected output:
7


Actual output:
2


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

Failing test case input:
3
29
29
2

Expected output:
2


Actual output:
3


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

s_set = set(s)

l = len(s)

print(l)

Failing test case input:
4
46
19
19
4

Expected output:
3


Actual output:
4


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