message stringlengths 2 22.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 145 109k | cluster float64 9 9 | __index_level_0__ int64 290 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of deliciousness r_1,r_2, \dots, r_C.
Before eating a colorl... | instruction | 0 | 32,259 | 9 | 64,518 |
"Correct Solution:
```
X,Y,A,B,C=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
eat=p[:X]+q[:Y]+r
eat.sort(reverse=True)
eat=eat[:(X+Y)]
print(sum(eat))
``` | output | 1 | 32,259 | 9 | 64,519 |
Provide a correct Python 3 solution for this coding contest problem.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of deliciousness r_1,r_2, \dots, r_C.
Before eating a colorl... | instruction | 0 | 32,260 | 9 | 64,520 |
"Correct Solution:
```
x,y,a,b,c=map(int,input().split())
*p,=sorted(map(int, input().split()))
*q,=sorted(map(int, input().split()))
*r,=map(int, input().split())
p=p[-x:]
q=q[-y:]
r=sorted(p+q+r)
print(sum(r[-x-y:]))
``` | output | 1 | 32,260 | 9 | 64,521 |
Provide a correct Python 3 solution for this coding contest problem.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of deliciousness r_1,r_2, \dots, r_C.
Before eating a colorl... | instruction | 0 | 32,261 | 9 | 64,522 |
"Correct Solution:
```
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
ls = p[:x]+q[:y]+r
ls.sort(reverse=True)
print(sum(ls[:x+y]))
``` | output | 1 | 32,261 | 9 | 64,523 |
Provide a correct Python 3 solution for this coding contest problem.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of deliciousness r_1,r_2, \dots, r_C.
Before eating a colorl... | instruction | 0 | 32,262 | 9 | 64,524 |
"Correct Solution:
```
x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)[:x]
q = sorted(list(map(int, input().split())), reverse=True)[:y]
r = list(map(int, input().split()))
print(sum(sorted(p + q + r, reverse=True)[:x+y]))
``` | output | 1 | 32,262 | 9 | 64,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,263 | 9 | 64,526 |
Yes | output | 1 | 32,263 | 9 | 64,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,264 | 9 | 64,528 |
Yes | output | 1 | 32,264 | 9 | 64,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,265 | 9 | 64,530 |
Yes | output | 1 | 32,265 | 9 | 64,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,266 | 9 | 64,532 |
Yes | output | 1 | 32,266 | 9 | 64,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,267 | 9 | 64,534 |
No | output | 1 | 32,267 | 9 | 64,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,268 | 9 | 64,536 |
No | output | 1 | 32,268 | 9 | 64,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,269 | 9 | 64,538 |
No | output | 1 | 32,269 | 9 | 64,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are going to eat X red apples and Y green apples.
You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of d... | instruction | 0 | 32,270 | 9 | 64,540 |
No | output | 1 | 32,270 | 9 | 64,541 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,287 | 9 | 64,574 |
"Correct Solution:
```
N,L=map(int,input().split())
l=[L+i for i in range(N)]
l_abs=[abs(i) for i in l]
print(sum(l)-l[l_abs.index(min(l_abs))])
``` | output | 1 | 32,287 | 9 | 64,575 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,288 | 9 | 64,576 |
"Correct Solution:
```
N, L = map(int, input().split())
aji = [L + i for i in range(N)]
print(sum(aji) - min(aji, key=abs))
``` | output | 1 | 32,288 | 9 | 64,577 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,289 | 9 | 64,578 |
"Correct Solution:
```
n,l=map(int,input().split())
if n+l-1<0:
b=n+l-1
elif l>0:
b=l
else:
b=0
print(int(n*(2*l+n-1)/2-b))
``` | output | 1 | 32,289 | 9 | 64,579 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,290 | 9 | 64,580 |
"Correct Solution:
```
n,l = map(int,input().split())
if 0 <= l:
t = 1
else:
t = min(n,-l+1)
print(int((1/2*n*(2*l+n-1)-(t+l-1))))
``` | output | 1 | 32,290 | 9 | 64,581 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,291 | 9 | 64,582 |
"Correct Solution:
```
n,l = map(int,input().split())
al = [l+i for i in range(n)]
a = min(al,key=abs)
al.remove(a)
print(sum(al))
``` | output | 1 | 32,291 | 9 | 64,583 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,292 | 9 | 64,584 |
"Correct Solution:
```
N,L = map(int,input().split())
A = [L+i for i in range(N)]
A.sort(key = lambda x: abs(x))
answer = sum(A[1:])
print(answer)
``` | output | 1 | 32,292 | 9 | 64,585 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,293 | 9 | 64,586 |
"Correct Solution:
```
n,l=map(int,input().split())
a=(l-1)*n+((n+1)*(n))//2
print(a if l<=0<=l+n-1 else (a-l if 0<l else a-l-n+1))
``` | output | 1 | 32,293 | 9 | 64,587 |
Provide a correct Python 3 solution for this coding contest problem.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the ap... | instruction | 0 | 32,294 | 9 | 64,588 |
"Correct Solution:
```
N,L=map(int,input().split())
L=[L+i-1 for i in range(1,N+1)]
c=sum(L)
R=[abs(i) for i in L]
print(c-L[R.index(min(R))])
``` | output | 1 | 32,294 | 9 | 64,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,295 | 9 | 64,590 |
Yes | output | 1 | 32,295 | 9 | 64,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,296 | 9 | 64,592 |
Yes | output | 1 | 32,296 | 9 | 64,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,297 | 9 | 64,594 |
Yes | output | 1 | 32,297 | 9 | 64,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,298 | 9 | 64,596 |
Yes | output | 1 | 32,298 | 9 | 64,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,299 | 9 | 64,598 |
No | output | 1 | 32,299 | 9 | 64,599 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,300 | 9 | 64,600 |
No | output | 1 | 32,300 | 9 | 64,601 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,301 | 9 | 64,602 |
No | output | 1 | 32,301 | 9 | 64,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.
You can make an apple pie using one or more of the apples. The flavor o... | instruction | 0 | 32,302 | 9 | 64,604 |
No | output | 1 | 32,302 | 9 | 64,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,755 | 9 | 65,510 |
Tags: implementation, math
Correct Solution:
```
n, k, l, c, d, p, nl, np = list(map(int, input().split(' ')))
totml = k*l
totslice = c*d
x = totml//nl
y = p//np
z = min(x,y,totslice)
print(z//n)
``` | output | 1 | 32,755 | 9 | 65,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,756 | 9 | 65,512 |
Tags: implementation, math
Correct Solution:
```
n, k, l, c, d, p, nl, np = map(int,input().split())
a = (k*l)//(nl*n)
b = (c*d)//(n)
c = (p) // (np*n)
print(min(a,b,c))
``` | output | 1 | 32,756 | 9 | 65,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,757 | 9 | 65,514 |
Tags: implementation, math
Correct Solution:
```
arr=list(map(int, input().split()))
n=arr[0]
k=arr[1]
l=arr[2]
c=arr[3]
d=arr[4]
p=arr[5]
nl=arr[6]
np=arr[7]
drink=(k*l)//nl
slices=c*d
salt=p//np
print(min(drink, slices, salt)//n)
``` | output | 1 | 32,757 | 9 | 65,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,758 | 9 | 65,516 |
Tags: implementation, math
Correct Solution:
```
n,k,l,c,d,p,nl,np=map(int,input().split())
a,b,q=k*l//nl,c*d,p//np
print(min(a,b,q)//n)
``` | output | 1 | 32,758 | 9 | 65,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,759 | 9 | 65,518 |
Tags: implementation, math
Correct Solution:
```
#!/usr/bin/python3
def readln(): return tuple(map(int, input().split()))
n, k, l, c, d, p, nl, np = readln()
cnt_l = k * l // nl
cnt_d = c * d
cnt_p = p // np
print(min([cnt_l // n, cnt_d // n, cnt_p // n]))
``` | output | 1 | 32,759 | 9 | 65,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,760 | 9 | 65,520 |
Tags: implementation, math
Correct Solution:
```
n,k,l,c,d,p,nl,np=map(int,input().split())
v=(k*l)//nl
b=(c*d)
m=p//np
print(min(v,b,m)//n)
``` | output | 1 | 32,760 | 9 | 65,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,761 | 9 | 65,522 |
Tags: implementation, math
Correct Solution:
```
n, k, l, c, d, p, nl, np = list(map(int, input().split()))
print(min(k * l // nl, c * d, p // np) // n)
``` | output | 1 | 32,761 | 9 | 65,523 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices.... | instruction | 0 | 32,762 | 9 | 65,524 |
Tags: implementation, math
Correct Solution:
```
def answer():
a = input().split()
a = [int(x) for x in a]
n,k,l,c,d,p,nl,np=a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7]
volume =k*l
slices=c*d
salt=p
vols=int(volume/(nl*n))
slik=int(slices/n)
slt=int(salt/(np*n))
return min(vols,slik... | output | 1 | 32,762 | 9 | 65,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,763 | 9 | 65,526 |
Yes | output | 1 | 32,763 | 9 | 65,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,764 | 9 | 65,528 |
Yes | output | 1 | 32,764 | 9 | 65,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,765 | 9 | 65,530 |
Yes | output | 1 | 32,765 | 9 | 65,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,766 | 9 | 65,532 |
Yes | output | 1 | 32,766 | 9 | 65,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,767 | 9 | 65,534 |
No | output | 1 | 32,767 | 9 | 65,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,768 | 9 | 65,536 |
No | output | 1 | 32,768 | 9 | 65,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,769 | 9 | 65,538 |
No | output | 1 | 32,769 | 9 | 65,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bou... | instruction | 0 | 32,770 | 9 | 65,540 |
No | output | 1 | 32,770 | 9 | 65,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.
<image>
Each Karafs has a positive integer height. Tavas ... | instruction | 0 | 33,786 | 9 | 67,572 |
Tags: binary search, greedy, math
Correct Solution:
```
import math
a, b, n = [int(x) for x in input().split()]
for i in range(n):
l, t, m = [int(x) for x in input().split()]
x = a + (l - 1) * b
if x > t:
print("-1")
continue
r = (t - a) // b + 1
D = (2 * x - b) ** 2 + 8 * m * t * ... | output | 1 | 33,786 | 9 | 67,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.
<image>
Each Karafs has a positive integer height. Tavas ... | instruction | 0 | 33,787 | 9 | 67,574 |
Tags: binary search, greedy, math
Correct Solution:
```
from collections import defaultdict,deque,Counter
import sys
import bisect
import math
input=sys.stdin.readline
mod=1000000007
a,b,n=map(int,input().split())
for ii in range(n):
l,t,m=map(int,input().split())
lo=l
hi=100000000
while lo<hi:
... | output | 1 | 33,787 | 9 | 67,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.
<image>
Each Karafs has a positive integer height. Tavas ... | instruction | 0 | 33,788 | 9 | 67,576 |
Tags: binary search, greedy, math
Correct Solution:
```
A, B, n = map(int, input().split())
def s(i):
return A + i * B
def f(r):
return r * A + r * (r - 1) // 2 * B
for i in range(n):
l, t, m = map(int, input().split())
ans = -1
if s(l - 1) <= t:
L, R = l, 10 ** 6 + 1
while L + 1 ... | output | 1 | 33,788 | 9 | 67,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.
<image>
Each Karafs has a positive integer height. Tavas ... | instruction | 0 | 33,789 | 9 | 67,578 |
Tags: binary search, greedy, math
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
# from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('i... | output | 1 | 33,789 | 9 | 67,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.
<image>
Each Karafs has a positive integer height. Tavas ... | instruction | 0 | 33,790 | 9 | 67,580 |
Tags: binary search, greedy, math
Correct Solution:
```
from sys import stdin
A,B,n = [int(x) for x in stdin.readline().split()]
for q in range(n):
l,t,m = [int(x) for x in stdin.readline().split()]
l -= 1
if B*l+A > t:
print(-1)
else:
const = A*(l)+(B*(l-1)*(l))//2
#print(l,const)
high = (t-A... | output | 1 | 33,790 | 9 | 67,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.
<image>
Each Karafs has a positive integer height. Tavas ... | instruction | 0 | 33,791 | 9 | 67,582 |
Tags: binary search, greedy, math
Correct Solution:
```
import math
A, B, n = map(int, input().split())
ans = []
for _ in range(n):
l, t, m = map(int, input().split())
if A + B * (l - 1) > t:
ans.append(-1)
continue
r1 = (t - A) / B + 1
D = (B-2*A)*(B-2*A)-4*B*(-2*l*A+2*A-B*(l-2)*(l-1)-2*m*t)
r2 = int(((B-... | output | 1 | 33,791 | 9 | 67,583 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.