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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n boys and m girls came to the party. Each boy presented each girl some integer number of sweets (possibly zero). All boys are numbered with integers from 1 to n and all girls are numbered with ... | instruction | 0 | 103,759 | 9 | 207,518 |
Yes | output | 1 | 103,759 | 9 | 207,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n boys and m girls came to the party. Each boy presented each girl some integer number of sweets (possibly zero). All boys are numbered with integers from 1 to n and all girls are numbered with ... | instruction | 0 | 103,760 | 9 | 207,520 |
No | output | 1 | 103,760 | 9 | 207,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n boys and m girls came to the party. Each boy presented each girl some integer number of sweets (possibly zero). All boys are numbered with integers from 1 to n and all girls are numbered with ... | instruction | 0 | 103,761 | 9 | 207,522 |
No | output | 1 | 103,761 | 9 | 207,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n boys and m girls came to the party. Each boy presented each girl some integer number of sweets (possibly zero). All boys are numbered with integers from 1 to n and all girls are numbered with ... | instruction | 0 | 103,762 | 9 | 207,524 |
No | output | 1 | 103,762 | 9 | 207,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n boys and m girls came to the party. Each boy presented each girl some integer number of sweets (possibly zero). All boys are numbered with integers from 1 to n and all girls are numbered with ... | instruction | 0 | 103,763 | 9 | 207,526 |
No | output | 1 | 103,763 | 9 | 207,527 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For he knew every Who down in Whoville beneath, Was busy now, hanging a mistletoe wreath. "And they're hanging their stockings!" he snarled with a sneer, "Tomorrow is Christmas! It's practically here!"
Dr. Suess, How The Grinch Stole Christ... | instruction | 0 | 103,961 | 9 | 207,922 |
Tags: binary search, greedy, implementation
Correct Solution:
```
def check(n, casas):
#print('n:',n)
global T,N,street
current = n
time = T
need = 0
last_house = 0
for ind, i in enumerate(street):
time -= 1
if i == 'S':
current += 1
... | output | 1 | 103,961 | 9 | 207,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For he knew every Who down in Whoville beneath, Was busy now, hanging a mistletoe wreath. "And they're hanging their stockings!" he snarled with a sneer, "Tomorrow is Christmas! It's practically... | instruction | 0 | 103,962 | 9 | 207,924 |
No | output | 1 | 103,962 | 9 | 207,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For he knew every Who down in Whoville beneath, Was busy now, hanging a mistletoe wreath. "And they're hanging their stockings!" he snarled with a sneer, "Tomorrow is Christmas! It's practically... | instruction | 0 | 103,963 | 9 | 207,926 |
No | output | 1 | 103,963 | 9 | 207,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For he knew every Who down in Whoville beneath, Was busy now, hanging a mistletoe wreath. "And they're hanging their stockings!" he snarled with a sneer, "Tomorrow is Christmas! It's practically... | instruction | 0 | 103,964 | 9 | 207,928 |
No | output | 1 | 103,964 | 9 | 207,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For he knew every Who down in Whoville beneath, Was busy now, hanging a mistletoe wreath. "And they're hanging their stockings!" he snarled with a sneer, "Tomorrow is Christmas! It's practically... | instruction | 0 | 103,965 | 9 | 207,930 |
No | output | 1 | 103,965 | 9 | 207,931 |
Provide a correct Python 3 solution for this coding contest problem.
Today, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.
He will repeat the following procedure until there is no piece left:
* Choose black or white with equal probability, and eat a piece of that c... | instruction | 0 | 104,247 | 9 | 208,494 |
"Correct Solution:
```
# D より思い付きやすい気がする
class Combination:
def __init__(self, n_max, mod=10**9+7):
# O(n_max + log(mod))
self.mod = mod
f = 1
self.fac = fac = [f]
for i in range(1, n_max+1):
f = f * i % mod
fac.append(f)
f = pow(f, mod-2, mod... | output | 1 | 104,247 | 9 | 208,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.
He will repeat the following procedure until there is no piece left:
* Choose black or... | instruction | 0 | 104,248 | 9 | 208,496 |
Yes | output | 1 | 104,248 | 9 | 208,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.
He will repeat the following procedure until there is no piece left:
* Choose black or... | instruction | 0 | 104,249 | 9 | 208,498 |
Yes | output | 1 | 104,249 | 9 | 208,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.
He will repeat the following procedure until there is no piece left:
* Choose black or... | instruction | 0 | 104,251 | 9 | 208,502 |
Yes | output | 1 | 104,251 | 9 | 208,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.
He will repeat the following procedure until there is no piece left:
* Choose black or... | instruction | 0 | 104,253 | 9 | 208,506 |
No | output | 1 | 104,253 | 9 | 208,507 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,256 | 9 | 208,512 |
"Correct Solution:
```
A,B,K=map(int,input().split())
for i in range(K):
A//=2
B+=A
A,B=B,A
if(K%2):
A,B=B,A
print(A,B)
``` | output | 1 | 104,256 | 9 | 208,513 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,257 | 9 | 208,514 |
"Correct Solution:
```
a,b,k = map(int,input().split())
tmp=1
for i in range(k):
if tmp==1:
b+=a//2
a=a//2
tmp=2
else:
a+=b//2
b=b//2
tmp=1
print(a,b)
``` | output | 1 | 104,257 | 9 | 208,515 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,258 | 9 | 208,516 |
"Correct Solution:
```
A, B, K = map(int,input().split())
for i in range(K):
if i % 2 == 0:
A = A // 2
B += A
else:
B = B // 2
A += B
print(int(A), int(B))
``` | output | 1 | 104,258 | 9 | 208,517 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,259 | 9 | 208,518 |
"Correct Solution:
```
A, B, K = map(int, input().split())
for i in range(K):
if i % 2 == 0:
A, B = A//2, A//2+B
else:
A, B = A+B//2, B//2
print(A,B)
``` | output | 1 | 104,259 | 9 | 208,519 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,260 | 9 | 208,520 |
"Correct Solution:
```
A, B, K = [int(s) for s in input().split(' ')]
for i in range(K):
if i % 2:
B //= 2
A += B
else:
A //= 2
B += A
print ('%d %d' % (A, B))
``` | output | 1 | 104,260 | 9 | 208,521 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,261 | 9 | 208,522 |
"Correct Solution:
```
a,b,k = [int(x) for x in input().split()]
for i in range(k):
if i%2:
a += b//2
b = b//2
else:
b += a//2
a = a//2
print(a,b)
``` | output | 1 | 104,261 | 9 | 208,523 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,262 | 9 | 208,524 |
"Correct Solution:
```
a,b,k = map(int,input().split())
for i in range(k):
if i%2 == 0:
if a%2 != 0 :
a -=1
a /= 2
b += a
else :
if b%2 != 0:
b -= 1
b /= 2
a += b
print(int(a),int(b))
``` | output | 1 | 104,262 | 9 | 208,525 |
Provide a correct Python 3 solution for this coding contest problem.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do not... | instruction | 0 | 104,263 | 9 | 208,526 |
"Correct Solution:
```
A,B,K=map(int,input().split())
for i in range(K):
if i%2==0:
B+=A//2
A=A//2
else:
A+=B//2
B=B//2
print(A,B)
``` | output | 1 | 104,263 | 9 | 208,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,264 | 9 | 208,528 |
Yes | output | 1 | 104,264 | 9 | 208,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,265 | 9 | 208,530 |
Yes | output | 1 | 104,265 | 9 | 208,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,266 | 9 | 208,532 |
Yes | output | 1 | 104,266 | 9 | 208,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,267 | 9 | 208,534 |
Yes | output | 1 | 104,267 | 9 | 208,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,268 | 9 | 208,536 |
No | output | 1 | 104,268 | 9 | 208,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,269 | 9 | 208,538 |
No | output | 1 | 104,269 | 9 | 208,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,270 | 9 | 208,540 |
No | output | 1 | 104,270 | 9 | 208,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd,... | instruction | 0 | 104,271 | 9 | 208,542 |
No | output | 1 | 104,271 | 9 | 208,543 |
Provide a correct Python 3 solution for this coding contest problem.
Akaki, a patissier, can make N kinds of doughnut using only a certain powder called "Okashi no Moto" (literally "material of pastry", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In orde... | instruction | 0 | 104,272 | 9 | 208,544 |
"Correct Solution:
```
N, X, D = map(int, input().split())
M = [0]*N
M[0] = int(input())
P = [0]*N
for i in range(N-1):
M[i+1], P[i+1] = map(int, input().split())
C = [1]*N
for i in range(N-1, 0, -1):
p = P[i]-1
C[p] += C[i]
M[p] += M[i]
L = [D]*N
L[0] = X
from collections import deque
def solve(N, W... | output | 1 | 104,272 | 9 | 208,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Akaki, a patissier, can make N kinds of doughnut using only a certain powder called "Okashi no Moto" (literally "material of pastry", simply called Moto below) as ingredient. These doughnuts are... | instruction | 0 | 104,273 | 9 | 208,546 |
No | output | 1 | 104,273 | 9 | 208,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Akaki, a patissier, can make N kinds of doughnut using only a certain powder called "Okashi no Moto" (literally "material of pastry", simply called Moto below) as ingredient. These doughnuts are... | instruction | 0 | 104,274 | 9 | 208,548 |
No | output | 1 | 104,274 | 9 | 208,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Akaki, a patissier, can make N kinds of doughnut using only a certain powder called "Okashi no Moto" (literally "material of pastry", simply called Moto below) as ingredient. These doughnuts are... | instruction | 0 | 104,275 | 9 | 208,550 |
No | output | 1 | 104,275 | 9 | 208,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Akaki, a patissier, can make N kinds of doughnut using only a certain powder called "Okashi no Moto" (literally "material of pastry", simply called Moto below) as ingredient. These doughnuts are... | instruction | 0 | 104,276 | 9 | 208,552 |
No | output | 1 | 104,276 | 9 | 208,553 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,357 | 9 | 208,714 |
"Correct Solution:
```
while True:
k = int(input())
if k == 0:
break
print(sum(map(int, input().split())) // (k - 1))
``` | output | 1 | 104,357 | 9 | 208,715 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,358 | 9 | 208,716 |
"Correct Solution:
```
while True:
k = int(input())
if k == 0:
break
sums = sum(int(n) for n in input().split())
print( sums // (k - 1))
``` | output | 1 | 104,358 | 9 | 208,717 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,359 | 9 | 208,718 |
"Correct Solution:
```
while True:
K = int(input())
if K == 0:
break
c = [int(i) for i in input().split()]
S = 0
for i in range(len(c)):
S = S + c[i]
print(int(S/(K-1)))
``` | output | 1 | 104,359 | 9 | 208,719 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,360 | 9 | 208,720 |
"Correct Solution:
```
while True:
K = eval(input())
if K == 0:
break
total = sum([eval(c) for c in input().split()])
print(int(total/(K-1)))
``` | output | 1 | 104,360 | 9 | 208,721 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,361 | 9 | 208,722 |
"Correct Solution:
```
while 1:
k=int(input())
if k==0:break
print(sum(map(int,input().split()))//(k-1))
``` | output | 1 | 104,361 | 9 | 208,723 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,362 | 9 | 208,724 |
"Correct Solution:
```
while 1:
k=int(input())-1
if k<0:break
print(sum(map(int,input().split()))//k)
``` | output | 1 | 104,362 | 9 | 208,725 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,363 | 9 | 208,726 |
"Correct Solution:
```
# AOJ 1027: A Piece of Cake
# Python3 2018.7.5 bal4u
while True:
K = int(input())
if K == 0: break
print(sum(list(map(int, input().split())))//(K-1))
``` | output | 1 | 104,363 | 9 | 208,727 |
Provide a correct Python 3 solution for this coding contest problem.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly aw... | instruction | 0 | 104,364 | 9 | 208,728 |
"Correct Solution:
```
while True:
K = int(input())
if K == 0:
break
elif K == 1:
print(int(input()))
else:
po = [int(i) for i in input().split()]
print(int(sum(po)/(K-1)))
``` | output | 1 | 104,364 | 9 | 208,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty. However, there was a man who is displeased at the shop. He was an owner of another shop. Al... | instruction | 0 | 104,365 | 9 | 208,730 |
No | output | 1 | 104,365 | 9 | 208,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some rabbits in Singapore Zoo. To feed them, Zookeeper bought n carrots with lengths a_1, a_2, a_3, …, a_n. However, rabbits are very fertile and multiply very quickly. Zookeeper now has k rabbits and does not have enough carrots t... | instruction | 0 | 104,637 | 9 | 209,274 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
from bisect import *
from collections import *
from math import *
from heapq import *
from typing import List
from itertools import *
from operator import *
from functools import *
#------------------------------------------------------... | output | 1 | 104,637 | 9 | 209,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some rabbits in Singapore Zoo. To feed them, Zookeeper bought n carrots with lengths a_1, a_2, a_3, …, a_n. However, rabbits are very fertile and multiply very quickly. Zookeeper now has k rabbits and does not have enough carrots t... | instruction | 0 | 104,638 | 9 | 209,276 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import heapq
def value(l,parts):
len1 = l//parts
len2 = len1+1
cnt2 = l%parts
cnt1 = parts-cnt2
return (cnt1*len1*len1) + (cnt2*len2*len2 )
def solve(n,k,a):
#20 - 6 6 6 = 18, 20 -> 7,7,6 = as evenly as poss... | output | 1 | 104,638 | 9 | 209,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some rabbits in Singapore Zoo. To feed them, Zookeeper bought n carrots with lengths a_1, a_2, a_3, …, a_n. However, rabbits are very fertile and multiply very quickly. Zookeeper now has k rabbits and does not have enough carrots t... | instruction | 0 | 104,639 | 9 | 209,278 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writa... | output | 1 | 104,639 | 9 | 209,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some rabbits in Singapore Zoo. To feed them, Zookeeper bought n carrots with lengths a_1, a_2, a_3, …, a_n. However, rabbits are very fertile and multiply very quickly. Zookeeper now has k rabbits and does not have enough carrots t... | instruction | 0 | 104,640 | 9 | 209,280 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import sys
from heapq import heapify, heappush, heappop
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j ... | output | 1 | 104,640 | 9 | 209,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some rabbits in Singapore Zoo. To feed them, Zookeeper bought n carrots with lengths a_1, a_2, a_3, …, a_n. However, rabbits are very fertile and multiply very quickly. Zookeeper now has k rabbits and does not have enough carrots t... | instruction | 0 | 104,641 | 9 | 209,282 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
#... | output | 1 | 104,641 | 9 | 209,283 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.