message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,915 | 1 | 189,830 |
Tags: binary search
Correct Solution:
```
n=int(input())
x=[int(x) for x in input().split()]
v=[int(x) for x in input().split()]
def fin(h):
return max(abs(h-x[i])/v[i] for i in range(n))
l,r=1.0,1e9
while r-l>5e-7:
mid=(l+r)/2
if (fin(mid-4e-7)<fin(mid+4e-7)):
r=mid
else:
l=mid
print(fin(l))
``` | output | 1 | 94,915 | 1 | 189,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,916 | 1 | 189,832 |
Tags: binary search
Correct Solution:
```
def f(t):
a = (x[0] - v[0] * t) * 1.0
b = (x[n - 1] + v[n - 1] * t) * 1.0
for i in range(n):
if x[i] - v[i] * t > a:
a = x[i] - v[i] * t
if x[i] + v[i] * t < b:
b = x[i] + v[i] * t
#print(a, b)
return a <= b... | output | 1 | 94,916 | 1 | 189,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,917 | 1 | 189,834 |
Tags: binary search
Correct Solution:
```
from math import isclose
n = int(input())
x = list(map(int, input().split()))
v = list(map(int, input().split()))
xx = list((x[i], v[i]) for i in range(n))
xx.sort()
l, h = xx[0][0], xx[-1][0]
m = (h + l) / 2
while not isclose(l, h):
m = (h + l) / 2
t = abs(m - xx[0][0]... | output | 1 | 94,917 | 1 | 189,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,918 | 1 | 189,836 |
Tags: binary search
Correct Solution:
```
from sys import stdin
inp=stdin.readline
n=int(inp())
d=[int(x) for x in inp().split()]
v,big,small,t=[int(x) for x in inp().split()],max(d),min(d),0
while(big-small>10**-6):
t=-1
mid=(big+small)/2
for i in range(n):
i... | output | 1 | 94,918 | 1 | 189,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,919 | 1 | 189,838 |
Tags: binary search
Correct Solution:
```
def main(n, x, v):
eps = 1e-7
def f(p):
nonlocal n, x, v
t = 0.0
for i in range(n):
t = max(t, abs(x[i] - p) / v[i])
return t
low = 0
high = 1e9
while low + eps < high:
mid = (high + low) / 2
midd =... | output | 1 | 94,919 | 1 | 189,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,920 | 1 | 189,840 |
Tags: binary search
Correct Solution:
```
def check(f, speed, t):
inter = (f[0] - speed[0] * t, f[0] + speed[0] * t)
for i in range(1, len(f)):
cur = (f[i] - speed[i] * t, f[i] + speed[i] * t)
if cur[0] > inter[1] or inter[0] > cur[1]:
return False
else:
inter = (... | output | 1 | 94,920 | 1 | 189,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the road there are n friends, and i-th of them is ... | instruction | 0 | 94,921 | 1 | 189,842 |
Tags: binary search
Correct Solution:
```
def inputIntegerArray():
return list( map( int, input().split(" ") ) )
def time( t, pos, speed ):
maxleft = 0
minright = 1000000000
for i in range(0,len(pos)):
distance = speed[i]*t
left = pos[i]-distance
right = pos[i]+distance
... | output | 1 | 94,921 | 1 | 189,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,922 | 1 | 189,844 |
Yes | output | 1 | 94,922 | 1 | 189,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,923 | 1 | 189,846 |
Yes | output | 1 | 94,923 | 1 | 189,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,924 | 1 | 189,848 |
Yes | output | 1 | 94,924 | 1 | 189,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,925 | 1 | 189,850 |
Yes | output | 1 | 94,925 | 1 | 189,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,926 | 1 | 189,852 |
No | output | 1 | 94,926 | 1 | 189,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,927 | 1 | 189,854 |
No | output | 1 | 94,927 | 1 | 189,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,928 | 1 | 189,856 |
No | output | 1 | 94,928 | 1 | 189,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.
At some points on the... | instruction | 0 | 94,929 | 1 | 189,858 |
No | output | 1 | 94,929 | 1 | 189,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You already know that Valery's favorite sport is biathlon. Due to your help, he learned to shoot without missing, and his skills are unmatched at the shooting range. But now a smaller task is to be performed, he should learn to complete the ... | instruction | 0 | 94,958 | 1 | 189,916 |
Tags: graphs, greedy, shortest paths
Correct Solution:
```
import sys
from array import array # noqa: F401
from itertools import combinations
from collections import deque
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n, m, k = map(int, input().split())
chars = (
['}' * (m + 2)]
+ ['}... | output | 1 | 94,958 | 1 | 189,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,469 | 1 | 190,938 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
from heapq import heappop, heappush
nodes, edges, capitalIndex = map(int, input().split())
adj = [dict() for i in range(nodes + 1)]
visited = [False] * (nodes + 1)
costList = [float("inf")] * (nodes + 1)
costList[capitalIndex] = 0
for... | output | 1 | 95,469 | 1 | 190,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,470 | 1 | 190,940 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
n, m, s = map(int, input().split())
p = [[] for i in range(n + 1)]
for i in range(m):
u, v, w = map(int, input().split())
p[u].append((v, w))
p[v].append((u, w))
l = int(input())
t = [l + 1] * (n + 1)
t[s], q = 0, {s... | output | 1 | 95,470 | 1 | 190,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,471 | 1 | 190,942 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
from heapq import heappush, heappop
def iin():
return (map(int, input().split()))
nodes, edges, start = iin()
start -= 1
graph = [[] for x in range(nodes)]
edge_list = []
shortpath = [float('inf') for x in range(nodes)]
for x in ... | output | 1 | 95,471 | 1 | 190,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,472 | 1 | 190,944 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
from heapq import heappush, heappop
def i_in():
return (map(int, input().split()))
nodes, edges, start = i_in()
start -= 1
graph = [[] for x in range(nodes)]
edge_list = []
shortest_path = [float('inf') for x in range(nodes)]
f... | output | 1 | 95,472 | 1 | 190,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,473 | 1 | 190,946 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys
n,m,s=map(int,sys.stdin.readline().split())
p=[[] for i in range(n+1)]
for i in range(m):
u, v, w = map(int, input().split())
p[u].append((v, w))
p[v].append((u, w))
l = int(input())
t = [l + 1] * (n + 1)
t[... | output | 1 | 95,473 | 1 | 190,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,474 | 1 | 190,948 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys
n,m,s=map(int,sys.stdin.readline().split())
p=[[] for i in range(n+1)]
for i in range(m):
u, v, w = map(int, input().split())
p[u].append((v, w))
p[v].append((u, w))
l = int(sys.stdin.readline())
t = [l + 1] ... | output | 1 | 95,474 | 1 | 190,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,475 | 1 | 190,950 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
from sys import stdin
from heapq import heappush, heappop
INF = 2 * 10 ** 9
def dijkstra(graph, n, s):
d = [INF] * n
d[s] = 0
# class VertexIndex(int):
# def __cmp__(self, other):
# return cmp(d[self... | output | 1 | 95,475 | 1 | 190,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to any other one by these roads. According... | instruction | 0 | 95,476 | 1 | 190,952 |
Tags: data structures, dfs and similar, graphs, shortest paths
Correct Solution:
```
from heapq import heappush, heappop
def i_in():
return (map(int, input().split()))
nodes, edges, start = i_in()
start -= 1
graph = [[] for x in range(nodes)]
edge_list = []
shortest_path = [float('inf') for x in range(nodes)]
f... | output | 1 | 95,476 | 1 | 190,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,477 | 1 | 190,954 |
Yes | output | 1 | 95,477 | 1 | 190,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,478 | 1 | 190,956 |
Yes | output | 1 | 95,478 | 1 | 190,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,479 | 1 | 190,958 |
Yes | output | 1 | 95,479 | 1 | 190,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,480 | 1 | 190,960 |
Yes | output | 1 | 95,480 | 1 | 190,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,481 | 1 | 190,962 |
No | output | 1 | 95,481 | 1 | 190,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,482 | 1 | 190,964 |
No | output | 1 | 95,482 | 1 | 190,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,483 | 1 | 190,966 |
No | output | 1 | 95,483 | 1 | 190,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each ... | instruction | 0 | 95,484 | 1 | 190,968 |
No | output | 1 | 95,484 | 1 | 190,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transpo... | instruction | 0 | 95,785 | 1 | 191,570 |
Tags: greedy
Correct Solution:
```
"""
Author - Satwik Tiwari .
15th Dec , 2020 - Tuesday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
impor... | output | 1 | 95,785 | 1 | 191,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transpo... | instruction | 0 | 95,786 | 1 | 191,572 |
Tags: greedy
Correct Solution:
```
import heapq
n,k = map(int,input().split())
l = list(map(int,input().split()))
ans = [0]*n
h = []
for i in range(k):
h.append((-1*l[i],i))
heapq.heapify(h)
som = 0
for i in range(k,n+k):
if i < n:
heapq.heappush(h, (-1 * l[i], i))
x = heapq.heappop(h)
s = -1*... | output | 1 | 95,786 | 1 | 191,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transpo... | instruction | 0 | 95,787 | 1 | 191,574 |
Tags: greedy
Correct Solution:
```
from heapq import heappush, heappop, heapify
n, k = map(int, input().split())
a = list(map(int, input().split()))
q = [(-a[i], i) for i in range(k)]
heapify(q)
res, s = [0] * n, 0
for i in range(k, n):
heappush(q, (-a[i], i))
x, j = heappop(q)
s -= x * (i-j)
res[j] = i... | output | 1 | 95,787 | 1 | 191,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transpo... | instruction | 0 | 95,788 | 1 | 191,576 |
Tags: greedy
Correct Solution:
```
from heapq import heappush,heappop,heapify
n,k=map(int,input().split())
*l,=map(int,input().split())
q=[(-l[i],i)for i in range(k)]
heapify(q)
a=[0]*n
s=0
for i in range(k,n) :
heappush(q,(-l[i],i))
x,j=heappop(q)
s-=x*(i-j)
a[j]=i+1
for i in range(n,n+k) :
x,j=hea... | output | 1 | 95,788 | 1 | 191,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transpo... | instruction | 0 | 95,789 | 1 | 191,578 |
Tags: greedy
Correct Solution:
```
from heapq import heappush,heappop,heapify
n,k=map(int,input().split())
*l,=map(int,input().split())
q=[(-l[i],i)for i in range(k)];heapify(q)
a=[0]*n
s=0
for i in range(k,n):
heappush(q,(-l[i],i))
x,j=heappop(q)
s-=x*(i-j)
a[j]=i+1
for i in range(n,n+k):
x,j=heapp... | output | 1 | 95,789 | 1 | 191,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.
Metropolis airport is the main transpo... | instruction | 0 | 95,790 | 1 | 191,580 |
Tags: greedy
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
... | output | 1 | 95,790 | 1 | 191,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of t... | instruction | 0 | 95,791 | 1 | 191,582 |
No | output | 1 | 95,791 | 1 | 191,583 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,041 | 1 | 192,082 |
"Correct Solution:
```
a,b,c = map(int,input().split())
lst = []
ans = 0
cnt = 0
while True:
s = (60*cnt+c) % (a+b)
if s in lst:
ans = -1
break
lst.append(s)
if 0 <= s <= a:
ans = 60 * cnt + c
break
cnt += 1
print(ans)
``` | output | 1 | 96,041 | 1 | 192,083 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,042 | 1 | 192,084 |
"Correct Solution:
```
a, b, c = map(int, input().split())
now = 0
used = [False] * 60
while True:
sleep_start = now + a
if now % 60 < sleep_start % 60:
if now % 60 <= c <= sleep_start % 60:
print(now // 60 * 60 + c)
break
now = sleep_start + b
else:
if now % ... | output | 1 | 96,042 | 1 | 192,085 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,043 | 1 | 192,086 |
"Correct Solution:
```
def solve(a, b, c):
l = 0; r = a;
for t in range(514):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print(-1)
a, b, c = map(int, input().split())
solve(a,b,c)
``` | output | 1 | 96,043 | 1 | 192,087 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,044 | 1 | 192,088 |
"Correct Solution:
```
a, b, c = map(int, input().split())
passed = set()
time = 0
while True:
if time % 60 <= c <= time % 60 + a:
print(c + time // 60 * 60)
break
else:
time += a + b
if time % 60 in passed:
print(-1)
break
else:
passed... | output | 1 | 96,044 | 1 | 192,089 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,045 | 1 | 192,090 |
"Correct Solution:
```
a,b,c=map(int, input().split())
d=0
for _ in range(60):
if c<=d+a:
print(c)
break
d+=a+b
while c<=d:c+=60
else: print(-1)
``` | output | 1 | 96,045 | 1 | 192,091 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,046 | 1 | 192,092 |
"Correct Solution:
```
import sys
A,B,C = map(int,input().split())
time = 0
ss = set()
while True:
if time%60 == C:
print(time)
sys.exit()
for t in range(A):
time += 1
if time%60 == C:
print(time)
sys.exit()
time += B
if (time%60) in ss:
br... | output | 1 | 96,046 | 1 | 192,093 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,047 | 1 | 192,094 |
"Correct Solution:
```
A, B, C = map(int, input().split())
t = 0
while True:
t += A
if t >= C:
print(C)
break
t += B
if t > C:
C += 60
if t > 1000000:
print(-1)
break
``` | output | 1 | 96,047 | 1 | 192,095 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the destination, and you can get off if you are awake at this t... | instruction | 0 | 96,048 | 1 | 192,096 |
"Correct Solution:
```
a, b, c = map(int, input().split())
l = 0; r = a;
for i in range(80):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print(-1)
``` | output | 1 | 96,048 | 1 | 192,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the des... | instruction | 0 | 96,049 | 1 | 192,098 |
Yes | output | 1 | 96,049 | 1 | 192,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the des... | instruction | 0 | 96,050 | 1 | 192,100 |
Yes | output | 1 | 96,050 | 1 | 192,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. A wants to get to the destination on the Yamanote line.
After getting on the train, Mr. A gets up for a minute and sleeps for b minutes repeatedly. It is c minutes after boarding to the des... | instruction | 0 | 96,051 | 1 | 192,102 |
Yes | output | 1 | 96,051 | 1 | 192,103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.