message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flowerbed has many flowers and two fountains.
You can adjust the water pressure and set any values r1(r1 ≥ 0) and r2(r2 ≥ 0), giving the distances at which the water is spread from the first ... | instruction | 0 | 55,236 | 3 | 110,472 |
No | output | 1 | 55,236 | 3 | 110,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flowerbed has many flowers and two fountains.
You can adjust the water pressure and set any values r1(r1 ≥ 0) and r2(r2 ≥ 0), giving the distances at which the water is spread from the first ... | instruction | 0 | 55,237 | 3 | 110,474 |
No | output | 1 | 55,237 | 3 | 110,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,238 | 3 | 110,476 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
import itertools
class SolutionImpossible(Exception):
pass
blocks_cnt, finish, min_sprint, max_jump = [int(x) for x in input().split()]
def read_blocks_coords():
it = (int(x) for x in input().split())
return (x for x in it if x < finish... | output | 1 | 55,238 | 3 | 110,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,239 | 3 | 110,478 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
n, m, s, d = map(int, input().split())
beg = [float('-inf')]
end = [float('-inf')]
a = [int(i) for i in input().split()]
for x in sorted(a):
if (x - end[-1] > s + 1):
beg.append(x)
end.append(x)
else:
end[-1] = x
last = 0
R = []
J = []
for i... | output | 1 | 55,239 | 3 | 110,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,240 | 3 | 110,480 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
def gcd(a, b):
if a == 0:
return b
return gcd(b % a, a)
def lcm(a, b):
return (a * b) / gcd(a, b)
def main():
n, m, s, d = map(int, input().split())
a = list(map(int, input().split(... | output | 1 | 55,240 | 3 | 110,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,241 | 3 | 110,482 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
n,m,s,d=map(int,input().split())
x=list(map(int,input().split()))+[m+s+1]
x.sort()
cur=l=0
ans=[]
while l<m:
r=min(x[cur]-1,m)
ans.append(("RUN",r-l))
if r==m:
break
if r-l<s:
print("IMPOSSIBLE")
exit()
t=x[cur]+1
while x[cur+1]-1... | output | 1 | 55,241 | 3 | 110,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,242 | 3 | 110,484 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
num_barriers, finish, min_run, max_jump = tuple(map(int, input().split()))
barriers = list(map(int, input().split())) + [-1]
barriers.sort()
for i in range(len(barriers) - 1):
if barriers[i + 1] - barriers[i] <= min_run + 1:
barriers[i] = (... | output | 1 | 55,242 | 3 | 110,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,243 | 3 | 110,486 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
imp = "IMPOSSIBLE"
n, m, s, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
too_short = [False] * n
if a[0] - 1 < s:
too_short[0] = True
for i in range(1, n):
if (a[i] - a[i - 1] - 2 < s):
too_short[i] = True
... | output | 1 | 55,243 | 3 | 110,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,244 | 3 | 110,488 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
n,m,s,d=map(int,input().split())
obstacles=[-1]+list(map(int,input().split()))+[m+1]
obstacles.sort()
check=[]
a=True
ans=[]
pos=0
for i in range(n+1):
if i!=n and obstacles[i+1]-obstacles[i]-2<s:
#print(i)
if i==0 or obstacles[i+1]+1... | output | 1 | 55,244 | 3 | 110,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s met... | instruction | 0 | 55,245 | 3 | 110,490 |
Tags: *special, data structures, dp, greedy
Correct Solution:
```
f = lambda: map(int, input().split())
n, m, s, d = f()
p, x, z = [], -1, 1
for y in sorted(f()) + [m + 1]:
if y - x > s + 1 or y > m or x < 0:
u = x - z + 2
v = y - x - 2
if u > d or v < s and x < 0:
p = ['IMPOSSIB... | output | 1 | 55,245 | 3 | 110,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,246 | 3 | 110,492 |
Yes | output | 1 | 55,246 | 3 | 110,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,247 | 3 | 110,494 |
Yes | output | 1 | 55,247 | 3 | 110,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,248 | 3 | 110,496 |
Yes | output | 1 | 55,248 | 3 | 110,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,249 | 3 | 110,498 |
Yes | output | 1 | 55,249 | 3 | 110,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,250 | 3 | 110,500 |
No | output | 1 | 55,250 | 3 | 110,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,251 | 3 | 110,502 |
No | output | 1 | 55,251 | 3 | 110,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,252 | 3 | 110,504 |
No | output | 1 | 55,252 | 3 | 110,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sportsman starts from point xstart = 0 and runs to point with coordinate xfinish = m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not l... | instruction | 0 | 55,253 | 3 | 110,506 |
No | output | 1 | 55,253 | 3 | 110,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,270 | 3 | 110,540 |
Tags: binary search
Correct Solution:
```
def check(bound):
more, less = 0, 0
for x in a:
if x > bound: more += x - bound
else: less += bound - x
return more * (100 - k) / 100 - less >= 0
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
res, l, r = 0, 0, 1000
if max(a) == min(a): ... | output | 1 | 55,270 | 3 | 110,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,271 | 3 | 110,542 |
Tags: binary search
Correct Solution:
```
def isEnough(x):
receiving = 0
giving = 0
for acc in accumulators:
if acc < x:
receiving += x - acc
else:
giving += (acc - x) * (100 - k) / 100
return (receiving <= giving)
def BinarySreach(l, r):
left = l
right =... | output | 1 | 55,271 | 3 | 110,543 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,272 | 3 | 110,544 |
Tags: binary search
Correct Solution:
```
n, k = list(map(int, input().split(" ")))
inp = list(map(int, input().split(" ")))
x, y = [1, 3]
_sum = sum(inp)
right =_sum / n
left = 0
mid =(right + left) / 2
while right - left > 1e-11:
lost = 0
get = 0
for i in inp:
if mid < i:
lost += (i -... | output | 1 | 55,272 | 3 | 110,545 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,274 | 3 | 110,548 |
Tags: binary search
Correct Solution:
```
n,k=map(int,input().split(" "))
a=list(map(int,input().split(" ")))
def check(x):
pw=0
for i in a:
if(i>=x):
rem=(i-x)
pw+=(rem-(rem*k/100))
else:
pw-=(x-i)
if(pw>=0): return True
return False
l=0
h=max(a)
ans=0
while(l+0.00000001<=h):
mid=(l+h)/2
if(c... | output | 1 | 55,274 | 3 | 110,549 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,275 | 3 | 110,550 |
Tags: binary search
Correct Solution:
```
def check(a, k, cur):
need = 0
have = 0
for x in a:
if x < cur:
need += cur - x
else:
have += (x - cur) * (1 - k / 100)
return need <= have
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
l = 0
r = 1000
for i in range(100):
cur = (... | output | 1 | 55,275 | 3 | 110,551 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,276 | 3 | 110,552 |
Tags: binary search
Correct Solution:
```
n,k=map(int,input().split(" "))
a=list(map(int,input().split(" ")))
def check(x):
pw=0
for i in a:
if(i>=x):
rem=(i-x)
pw+=(rem-(rem*k/100))
else:
pw-=(x-i)
if(pw>=0): return True
return False
l=0
h=max(a)
ans=0
while(l+0.00000001<=h):
mid=(l+h)/2
if(c... | output | 1 | 55,276 | 3 | 110,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,277 | 3 | 110,554 |
Yes | output | 1 | 55,277 | 3 | 110,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,278 | 3 | 110,556 |
Yes | output | 1 | 55,278 | 3 | 110,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,279 | 3 | 110,558 |
Yes | output | 1 | 55,279 | 3 | 110,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,280 | 3 | 110,560 |
Yes | output | 1 | 55,280 | 3 | 110,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,281 | 3 | 110,562 |
No | output | 1 | 55,281 | 3 | 110,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,282 | 3 | 110,564 |
No | output | 1 | 55,282 | 3 | 110,565 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,283 | 3 | 110,566 |
No | output | 1 | 55,283 | 3 | 110,567 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amoun... | instruction | 0 | 55,284 | 3 | 110,568 |
No | output | 1 | 55,284 | 3 | 110,569 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ICM ACPC World Finals is coming! Unfortunately, the organizers of the competition were so busy preparing tasks that totally missed an important technical point — the organization of electric... | instruction | 0 | 55,299 | 3 | 110,598 |
No | output | 1 | 55,299 | 3 | 110,599 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ICM ACPC World Finals is coming! Unfortunately, the organizers of the competition were so busy preparing tasks that totally missed an important technical point — the organization of electric... | instruction | 0 | 55,300 | 3 | 110,600 |
No | output | 1 | 55,300 | 3 | 110,601 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ICM ACPC World Finals is coming! Unfortunately, the organizers of the competition were so busy preparing tasks that totally missed an important technical point — the organization of electric... | instruction | 0 | 55,301 | 3 | 110,602 |
No | output | 1 | 55,301 | 3 | 110,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each village's population?
Input
Same as the easy versi... | instruction | 0 | 55,316 | 3 | 110,632 |
Tags: math
Correct Solution:
```
def sampleVariance(V):
X = sum(V) / len(V)
S = 0.0
for x in V:
S += (X-x)**2
S /= (len(V)-1)
return (X, S)
#That awkward moment when you realized that variance is sigma^2 but you just took the stat course this semester
for i in range(int(input())):
V = ... | output | 1 | 55,316 | 3 | 110,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each village's population?
Input
Same as the easy versi... | instruction | 0 | 55,317 | 3 | 110,634 |
Tags: math
Correct Solution:
```
from statistics import mean
from math import factorial, log, ceil
_lf = []
def logfact(n):
global _lf
CALCLEN = 2200
if not _lf:
_lf = [0]*CALCLEN
for i in range(2, CALCLEN):
_lf[i] = _lf[i-1] + log(i)
return _lf[n]
def unif_ml(xs):
#p1 ... | output | 1 | 55,317 | 3 | 110,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each villa... | instruction | 0 | 55,319 | 3 | 110,638 |
No | output | 1 | 55,319 | 3 | 110,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each villa... | instruction | 0 | 55,320 | 3 | 110,640 |
No | output | 1 | 55,320 | 3 | 110,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each villa... | instruction | 0 | 55,321 | 3 | 110,642 |
No | output | 1 | 55,321 | 3 | 110,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each villa... | instruction | 0 | 55,322 | 3 | 110,644 |
No | output | 1 | 55,322 | 3 | 110,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,348 | 3 | 110,696 |
Yes | output | 1 | 55,348 | 3 | 110,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,349 | 3 | 110,698 |
Yes | output | 1 | 55,349 | 3 | 110,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,350 | 3 | 110,700 |
Yes | output | 1 | 55,350 | 3 | 110,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,351 | 3 | 110,702 |
Yes | output | 1 | 55,351 | 3 | 110,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,352 | 3 | 110,704 |
No | output | 1 | 55,352 | 3 | 110,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,353 | 3 | 110,706 |
No | output | 1 | 55,353 | 3 | 110,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,354 | 3 | 110,708 |
No | output | 1 | 55,354 | 3 | 110,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
What are you doing at the end of the world? Are you busy? Will you save us?
<image>
Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, f0... ∞.
f... | instruction | 0 | 55,355 | 3 | 110,710 |
No | output | 1 | 55,355 | 3 | 110,711 |
Provide a correct Python 3 solution for this coding contest problem.
Professor Tsukuba invented a mysterious jewelry box that can be opened with a special gold key whose shape is very strange. It is composed of gold bars joined at their ends. Each gold bar has the same length and is placed parallel to one of the three... | instruction | 0 | 55,551 | 3 | 111,102 |
"Correct Solution:
```
def solve(sentence):
now = [0, 0, 0] # x,y,z
num_p = {}
positions = []
for s in sentence:
if s.isdecimal():
if s in num_p:
now = num_p[s]
else:
num_p[s] = now
else:
sign = 1 if s[0] == "+" else -1... | output | 1 | 55,551 | 3 | 111,103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.