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.
Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at poin... | instruction | 0 | 88,880 | 3 | 177,760 |
No | output | 1 | 88,880 | 3 | 177,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at poin... | instruction | 0 | 88,881 | 3 | 177,762 |
No | output | 1 | 88,881 | 3 | 177,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at poin... | instruction | 0 | 88,882 | 3 | 177,764 |
No | output | 1 | 88,882 | 3 | 177,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at poin... | instruction | 0 | 88,883 | 3 | 177,766 |
No | output | 1 | 88,883 | 3 | 177,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,953 | 3 | 177,906 |
Tags: binary search, greedy, sortings
Correct Solution:
```
n, T = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
tp, tm = [], []
s = 0
for i, x in enumerate(input().split()):
dt = int(x)-T
if dt > 0:
tp.append([dt, a[i]])
elif dt < 0:
tm.append([-dt, a[i]])
else... | output | 1 | 88,953 | 3 | 177,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,954 | 3 | 177,908 |
Tags: binary search, greedy, sortings
Correct Solution:
```
rd = lambda: map(int, input().split())
n, t = rd()
a = list(rd())
b = list(rd())
x = [[b[i], a[i]] for i in range(n)]
x.sort()
tot, val = sum(a), 0
for i in range(n):
val += (t - x[i][0]) * x[i][1]
if val:
f = 2 * (val > 0) - 1
for i in range(n)[::... | output | 1 | 88,954 | 3 | 177,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,955 | 3 | 177,910 |
Tags: binary search, greedy, sortings
Correct Solution:
```
import sys
from operator import lt, gt, le, ge, itemgetter
n, t = map(int, input().split())
a = list(zip(list(map(int, input().split())), list(map(int, input().split()))))
nume = sum(a[i][0]*a[i][1] for i in range(n))
deno = sum(a[i][0] for i in range(n))
i... | output | 1 | 88,955 | 3 | 177,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,956 | 3 | 177,912 |
Tags: binary search, greedy, sortings
Correct Solution:
```
def get_max_volume(sources, required_temperature):
"""
:param List[Set[int]]sources:
:param int required_temperature:
:return: float
"""
max_volume = 0.
temp = 0
higher_sources = []
lower_sources = []
for volume, temper... | output | 1 | 88,956 | 3 | 177,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,957 | 3 | 177,914 |
Tags: binary search, greedy, sortings
Correct Solution:
```
n,T=map(int,input().split())
a=list(map(int,input().split()))
x=list(map(int,input().split()))
m=[]
q=0
for i in range(n):
m+=[[x[i],a[i]]]
q+=a[i]*x[i]
asu=sum(a)
try:
if q/asu==T:
print(asu)
elif q/asu>T:
m.sort()
asu-... | output | 1 | 88,957 | 3 | 177,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,958 | 3 | 177,916 |
Tags: binary search, greedy, sortings
Correct Solution:
```
n, T = list(map(int, input().split(' ')))
r = list()
r.append(list(map(int, input().split(' '))))
r.append(list(map(int, input().split(' '))))
r.append(list())
for i in range(len(r[0])):
r[2].append((r[0][i], r[1][i]))
r[2].sort(key=lambda x: x[::-1])
for i i... | output | 1 | 88,958 | 3 | 177,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,959 | 3 | 177,918 |
Tags: binary search, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python3
import sys
[n, T] = list(map(int, sys.stdin.readline().strip().split()))
ais = list(map(int, sys.stdin.readline().strip().split()))
tis = list(map(int, sys.stdin.readline().strip().split()))
i_0 = [i for i in range(n) if tis[i] == T]
... | output | 1 | 88,959 | 3 | 177,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real number). The water delivered by i-th tap has temp... | instruction | 0 | 88,960 | 3 | 177,920 |
Tags: binary search, greedy, sortings
Correct Solution:
```
eps = 1e-9
n, T = map(int, input().split())
a = [*map(int, input().split())]
t = [*map(int, input().split())]
l = sorted(zip(t, a))
S = sum(x * y for x, y in l)
V = sum(a)
while l and (S - V * T) > V * eps and l[-1][0] > T:
x, y = l.pop()
d = min(y, ... | output | 1 | 88,960 | 3 | 177,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,961 | 3 | 177,922 |
Yes | output | 1 | 88,961 | 3 | 177,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,962 | 3 | 177,924 |
Yes | output | 1 | 88,962 | 3 | 177,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,963 | 3 | 177,926 |
Yes | output | 1 | 88,963 | 3 | 177,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,964 | 3 | 177,928 |
Yes | output | 1 | 88,964 | 3 | 177,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,965 | 3 | 177,930 |
No | output | 1 | 88,965 | 3 | 177,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,966 | 3 | 177,932 |
No | output | 1 | 88,966 | 3 | 177,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,967 | 3 | 177,934 |
No | output | 1 | 88,967 | 3 | 177,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a system of n water taps all pouring water into the same container. The i-th water tap can be set to deliver any amount of water from 0 to ai ml per second (this amount may be a real nu... | instruction | 0 | 88,968 | 3 | 177,936 |
No | output | 1 | 88,968 | 3 | 177,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In 2215 A.D., a war between two planets, ACM and ICPC, is being more and more intense.
ACM introduced new combat planes. These planes have a special system that is called Graze, and fighting po... | instruction | 0 | 89,175 | 3 | 178,350 |
No | output | 1 | 89,175 | 3 | 178,351 |
Provide a correct Python 3 solution for this coding contest problem.
"Balloons should be captured efficiently", the game designer says. He is designing an oldfashioned game with two dimensional graphics. In the game, balloons fall onto the ground one after another, and the player manipulates a robot vehicle on the gro... | instruction | 0 | 89,190 | 3 | 178,380 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.st... | output | 1 | 89,190 | 3 | 178,381 |
Provide a correct Python 3 solution for this coding contest problem.
"Balloons should be captured efficiently", the game designer says. He is designing an oldfashioned game with two dimensional graphics. In the game, balloons fall onto the ground one after another, and the player manipulates a robot vehicle on the gro... | instruction | 0 | 89,191 | 3 | 178,382 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int... | output | 1 | 89,191 | 3 | 178,383 |
Provide a correct Python 3 solution for this coding contest problem.
"Balloons should be captured efficiently", the game designer says. He is designing an oldfashioned game with two dimensional graphics. In the game, balloons fall onto the ground one after another, and the player manipulates a robot vehicle on the gro... | instruction | 0 | 89,192 | 3 | 178,384 |
"Correct Solution:
```
inf = 10**9
while True:
n = int(input())
if n == 0:
break
b = [(0,0)]
b.extend([tuple(map(int,input().split())) for i in range(n)])
dp = [[inf]*4 for i in range(n+1)]
dp[0][0] = 0
for i in range(n):
update = False
for j in range(4):
... | output | 1 | 89,192 | 3 | 178,385 |
Provide a correct Python 3 solution for this coding contest problem.
"Balloons should be captured efficiently", the game designer says. He is designing an oldfashioned game with two dimensional graphics. In the game, balloons fall onto the ground one after another, and the player manipulates a robot vehicle on the gro... | instruction | 0 | 89,193 | 3 | 178,386 |
"Correct Solution:
```
# coding: utf-8
def do(b_num,step,now_p,item,t):
global ans,p,memo
if (b_num,step,now_p,item,t) in memo:
return
memo.add((b_num,step,now_p,item,t))
if item==0 and b_num>=n:
ans=min(ans,step)
return
if b_num<n and t+(item+1)*abs(balloons[b_num][0]-n... | output | 1 | 89,193 | 3 | 178,387 |
Provide a correct Python 3 solution for this coding contest problem.
Problem statement
N-winged rabbit is on a balance beam of length L-1. The initial position of the i-th rabbit is the integer x_i, which satisfies 0 ≤ x_ {i} \ lt x_ {i + 1} ≤ L−1. The coordinates increase as you move to the right. Any i-th rabbit ca... | instruction | 0 | 89,215 | 3 | 178,430 |
"Correct Solution:
```
def main():
MOD = 1000000007
n, l = map(int, input().split())
xlst = map(int, input().split())
alst = map(int, input().split())
can_use = []
for x, a in zip(xlst, alst):
if a == 0:s = {x}
else:s = {k for k in range(x, l, a)}
can_use.append(s)
dp = [[0] * l for _ in ra... | output | 1 | 89,215 | 3 | 178,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,635 | 3 | 179,270 |
Tags: math
Correct Solution:
```
x1,y1,z1=map(int,input().split())
x2,y2,z2=map(int,input().split())
if x1==x2 or y1==y2 or z1==z2:
print("YES")
else:
print("NO")
``` | output | 1 | 89,635 | 3 | 179,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,636 | 3 | 179,272 |
Tags: math
Correct Solution:
```
a, b = (int(input().replace(' ', ''), 2) for _ in' '*2)
print('YNEOS'[a ^ b == 7::2])
``` | output | 1 | 89,636 | 3 | 179,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,637 | 3 | 179,274 |
Tags: math
Correct Solution:
```
a=[int(b) for b in input().split()]
b=[int(a) for a in input().split()]
if a[0]==b[0] or a[1]==b[1] or a[2]==b[2]:
print("YES")
else:
print("NO")
``` | output | 1 | 89,637 | 3 | 179,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,638 | 3 | 179,276 |
Tags: math
Correct Solution:
```
l1=input().split()
l2=input().split()
s=0
for i in range(3):
if(l1[i]==l2[i]):
s+=1
if(s>=1):
print('YES')
else:
print('NO')
``` | output | 1 | 89,638 | 3 | 179,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,639 | 3 | 179,278 |
Tags: math
Correct Solution:
```
n=list(map(int,input().split()))
x=list(map(int,input().split()))
count=0
for i in range(3):
if n[i]==x[i]:
count+=1
if count==0:
print('NO')
else:
print('YES')
``` | output | 1 | 89,639 | 3 | 179,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,640 | 3 | 179,280 |
Tags: math
Correct Solution:
```
print('YES' if any(i == j for i, j in zip(input().split(), input().split())) else 'NO')
``` | output | 1 | 89,640 | 3 | 179,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,641 | 3 | 179,282 |
Tags: math
Correct Solution:
```
#! /usr/bin/python3
a = input().strip().split()
b = input().strip().split()
c = 0
for i in range (0, 3):
if a[i] == b[i]:
c = c + 1
if c >= 1:
print("YES")
else:
print("NO")
``` | output | 1 | 89,641 | 3 | 179,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in t... | instruction | 0 | 89,642 | 3 | 179,284 |
Tags: math
Correct Solution:
```
A = list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(3):
if A[i] == B[i]:
print('YES')
exit()
print('NO')
``` | output | 1 | 89,642 | 3 | 179,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,643 | 3 | 179,286 |
Yes | output | 1 | 89,643 | 3 | 179,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,644 | 3 | 179,288 |
Yes | output | 1 | 89,644 | 3 | 179,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,645 | 3 | 179,290 |
Yes | output | 1 | 89,645 | 3 | 179,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,646 | 3 | 179,292 |
Yes | output | 1 | 89,646 | 3 | 179,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,647 | 3 | 179,294 |
No | output | 1 | 89,647 | 3 | 179,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,648 | 3 | 179,296 |
No | output | 1 | 89,648 | 3 | 179,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,649 | 3 | 179,298 |
No | output | 1 | 89,649 | 3 | 179,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coo... | instruction | 0 | 89,650 | 3 | 179,300 |
No | output | 1 | 89,650 | 3 | 179,301 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,977 | 3 | 179,954 |
"Correct Solution:
```
#72a
x,t = map(int,input().split())
print(max(x-t,0))
``` | output | 1 | 89,977 | 3 | 179,955 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,978 | 3 | 179,956 |
"Correct Solution:
```
x, t = map(int, input().split())
print(x - min(x, t))
``` | output | 1 | 89,978 | 3 | 179,957 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,979 | 3 | 179,958 |
"Correct Solution:
```
x,t=map(int,input().split())
print([0,x-t][x-t>0])
``` | output | 1 | 89,979 | 3 | 179,959 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,980 | 3 | 179,960 |
"Correct Solution:
```
x, t = (int(i) for i in input().split())
print(max(x - t, 0))
``` | output | 1 | 89,980 | 3 | 179,961 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,981 | 3 | 179,962 |
"Correct Solution:
```
x,t=map(int,input().split())
print(0if x<t else x-t)
``` | output | 1 | 89,981 | 3 | 179,963 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,982 | 3 | 179,964 |
"Correct Solution:
```
x,t=map(int,input().split())
print("0" if x-t<0 else x-t)
``` | output | 1 | 89,982 | 3 | 179,965 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,983 | 3 | 179,966 |
"Correct Solution:
```
print(max(eval(input().replace(" ","-")),0))
``` | output | 1 | 89,983 | 3 | 179,967 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.
How many grams of sand will the upper bulb contains after t seconds?
Constra... | instruction | 0 | 89,984 | 3 | 179,968 |
"Correct Solution:
```
X,t = map(int,input().split(" "))
print(max(0,X-t))
``` | output | 1 | 89,984 | 3 | 179,969 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.