message stringlengths 2 43.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 853 107k | cluster float64 24 24 | __index_level_0__ int64 1.71k 214k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such shovels in the shop.
In his pocket Polycarp has a... | instruction | 0 | 23,373 | 24 | 46,746 |
Tags: brute force, constructive algorithms, implementation, math
Correct Solution:
```
n, g = map(int, input().split(" "))
s = n
f = n % 10
count = 1
while f != 0 and f != g:
s += n
f = s % 10
count += 1
print(count)
``` | output | 1 | 23,373 | 24 | 46,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,374 | 24 | 46,748 |
Yes | output | 1 | 23,374 | 24 | 46,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,375 | 24 | 46,750 |
Yes | output | 1 | 23,375 | 24 | 46,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,376 | 24 | 46,752 |
Yes | output | 1 | 23,376 | 24 | 46,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,377 | 24 | 46,754 |
Yes | output | 1 | 23,377 | 24 | 46,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,378 | 24 | 46,756 |
No | output | 1 | 23,378 | 24 | 46,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,379 | 24 | 46,758 |
No | output | 1 | 23,379 | 24 | 46,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,380 | 24 | 46,760 |
No | output | 1 | 23,380 | 24 | 46,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such sho... | instruction | 0 | 23,381 | 24 | 46,762 |
No | output | 1 | 23,381 | 24 | 46,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,446 | 24 | 46,892 |
Tags: greedy
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
forward = arr[:]
cnt = arr[0] + 1
for i in range(1, n):
forward[i] = max(cnt, arr[i])
cnt = max(cnt, arr[i]) + 1
backward = arr[:]
cnt = arr[n - 1] + 1
for i in range(n - 2, -1, -1):
backward[i] = max(cnt, arr[i])
... | output | 1 | 23,446 | 24 | 46,893 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,447 | 24 | 46,894 |
Tags: greedy
Correct Solution:
```
n = int(input())
a = list(map(int,input().strip().split()))
if n > 1:
li = [0]*n
ri = [0]*n
lm = a[0]
c = [0]*n
b = [0]*n
b[0] = a[0]
for i in range(1,n):
if lm >= a[i]:
li[i] = li[i-1] + (lm+1-a[i])
lm = lm+1
else:
li[i] = li[i-1]
lm = a[i]
b[i] = lm
lm = a[... | output | 1 | 23,447 | 24 | 46,895 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,448 | 24 | 46,896 |
Tags: greedy
Correct Solution:
```
n = int(input())
def get_cost(arr):
cost = [0,0]
last = arr[0]
for i in range(1,len(arr)):
cost.append(cost[-1] + max(0,last+1-arr[i]))
last = max(last+1,arr[i])
return cost
arr = list(map(int,input().split()))
left_cost, right_cost = get_cost(arr), get... | output | 1 | 23,448 | 24 | 46,897 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,449 | 24 | 46,898 |
Tags: greedy
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
starts = [0 for _ in range(n)]
ends = [0 for _ in range(n)]
starts[0] = arr[0]
ends[-1] = arr[-1]
for i in range(1, n):
starts[i] = max(arr[i], starts[i - 1] + 1)
ends[-i - 1] = max(arr[-i - 1], ends[-i] + 1)
sts = s... | output | 1 | 23,449 | 24 | 46,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,450 | 24 | 46,900 |
Tags: greedy
Correct Solution:
```
n = int(input())
a = [0 for i in range(n)]
b = [0 for i in range(n)]
f = [0 for i in range(n)]
q = [0 for i in range(n)]
d = [int(s) for s in input().split()]
last = d[0]
for i in range(1,n):
a[i] = a[i-1]
if d[i] <= last:
a[i] += abs(d[i] - last) + 1
last +=... | output | 1 | 23,450 | 24 | 46,901 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,451 | 24 | 46,902 |
Tags: greedy
Correct Solution:
```
import math
n = int(input())
a = list(map(int, input().split()))
mx = 0
g = [0]*n
r = [0]*n
t1 = [0]*n
t2 = [0]*n
for i in range(n):
g[i] = max(0, mx-a[i]+1)
mx = a[i] + g[i]
t1[i] = mx
if i > 0:
g[i] += g[i-1]
mx = 0
for i in range(n-1, -1, -1):
r[i] = max(0, mx-a[i]+1)
m... | output | 1 | 23,451 | 24 | 46,903 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,452 | 24 | 46,904 |
Tags: greedy
Correct Solution:
```
n=int(input())
p=list(map(int,input().split()))
a=[0]*n
t=s=f=0
for i in range(n):
if p[i]<=t:a[i]=t-p[i]+1
t=max(p[i],t+1)
for i in range(n-1,0,-1):
if p[i] <= s: a[i] = min(s - p[i] + 1,a[i])
else:a[i]=0
s = max(p[i], s + 1)
for i in range(n):p[i]+=a[i];f|=i>1and... | output | 1 | 23,452 | 24 | 46,905 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends ... | instruction | 0 | 23,453 | 24 | 46,906 |
Tags: greedy
Correct Solution:
```
s, l, r = 0, 0, int(input()) - 1
t = list(map(int, input().split()))
while 1:
while l < r and t[l] < t[l + 1]: l += 1
while l < r and t[r] < t[r - 1]: r -= 1
if l == r: break
if t[l] < t[r]:
s += t[l] - t[l + 1] + 1
t[l + 1] = t[l] + 1
else:
... | output | 1 | 23,453 | 24 | 46,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,454 | 24 | 46,908 |
Yes | output | 1 | 23,454 | 24 | 46,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,455 | 24 | 46,910 |
Yes | output | 1 | 23,455 | 24 | 46,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,456 | 24 | 46,912 |
Yes | output | 1 | 23,456 | 24 | 46,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,457 | 24 | 46,914 |
Yes | output | 1 | 23,457 | 24 | 46,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,458 | 24 | 46,916 |
No | output | 1 | 23,458 | 24 | 46,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,459 | 24 | 46,918 |
No | output | 1 | 23,459 | 24 | 46,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,460 | 24 | 46,920 |
No | output | 1 | 23,460 | 24 | 46,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will... | instruction | 0 | 23,461 | 24 | 46,922 |
No | output | 1 | 23,461 | 24 | 46,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,939 | 24 | 47,878 |
Tags: implementation, math
Correct Solution:
```
t = int(input())
for i in range(t):
a, b, c, r = map(int, input().split())
a, b = (min(a, b), max(a, b))
if a==b:
print(0)
else:
if c <= a:
if a-c>=r:
print(b-a)
else:
print( max((b-a) - (r - (a-c)), 0))
elif c >= b:
if (c-b)>=r:
print... | output | 1 | 23,939 | 24 | 47,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,940 | 24 | 47,880 |
Tags: implementation, math
Correct Solution:
```
for _ in range(int(input())):
a,b,c,r = input().split(" ")
a,b,c,r = int(a),int(b),int(c),int(r)
x,y=min(a,b),max(a,b)
count=0
if c>=x and c<=y:
if c+r<=y:
count+=y-c-r
if c-r>=x:
count+=c-r-x
elif c>=y:
... | output | 1 | 23,940 | 24 | 47,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,941 | 24 | 47,882 |
Tags: implementation, math
Correct Solution:
```
for _ in range(int(input())):
p,q,c,r = map(int,input().split())
a = min(p,q)
b = max(p,q)
lc = c - r
lr = c + r
if(a >= lc and b <= lr):
ans = 0
elif(a > lr or b < lc):
ans = abs(b - a)
else:
left = lc - a
... | output | 1 | 23,941 | 24 | 47,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,942 | 24 | 47,884 |
Tags: implementation, math
Correct Solution:
```
t = int(input())
while t > 0:
a, b, c, r = map(int, input().split())
if a > b:
a, b = b, a
l = max(c-r, a)
r = min(c+r, b)
print(b-a-max(0,r-l))
t -= 1
``` | output | 1 | 23,942 | 24 | 47,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,943 | 24 | 47,886 |
Tags: implementation, math
Correct Solution:
```
q = int(input())
def solve():
a, b, c, r = map(int, input().split())
if a> b : a,b =b,a
p1 = c - r
p2 = c + r
if p1 >=a and p2<=b:
print(p1-a + b-p2)
elif a < p1 < b < p2:
print(p1-a)
elif b > p2 > a > p1:
print(b-p... | output | 1 | 23,943 | 24 | 47,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,944 | 24 | 47,888 |
Tags: implementation, math
Correct Solution:
```
def fn(a, b, c, r):
x1 = min(a, b)
y1 = max(a, b)
x2 = c - r
y2 = c + r
# case 1, 2, 3
if (x1 >= x2 and y1 <= y2):
return 0
#case 4
if (x1 < x2 and y1 < y2 and y1 > x2):
return x2 - x1
#case 5
if (y1 > y2 and x1 >... | output | 1 | 23,944 | 24 | 47,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,945 | 24 | 47,890 |
Tags: implementation, math
Correct Solution:
```
"""
Satwik_Tiwari ;) .
29th july , 2020 - Wednesday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fra... | output | 1 | 23,945 | 24 | 47,891 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c the base station of the mobile operator is place... | instruction | 0 | 23,946 | 24 | 47,892 |
Tags: implementation, math
Correct Solution:
```
t=int(input())
while t>0:
ta=input().split()
A=int(ta[0])
B=int(ta[1])
f=int(ta[2])
r=int(ta[3])
C=f+r
D=f-r
c=min(C,D)
d=max(C,D)
a=min(A,B)
b=max(A,B)
if r==0:
print(b-a)
elif c>=b:
print(b-a)
elif... | output | 1 | 23,946 | 24 | 47,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,947 | 24 | 47,894 |
Yes | output | 1 | 23,947 | 24 | 47,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,948 | 24 | 47,896 |
Yes | output | 1 | 23,948 | 24 | 47,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,949 | 24 | 47,898 |
Yes | output | 1 | 23,949 | 24 | 47,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,950 | 24 | 47,900 |
Yes | output | 1 | 23,950 | 24 | 47,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,951 | 24 | 47,902 |
No | output | 1 | 23,951 | 24 | 47,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,952 | 24 | 47,904 |
No | output | 1 | 23,952 | 24 | 47,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,953 | 24 | 47,906 |
No | output | 1 | 23,953 | 24 | 47,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp lives on the coordinate axis Ox and travels from the point x=a to x=b. It moves uniformly rectilinearly at a speed of one unit of distance per minute.
On the axis Ox at the point x=c t... | instruction | 0 | 23,954 | 24 | 47,908 |
No | output | 1 | 23,954 | 24 | 47,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just launched his new startup idea. The niche is pretty free and the key vector of development sounds really promising, so he easily found himself some investors ready to sponsor th... | instruction | 0 | 24,743 | 24 | 49,486 |
No | output | 1 | 24,743 | 24 | 49,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just launched his new startup idea. The niche is pretty free and the key vector of development sounds really promising, so he easily found himself some investors ready to sponsor th... | instruction | 0 | 24,744 | 24 | 49,488 |
No | output | 1 | 24,744 | 24 | 49,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just launched his new startup idea. The niche is pretty free and the key vector of development sounds really promising, so he easily found himself some investors ready to sponsor th... | instruction | 0 | 24,745 | 24 | 49,490 |
No | output | 1 | 24,745 | 24 | 49,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just launched his new startup idea. The niche is pretty free and the key vector of development sounds really promising, so he easily found himself some investors ready to sponsor th... | instruction | 0 | 24,746 | 24 | 49,492 |
No | output | 1 | 24,746 | 24 | 49,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
If you write a solution in Python, then prefer to send it in PyPy to speed up execution time.
A session has begun at Beland State University. Many students are taking exams... | instruction | 0 | 24,827 | 24 | 49,654 |
Tags: brute force, data structures, greedy, math
Correct Solution:
```
"""
Satwik_Tiwari ;) .
25 june , 2020 - Thursday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from f... | output | 1 | 24,827 | 24 | 49,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
If you write a solution in Python, then prefer to send it in PyPy to speed up execution time.
A session has begun at Beland State University. Many students are taking exams... | instruction | 0 | 24,828 | 24 | 49,656 |
Tags: brute force, data structures, greedy, math
Correct Solution:
```
n, m = [int(i) for i in input().split()]
line = [int(x) for x in input().split()]
count = {i+1:0 for i in range(100)}
sum = 0
for i in line:
p = sum + i
t = 0
if p > m:
for j in range(100, 0, -1):
if count[j] == 0:
... | output | 1 | 24,828 | 24 | 49,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
If you write a solution in Python, then prefer to send it in PyPy to speed up execution time.
A session has begun at Beland State University. Many students are taking exams... | instruction | 0 | 24,829 | 24 | 49,658 |
Tags: brute force, data structures, greedy, math
Correct Solution:
```
import math
import heapq
import copy
from collections import OrderedDict
from collections import deque
t=list(map(int,input().split()))
d=t[1]
k=list(map(int,input().split()))
m=[0]*101
ans=list()
time=0
for i in range(t[0]):
time=time+k[i]
... | output | 1 | 24,829 | 24 | 49,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
If you write a solution in Python, then prefer to send it in PyPy to speed up execution time.
A session has begun at Beland State University. Many students are taking exams... | instruction | 0 | 24,830 | 24 | 49,660 |
Tags: brute force, data structures, greedy, math
Correct Solution:
```
import math
n,m=map(int,input().split())
arr=list(map(int,input().split()))
prefix=[0]*n
count=[0]*101
for i in range(101):
count[i]=[0]*200001
for i in range(n):
prefix[i]=prefix[i-1]+arr[i]
for j in range(1,101):
# print(j,i,count[j][i],cou... | output | 1 | 24,830 | 24 | 49,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
If you write a solution in Python, then prefer to send it in PyPy to speed up execution time.
A session has begun at Beland State University. Many students are taking exams... | instruction | 0 | 24,831 | 24 | 49,662 |
Tags: brute force, data structures, greedy, math
Correct Solution:
```
n, m = list(map(int, input().split()))
t = list(map(int, input().split()))
freq = []
for i in range(101):
freq.append(0)
for i in range(0, n):
time = m-t[i]
num = 0
for j in range(1, 101):
p = int(time/j)
if p >= fr... | output | 1 | 24,831 | 24 | 49,663 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.