ZhenlongDai/ACPR huggingface dataset:
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())
num = 0
for i in range(r - l + 1):
    if  (i + r + 1)/ d == int((i + r + 1) / d):
        num += 1
print(num)

Failing test case input:
9 21 3

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
num = 0
for i in range(r - l +1):
    if (i + l) / d == int((i + l) / d):
        num += 1
print(num)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
print(int(R / d) - int(L - 1 / d))

Failing test case input:
9 31 6

Expected output:
4


Actual output:
-3


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
print(int(R / d) - int((L - 1) / d))

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    if i%d: ans+=1
print(ans)


Failing test case input:
2 40 2

Expected output:
20


Actual output:
19


Fixed submission (verdict: Accepted):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    if i%d==0: ans+=1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c = input().split()

count = 0

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

print(count)

Failing test case input:
0 55 1

Expected output:
56


Actual output:
55


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

while num <= int(b):
  if num % int(c) == 0:
    count+=1
  num += 1
 
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c=map(int,input().split())

print(b/c-(a-1)/c)

Failing test case input:
12 191 1

Expected output:
180


Actual output:
180.0


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    if i%2==0:
        ans+=1
print(ans)

Failing test case input:
17 53 1

Expected output:
37


Actual output:
18


Fixed submission (verdict: Accepted):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    if i%d==0:
        ans+=1
print(ans)

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):

L,R,d=map(int,input().split())
count=0
for i in range(L,R,d):
    count=count+1
print(count)



Failing test case input:
1 32 3

Expected output:
10


Actual output:
11


Fixed submission (verdict: Accepted):

L,R,d=map(int,input().split())
count=0
for i in range(L,R+1):
    if(i%d==0):
        count=count+1
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = [int(x) for x in input().split()]

c = 0
for i in range(L+1,R+1):
  if i % d == 0:
    c += 1
print(c)

Failing test case input:
9 73 1

Expected output:
65


Actual output:
64


Fixed submission (verdict: Accepted):
L,R,d = [int(x) for x in input().split()]
 
c = 0
for i in range(L,R+1):
  if i % d == 0:
    c += 1
print(c)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
num = list(map(int, input().split()))
min_range = num[0]
max_range = num[1]
n = num[2]
len([i for i in range(min_range, max_range+1) if i % n <= 0])

Failing test case input:
3 121 3

Expected output:
40


Actual output:

Fixed submission (verdict: Accepted):
num = list(map(int, input().split()))
min_range = num[0]
max_range = num[1]
n = num[2]
ans = len([i for i in range(min_range, max_range+1) if i % n <= 0])
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
count = 0
for i in range(L, R+1, 1):
  if i % 2 == 0:
    count += 1

print(count)

Failing test case input:
9 21 9

Expected output:
2


Actual output:
6


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
count = 0
for i in range(L, R+1, 1):
  if i % d == 0:
    count += 1

print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int,input().split())
count = 0
for i in range(l,r):
  i%d == 0
  count += 1
print(count)

Failing test case input:
9 21 3

Expected output:
5


Actual output:
12


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,S,R = map(int,input().split())
for i in range(L,S+1):
  if (i%R == 0):
    print(i)

Failing test case input:
0 89 1

Expected output:
90


Actual output:
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())
cnt=0
for i in range(l+1,r+1):
  if i%d==0:
    cnt+=1
    
print(cnt)

Failing test case input:
2 14 1

Expected output:
13


Actual output:
12


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
cnt = 0
for i in range(l, r+1):
    if i % d == 0:
        cnt+=1

print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())

l = L 
r = R 

res = r - l
if L == d:
    res += 1

print(res)


Failing test case input:
2 18 1

Expected output:
17


Actual output:
16


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())

res = 0
for i in range(L, R + 1):
    if i % d == 0:
        res += 1
print(res)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
  
cnt = 0
for i in range(L, R+1, 1):
  if i % d == 0:
    cnt += 1
    print(i)

print(cnt)

Failing test case input:
2 73 4

Expected output:
18


Actual output:
4
8
12
16
20
24
28
32
36
40
44
48
52
56
60
64
68
72
18


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
  
cnt = 0
for i in range(L, R+1, 1):
  if i % d == 0:
    cnt += 1

print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
count = 0

for i in range(L-1,R):
    if i%d == 0:
        count+=1

print(count)


Failing test case input:
1 32 3

Expected output:
10


Actual output:
11


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
count = 0

for i in range(L,R+1):
    if i%d == 0:
        count+=1

print(count)

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
l,r,d=list(map(int,input().split()))
if l>r: l,r = r,l
k=(r-l+1)
x=(r-l+1)%d
if x:
    k+=-l
print(k)

Failing test case input:
14 141 2

Expected output:
64


Actual output:
128


Fixed submission (verdict: Accepted):
l,r,d=list(map(int,input().split()))
if l>r: l,r = r,l
k=(r-l+1)
x=(r-l+1)%d
if x:
    if l%d==0 or (l+x-1)%d==0:
        k+=1
    else:k+=-(l
print(k)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = map(int,input().split())
count=int(0)
for i in range(L,R):
    if i%d==0:
        count+=1
print(count)

Failing test case input:
0 110 1

Expected output:
111


Actual output:
110


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,D = map(int, input().split())

r = [i for i in range(L-1,R+1)]
A = [j for j in range(L-1,R+1)]

N = [k for k in r if k % D == 0]

print(len(N))

Failing test case input:
2 32 1

Expected output:
31


Actual output:
32


Fixed submission (verdict: Accepted):
L,R,D = map(int, input().split())

r = [i for i in range(L,R+1)]

N = [k for k in r if k % D == 0]

print(len(N))

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N, M, K = map(int, input().split())
count=0
for i in range(M-N):
    if N&K==0:
        count=count+1
    N=N+1

print(count)

Failing test case input:
11 167 1

Expected output:
157


Actual output:
78


Fixed submission (verdict: Accepted):
N, M, K = map(int, input().split())
count=0
for i in range(M-N+1):
    ans=N%K
    if ans==0:
        count=count+1
    N=N+1
 
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=list(map(int,input().split()))
count=0
for i in range(a[0],a[1]):
    if i%a[2]==0:
        count+=1
print(count)

Failing test case input:
6 10 2

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a=list(map(int,input().split()))
count=0
for i in range(a[0],a[1]+1):
    if i%a[2]==0:
        count+=1
print(count)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(c==1):
    ans+=1
else:
    if(a==c):
        ans+=1
print(ans)

Failing test case input:
9 21 3

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(a%c==0):
    ans+=1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())

ans=0

for i in range(l,r):
    if i%d == 0:
        ans += 1

print(ans)

Failing test case input:
11 76 2

Expected output:
33


Actual output:
32


Fixed submission (verdict: Accepted):
l,r,d=map(int,input().split())

ans=0

for i in range(l,r+1):
    if i%d == 0:
        ans += 1

print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c=map(int,input().split())


Failing test case input:
13 79 1

Expected output:
67


Actual output:

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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())
ans=0
for i in range(l+1,r+1):
  if i%d==0:
    ans+=1
print(ans)

Failing test case input:
1 110 1

Expected output:
110


Actual output:
109


Fixed submission (verdict: Accepted):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
  if i%d==0:
    ans+=1
print(ans)

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
l, r, d = map(int, input().split())
result=0

for i in range(r-l+1):
    if (l+i) % d == 0:
        print(i)
        result+=1
print(result)


Failing test case input:
11 191 1

Expected output:
181


Actual output:
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
result=0

for i in range(r-l+1):
    if (l+i) % d == 0:
        result+=1
print(result)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())
ans=0
for i in range(r-l+1):
	if (r+i)%d==0:
		ans+=1
print(ans)

Failing test case input:
4 134 3

Expected output:
43


Actual output:
44


Fixed submission (verdict: Accepted):
l,r,d=map(int,input().split())
ans=0
for i in range(r-l+1):
	if (l+i)%d==0:
		ans+=1
print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
print(int(R / d) - int(L / d))

Failing test case input:
0 167 1

Expected output:
168


Actual output:
167


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
print(int(R / d) - int((L - 1) / d))

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math

l, r, d = map(int, input().split())

if l % d == 0:
  if r % d == 0:
    print(math.floor(r/d) - math.floor(r/d) + 1)
  else:
    print(math.floor(r/d) - math.floor(r/d) + 1)
else:
  if r % d == 0:
    print(math.floor(r/d) - math.floor(r/d))
  else:
    print(math.floor(r/d) - math.floor(r/d))

Failing test case input:
14 73 4

Expected output:
15


Actual output:
0


Fixed submission (verdict: Accepted):
import math

l, r, d = map(int, input().split())

if l % d == 0:
  if r % d == 0:
    print(math.floor(r/d) - math.floor(l/d) + 1)
  else:
    print(math.floor(r/d) - math.floor(l/d) + 1)
else:
  if r % d == 0:
    print(math.floor(r/d) - math.floor(l/d))
  else:
    print(math.floor(r/d) - math.floor(l/d))

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
L, R, d = map(int, input().split())
ans = 0
for i in range(L, R+1, 1):
  print(i)
  if i % d == 0:
    ans += 1
print(ans)
  

Failing test case input:
6 20 7

Expected output:
2

Actual output:
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
2


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
ans = 0
for i in range(L, R+1, 1):
  if i % d == 0:
    ans += 1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = map(int, input().split())
cnt = 0
for i in range(L, R + 1):
    print(i)
    if i % d == 0:
        cnt += 1

print(cnt)

Failing test case input:
11 191 1

Expected output:
181


Actual output:
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
181


Fixed submission (verdict: Accepted):
L,R,d = map(int, input().split())
cnt = 0
for i in range(L, R + 1):
    if i % d == 0:
        cnt += 1

print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int, input().split())
sum = 0
for i in range(l,r+1):
    if i % 2 == 0:
        sum += 1
print(sum)


Failing test case input:
17 167 1

Expected output:
151


Actual output:
75


Fixed submission (verdict: Accepted):
l,r,d=map(int, input().split())
sum = 0
for i in range(l,r+1):
    if i % d == 0:
        sum += 1
print(sum)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
count = 0
for i in range(L + 1, R):
    if i % d == 0:
        count += 1
print(count)

Failing test case input:
11 76 2

Expected output:
33


Actual output:
32


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

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

Failing test case input:
9 31 6

Expected output:
4


Actual output:
5


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

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
l, r, d = map(int, input().split())
result=0

for i in range(r-l+1):
    if (r+i) % d == 0:
        result+=1
print(result)


Failing test case input:
9 31 6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
result=0

for i in range(r-l+1):
    if (l+i) % d == 0:
        result+=1
print(result)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d = map(int,input().split())
print(r/d-l/d)

Failing test case input:
1 24 9

Expected output:
2


Actual output:
2.5555555555555554


Fixed submission (verdict: Accepted):
l,r,d = map(int,input().split())
print(r

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())

l=l
r=r

if l%d==0:
  print(r-l+1)
else:
  print(r- l)


Failing test case input:
9 21 9

Expected output:
2


Actual output:
13


Fixed submission (verdict: Accepted):
l,r,d = map(int,input().split())

if l%d ==0:
  print(r
else:
  print(r

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
L,R,d = map(int,input().split())

l_d = math.floor(L/d)
r_d = math.floor((R-1)/d)

ans = r_d - l_d
print(ans)

Failing test case input:
14 76 1

Expected output:
63


Actual output:
61


Fixed submission (verdict: Accepted):
import math
L,R,d = map(int,input().split())

l_d = math.floor((L-1)/d)
r_d = math.floor((R)/d)

ans = r_d - l_d
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = map(int,input().split())
count = 0
tmp = 0
while(True):
    if tmp <= L:
        tmp = tmp + d
    elif L <= tmp and tmp<= R:
        count += 1
        tmp = tmp + d
    else:
        break
print(count)

Failing test case input:
1 35 1

Expected output:
35


Actual output:
34


Fixed submission (verdict: Accepted):
L,R,d = map(int,input().split())
count = 0
tmp = 0
while(True):
    if tmp < L:
        tmp = tmp + d
    elif L <= tmp and tmp<= R:
        count += 1
        tmp = tmp + d
    else:
        break
if d == 1:
    print(R- L + 1)
else:
    print(count)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d  = map(int, input().split())

ans = 0
for i in range(L, R + 1):
    if i % 2 == 0:
        ans += 1

print(ans)

Failing test case input:
2 12 1

Expected output:
11


Actual output:
6


Fixed submission (verdict: Accepted):
L, R, d  = map(int, input().split())

ans = 0
for i in range(L, R + 1):
    if i % d == 0:
        ans += 1

print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())
num = 0
for i in range(r - l + 1):
    if  (i + r)/ d == int((i + r) / d):
        num += 1
print(num)


Failing test case input:
1 24 9

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
num = 0
for i in range(r - l +1):
    if (i + l) / d == int((i + l) / d):
        num += 1
print(num)

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

Failing test case input:
17 167 2

Expected output:
75


Actual output:
0


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = map(int,input().split())
count = 0
tmp = 0
while(True):
    if tmp <= L:
        tmp = tmp + d
    elif L <= tmp and tmp<= R:
        count += 1
        tmp = tmp + d
    else:
        break
if d == 1:
    print(R- L + 1)
else:
    print(count)

Failing test case input:
9 31 3

Expected output:
8


Actual output:
7


Fixed submission (verdict: Accepted):
L,R,d = map(int,input().split())
count = 0
tmp = 0
while(True):
    if tmp < L:
        tmp = tmp + d
    elif L <= tmp and tmp<= R:
        count += 1
        tmp = tmp + d
    else:
        break
if d == 1:
    print(R- L + 1)
else:
    print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input().split()

l = int(s[0])
r = int(s[1])
d = int(s[2])

count = 0
i = 0

w = r - l
if w==99:
    w = 100

for i in range(w):
    mod = i % d
    if mod == 0:
        count += 1

print(count)

Failing test case input:
-1 167 1

Expected output:
169


Actual output:
168


Fixed submission (verdict: Accepted):
s = input().split()

l = int(s[0])
r = int(s[1])
d = int(s[2])

count = 0
i = 0

for i in range(l, r+1):
    mod = i % d
    if mod == 0:
        count += 1

print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())

count = 0
for i in range(L, R):
    if i % d == 0:
        count = count + 1

print(count)

Failing test case input:
-1 101 1

Expected output:
103


Actual output:
102


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())

count = 0
for i in range(L, R + 1):
    if i % d == 0:
        count = count + 1

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

Failing test case input:
4 28 1

Expected output:
25


Actual output:
24


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

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

Failing test case input:
28 130 2

Expected output:
52


Actual output:
65


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = list(map(int,input().split()))
answer=int(a[1]/a[2])-int(a[0]/a[2])
print(answer)

Failing test case input:
2 40 2

Expected output:
20


Actual output:
19


Fixed submission (verdict: Accepted):
a = list(map(int,input().split()))
answer=int(a[1]/a[2])-int(a[0]/a[2])
if a[0]%a[2]==0:
    answer=answer+1
print(answer)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
from collections import *
import sys
inp=sys.stdin.readline

def linp(x):
    return list(map(int,x.split()))
def minp(x):
    return map(int,x.split())
    
def main():
    l,r,d = minp(inp())
    rem = l%d
    l += rem
    if l>r:
        print(0)
    else:
        c=1
        while l+d<=r:
            c+=1
            l+=d
        print(c)



if __name__ == "__main__":
    main()


Failing test case input:
1 24 9

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
import math
from collections import *
import sys
inp=sys.stdin.readline

def linp(x):
    return list(map(int,x.split()))
def minp(x):
    return map(int,x.split())
    
def main():
    l,r,d = minp(inp())
    rem = l%d
    if rem!=0:
        l += d-rem
    if l>r:
        print(0)
    else:
        c=0
        while l<=r:
            c+=1
            l+=d
        print(c)



if __name__ == "__main__":
    main()

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())
res = (R - L + 1) 
if (R - L) % d == 0:
    res += 1

print(res)

Failing test case input:
2 98 4

Expected output:
24


Actual output:
98


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())
res = 0
for i in range(L, R+1):
    if i % d == 0:
        res += 1
print(res)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d = map(int,input().split())
ans = round(r/d) - round(l/d)
if r%d ==0 and l%d ==0:
  print(ans+1)
else:
  print(ans)

Failing test case input:
9 20 7

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
l,r,d = map(int,input().split())
ans = round(r
if r%d ==0 and l%d ==0:
  print(ans+1)
else:
  print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())
cnt = 0
for i in range(1, r - l + 2):
  if i % d == 0:
    cnt += 1
print(cnt)

Failing test case input:
9 31 6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
cnt = 0
for i in range(l, r + 1):
  if i % d == 0:
    cnt += 1
print(cnt)

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

def resolve():
    L,R,d=pin()
    cnt=0
    for i in range(L,R+1):
        if i%d==0:cnt+=1

    print(cnt)




Failing test case input:
28 73 1

Expected output:
46


Actual output:

Fixed submission (verdict: Accepted):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

def resolve():
    L,R,d=pin()
    cnt=0
    for i in range(L,R+1):
        if i%d==0:cnt+=1

    print(cnt)

resolve()

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
L,R,d = map(int,input().split())

l_d = math.floor(L/d)
r_d = math.floor(R/d)

ans = r_d - l_d
print(ans)

Failing test case input:
9 21 9

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
import math
L,R,d = map(int,input().split())

l_d = math.floor((L-1)/d)
r_d = math.floor((R)/d)

ans = r_d - l_d
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
from collections import *
import sys
inp=sys.stdin.readline

def linp(x):
    return list(map(int,x.split()))
def minp(x):
    return map(int,x.split())
    
def main():
    l,r,d = minp(inp())
    rem = l%d
    l += d-rem
    if l>r:
        print(0)
    else:
        c=0
        while l<=r:
            c+=1
            l+=d
        print(c)



if __name__ == "__main__":
    main()


Failing test case input:
-1 111 1

Expected output:
113


Actual output:
112


Fixed submission (verdict: Accepted):
import math
from collections import *
import sys
inp=sys.stdin.readline

def linp(x):
    return list(map(int,x.split()))
def minp(x):
    return map(int,x.split())
    
def main():
    l,r,d = minp(inp())
    rem = l%d
    if rem!=0:
        l += d-rem
    if l>r:
        print(0)
    else:
        c=0
        while l<=r:
            c+=1
            l+=d
        print(c)



if __name__ == "__main__":
    main()

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
l, r, d = map(int, input().split())

a = l
ans = 0
while a <= r:
    ans += 1
    a += d
print(ans)

Failing test case input:
9 21 6

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
import math
l, r, d = map(int, input().split())

a = l
ans = 0
while a <= r:
    if a % d == 0:
        ans += 1
    a += 1
print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math as ma
l,r,d = (int(x) for x in input().split())
L = ma.floor (l/d)
R = ma.ceil (r/d)
print (R-L)

Failing test case input:
4 130 3

Expected output:
42


Actual output:
43


Fixed submission (verdict: Accepted):
import math as ma
l,r,d = (int(x) for x in input().split())
L = ma.ceil (l/d)
R = ma.floor (r/d)
print (R-L+1)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
x, y, z = map(int, input().split())
t = 0
for i in range(x,y+1,1):
  if i % 2 == 0:
    t += 1
print(t)

Failing test case input:
12 191 1

Expected output:
180


Actual output:
90


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(c==1):
    ans+=1
if(a==c):
    ans+=1
print(ans)

Failing test case input:
1 35 1

Expected output:
35


Actual output:
36


Fixed submission (verdict: Accepted):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(a%c==0):
    ans+=1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())
a = 0
for i in range(l, r+1):
  if i / d == 0:
    a += 1
print(a)

Failing test case input:
7 63 1

Expected output:
57


Actual output:
0


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

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

Failing test case input:
2 24 1

Expected output:
23


Actual output:
24


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

while num <= int(b):
  if num % int(c) == 0:
    count+=1
  num += 1
 
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = [int(v) for v in input().strip().split(" ")]



num = int((R - L) / d)
if L % d == 0:
    print(num + 1)
else:
    print(num)

Failing test case input:
1 100 2

Expected output:
50


Actual output:
49


Fixed submission (verdict: Accepted):
L, R, d = [int(v) for v in input().strip().split(" ")]



num = 0
for n in range(L, R+1):
    if n % d == 0:
        num += 1

print(num)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
print(ans)

Failing test case input:
-1 110 1

Expected output:
112


Actual output:
111


Fixed submission (verdict: Accepted):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(a%c==0):
    ans+=1
print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(a==c):
    ans+=1
print(ans)

Failing test case input:
13 79 1

Expected output:
67


Actual output:
66


Fixed submission (verdict: Accepted):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(a%c==0):
    ans+=1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())
cnt = 0
for i in range(r - l + 1):
    if (r + i) % d == 0:
        cnt += 1
print(cnt)


Failing test case input:
9 31 6

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
cnt = 0
for i in range(r - l + 1):
    if (l + i) % d == 0:
        cnt += 1
print(cnt)

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
L,R,d=map(int,input().split())
count=0
for i in range(L,R+1):
    print(str(i))
    if i%d==0:
      count+=1
print(str(count))


Failing test case input:
2 100 2

Expected output:
50


Actual output:
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
50


Fixed submission (verdict: Accepted):
L,R,d=map(int,input().split())
count=0
for i in range(L,R+1):
    
    if i%d==0:
      count+=1
print(str(count))

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int, input().split()) 

ans=0
s=d
while s<=r:
  ans+=1
  s+=d
print(ans)

Failing test case input:
2 24 1

Expected output:
23


Actual output:
24


Fixed submission (verdict: Accepted):
l,r,d=map(int, input().split()) 

ans=0
for i in range(l,r+1):
  if i%d==0:
    ans+=1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())

ans = 0
for i in range(l, r+1):
    if i % d:
        ans += 1
print(ans)

Failing test case input:
28 73 1

Expected output:
46


Actual output:
0


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())

ans = 0
for i in range(l, r+1):
    if i % d == 0:
        ans += 1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = input().split()

L = int()
R = int()
d = int()

for i in range(L, R):

    if i % d == 0:
        print(i)


Failing test case input:
1 76 1

Expected output:
76


Actual output:

Fixed submission (verdict: Accepted):
L, R, d = map(int,input().split())



ans = 0

for i in range(L, R+1):
    if i % d == 0:
        ans = ans + 1
        
print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = map(int,input().split())
i=0
for x in range (L,R+1):
    if x%2==0:
        i+=1
print(i)

Failing test case input:
1 32 3

Expected output:
10


Actual output:
16


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())

c = 0
for i in range(L, R+1):
  if i % 3 == 0:
    c += 1
print(c)

Failing test case input:
28 72 1

Expected output:
45


Actual output:
15


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())

i=0
count=0
for i in range(l,r):
  if i%d==0:
    count+=1
print(count)

Failing test case input:
0 100 1

Expected output:
101


Actual output:
100


Fixed submission (verdict: Accepted):
l,r,d=map(int,input().split())

i=0
count=0
for i in range(l,r+1):
  if i%d==0:
    count+=1
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = (int(x) for x in input().split())

if(d == 1):
    print(R-L+1)
else:
    a = int(R/d)
    b = int(L/d)
    print(a-b)


Failing test case input:
9 31 3

Expected output:
8


Actual output:
7


Fixed submission (verdict: Accepted):
L,R,d = (int(x) for x in input().split())

a = int(R/d)
b = int(L/d)

if(L % d == 0):
    print(a-b+1)
else:
    print(a-b)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def solve(L,R,d):
    count = 0
    for i in range(L,R+1):
        if i % d == 0:
            count += 1
    return count
L, R, D = map(int, input().split())

Failing test case input:
8 180 6

Expected output:
29


Actual output:

Fixed submission (verdict: Accepted):
def solve(L,R,d):
    count = 0
    for i in range(L,R+1):
        if i % d == 0:
            count += 1
    return count
L, R, d = map(int, input().split())
print(solve(L,R,d))

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())

ans = int(r/d)-int(l-1/d)
print(ans)

Failing test case input:
14 130 2

Expected output:
59


Actual output:
52


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())

ans = int(r/d)-int((l-1)/d)
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = map(int,input().split())
c =0
for i in (L,R+1):
  if i % d ==0:
    c+=1
print(c)

Failing test case input:
3 121 3

Expected output:
40


Actual output:
1


Fixed submission (verdict: Accepted):
L,R,d = map(int,input().split())
c = 0
for i in range(L,R+1):
  if i % d ==0:
    c+=1
print(c)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R ,d = map(int,input().split())
L = 0
for i in range(L,R):
    if i % d == 0:
        L += 1
print(L)


Failing test case input:
1 58 4

Expected output:
14


Actual output:
15


Fixed submission (verdict: Accepted):
L, R ,d = map(int,input().split())
P = 0
for i in range(L,R+1):
    
    if i % d == 0:
        P += 1
print(P)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
num1, num2, num3 = (int(x) for x in input().split())
count = 0

for i in range(num1, num2+1, num3):
    count = count + 1

print(count)


Failing test case input:
9 20 7

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
num1, num2, num3 = (int(x) for x in input().split())
count = 0

for i in range(num1, num2+1):
    if i % num3 == 0:
        count = count + 1

print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = map(int, input().split())

num_lower = int(L / d)
num_upper = int(R / d)
ans = num_upper - num_lower

print(ans)

Failing test case input:
1 110 1

Expected output:
110


Actual output:
109


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())

num_lower = int((L - 1) / d)
num_upper = int(R / d)
ans = num_upper - num_lower

print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d=map(int,input().split())
if R%d!=0:
    print(int(R/d)-int(L/d))
else:
    print(int(R/d)-int(L/d)+1)

Failing test case input:
5 10 2

Expected output:
3

Actual output:
4


Fixed submission (verdict: Accepted):
L,R,d=map(int,input().split())
if L%d!=0:
    print(int(R/d)-int(L/d))
else:
    print(int(R/d)-int(L/d)+1)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N, M, K = map(int, input().split())
count=0
if K==1:
    count=M-N+1
else: 
    for i in range(M-N+1):
        if N&K==0:
            count=count+1
        N=N+1
 
print(count)

Failing test case input:
3 198 4

Expected output:
49


Actual output:
97


Fixed submission (verdict: Accepted):
N, M, K = map(int, input().split())
count=0
for i in range(M-N+1):
    ans=N%K
    if ans==0:
        count=count+1
    N=N+1
 
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d = map(int,input().split())
print((r-l+1)/d)


Failing test case input:
-1 39 1

Expected output:
41


Actual output:
41.0


Fixed submission (verdict: Accepted):
l,r,d = map(int,input().split())
print(r

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
import sys
input = sys.stdin.readline
l,r,d=map(int,input().split())
v1 = r
v2 = l
if v2==1:
    v2-=1
print(abs(v1-v2))


Failing test case input:
-2 167 1

Expected output:
170


Actual output:
169


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline
l,r,d=map(int,input().split())
ans = 0
for i in range(l,r+1):
    if i%d==0:
        ans+=1
print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,S,R = map(int,input().split())
a = 0
for i in range(L,S+1):
  if (i%R == 0):
    a = a + 1
    print(a)

Failing test case input:
6 20 7

Expected output:
2

Actual output:
1
2


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L, R, d = list(map(int, input().split()))

count = 0
for i in range(L, R):
    if i % d == 0:
        count = count + 1

print(count)

Failing test case input:
0 100 1

Expected output:
101


Actual output:
100


Fixed submission (verdict: Accepted):
L, R, d = map(int, input().split())

count = 0
for i in range(L, R + 1):
    if i % d == 0:
        count = count + 1

print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int,input().split())
ans = 0

for i in range(l, r+1):
    if i % d == 0:
        ans += 1

Failing test case input:
2 12 1

Expected output:
11


Actual output:

Fixed submission (verdict: Accepted):
l, r, d = map(int,input().split())
ans = 0

for i in range(l, r+1):
    if i % d == 0:
        ans += 1

print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
c = 0
L, R, d = map(int, input().split())
for i in range(L, R+1):
    if i % d == 0:
        c += 1
print(d)

Failing test case input:
14 73 4

Expected output:
15


Actual output:
4


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

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d = (int(i) for i in input().split())
z = int(r/d-l/d)
if l%d == 0:
	print(z+1)
else:
	print(z)


Failing test case input:
2 73 4

Expected output:
18


Actual output:
17


Fixed submission (verdict: Accepted):
import math
l,r,d = (int(i) for i in input().split())
z = int(math.floor(r/d)-math.floor(l/d))
if l%d == 0:
	print(z+1)
else:
	print(z)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d=list(map(int,input().split()))
out=0
minn=R
for i in range(L,R+1):
    if i%d==0:
        minn=i
        break
for i in range(minn,R+1,d):
    out+=1
print(out)

Failing test case input:
1 000 1

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
L,R,d=list(map(int,input().split()))
out=0
minn=R+1
for i in range(L,R+1):
    if i%d==0:
        minn=i
        break
for i in range(minn,R+1,d):
    out+=1
print(out)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d=map(int,input().split())
print((r-l+1)/d)


Failing test case input:
9 21 9

Expected output:
2


Actual output:
1.4444444444444444


Fixed submission (verdict: Accepted):
l,r,d = map(int,input().split())
print(r
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
lst = input().split()

L = int(lst[0])
R = int(lst[1])
d = int(lst[2])

if L % d != 0:
   L = L + d - (L % d)

if R % d != 0:
   R = R - d + (R % d)

result = int(((R - L) / d) + 1)

print(result)

Failing test case input:
3 157 6

Expected output:
26


Actual output:
25


Fixed submission (verdict: Accepted):
lst = input().split()

L = int(lst[0])
R = int(lst[1])
d = int(lst[2])

if L % d != 0:
   L = L + d - (L % d)

if R % d != 0:
   R = R - (R % d)

result = int(((R - L) / d) + 1)

print(result)

Problem: p02606
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
l, r, d = map(int, input().split())

cnt = 0
for i in range(l, r+1):
    if i % 7 == 0:
        cnt = cnt + 1

print(cnt)

Failing test case input:
2 110 1

Expected output:
109


Actual output:
15


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())

cnt = 0
for i in range(l, r+1):
    if i % d == 0:
        cnt = cnt + 1

print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,D = map(int, input().split())

r = [i for i in range(L-1,R+1)]
A = [j for j in range(L-1,R+1)]

del r[::D]

print(len(A)-len(r) -1)

Failing test case input:
14 130 2

Expected output:
59


Actual output:
58


Fixed submission (verdict: Accepted):
L,R,D = map(int, input().split())

r = [i for i in range(L,R+1)]

N = [k for k in r if k % D == 0]

print(len(N))

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d = map(int, input().split())
cns = 0
for i in range(l, r, d):
    cns += 1
if l % d == 0:
    cns += 1
print(cns)

Failing test case input:
1 33 12

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
l,r,d = map(int, input().split())
cns = 0
for i in range(l, r + 1):
    if i % d == 0:
        cns += 1

print(cns)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())
cnt=0
for i in range(r-l+1):
    if  (i +1)% d  ==0:
        cnt +=1
print(cnt)

Failing test case input:
9 21 9

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())
cnt = 0
for i in range(r - l + 1):
    if (l + i) % d == 0:
        cnt += 1
print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = [int(x) for x in input().split()]

c = 0
for i in range(L,R):
  if i % d == 0:
    c += 1
print(c)

Failing test case input:
5 10 1

Expected output:
6


Actual output:
5


Fixed submission (verdict: Accepted):
L,R,d = [int(x) for x in input().split()]
 
c = 0
for i in range(L,R+1):
  if i % d == 0:
    c += 1
print(c)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from math import ceil

L,R,d = [int(i) for i in input().split()]
ans = ceil((R-L)/d)

if L%d+R%d == 0:
    ans += 1

print(ans)


Failing test case input:
1 33 12

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
L,R,d = [int(i) for i in input().split()]

ans = 0
for i in range(L,R+1):
    if i%d == 0:
        ans += 1

print(ans)
Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d = (int(x) for x in input().split())
cnt=0
for i in range(L,R):
 if i%d==0:
        cnt+=1

print(cnt)

Failing test case input:
11 167 1

Expected output:
157


Actual output:
156


Fixed submission (verdict: Accepted):
L,R,d = (int(x) for x in input().split())
cnt=0
for i in range(L,R+1):
 if i%d==0:
        cnt+=1

print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l,r,d = map(int,input().split())

mod = l % d
cnt = 0
for i in range(mod+l,r+1,d):
  cnt += 1
  
print(cnt)

Failing test case input:
1 32 3

Expected output:
10


Actual output:
11


Fixed submission (verdict: Accepted):
l,r,d = map(int,input().split())

mod = l % d
cnt = 0
for i in range(1,100
  if l <= i*d and r >= i*d:
    cnt += 1
  
print(cnt)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=input().split()
b = int(a[0])
c = int(a[1])
d = int(a[2])
e = c 
print(int(e))

Failing test case input:
0 89 1

Expected output:
90


Actual output:
89


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

if b % d == 0:
  e = e+1

print(int(e))

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = [int(x) for x in input().split()]
count = 0
for i in range(l, r+1):
  if not l%d:
    count += 1
print(count)


Failing test case input:
14 73 2

Expected output:
30


Actual output:
60


Fixed submission (verdict: Accepted):
l, r, d = [int(x) for x in input().split()]
count = 0
for i in range(l, r+1):
  if not i%d:
    count += 1
print(count)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
L,R,d=list(map(int,input().split()))
out=0
minn=R+1
for i in range(L,R+1):
    if i%d==0:
        minn=i
        break
for i in range(minn,R+1,d):
    print(i)
    out+=1
print(out)

Failing test case input:
2 40 2

Expected output:
20


Actual output:
2
4
6
8
10
12
14
16
18
20
22
24
26
28
30
32
34
36
38
40
20


Fixed submission (verdict: Accepted):
L,R,d=list(map(int,input().split()))
out=0
minn=R+1
for i in range(L,R+1):
    if i%d==0:
        minn=i
        break
for i in range(minn,R+1,d):
    out+=1
print(out)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l, r, d = map(int, input().split())

ans = 0
for num in range(l, r+1):
    if num & d == 0:
        ans += 1
print(ans)

Failing test case input:
2 40 2

Expected output:
20


Actual output:
19


Fixed submission (verdict: Accepted):
l, r, d = map(int, input().split())

ans = 0
for num in range(l, r+1):
    if num % d == 0:
        ans += 1
print(ans)

Problem: p02606
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
l = [int(s) for s in input().split()]

print(int(l[1] / l[2]) - int(l[0] / l[2]))

Failing test case input:
12 139 1

Expected output:
128


Actual output:
127


Fixed submission (verdict: Accepted):
l = [int(s) for s in input().split()]

print(int(l[1] / l[2]) - int((l[0]-1) / l[2]))