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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The territory of Berland is represented by a rectangular field n × m in size. The king of Berland lives in the capital, located on the upper left square (1, 1). The lower right square has coordi... | instruction | 0 | 39,961 | 1 | 79,922 |
No | output | 1 | 39,961 | 1 | 79,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The territory of Berland is represented by a rectangular field n × m in size. The king of Berland lives in the capital, located on the upper left square (1, 1). The lower right square has coordi... | instruction | 0 | 39,962 | 1 | 79,924 |
No | output | 1 | 39,962 | 1 | 79,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The territory of Berland is represented by a rectangular field n × m in size. The king of Berland lives in the capital, located on the upper left square (1, 1). The lower right square has coordi... | instruction | 0 | 39,963 | 1 | 79,926 |
No | output | 1 | 39,963 | 1 | 79,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The territory of Berland is represented by a rectangular field n × m in size. The king of Berland lives in the capital, located on the upper left square (1, 1). The lower right square has coordi... | instruction | 0 | 39,964 | 1 | 79,928 |
No | output | 1 | 39,964 | 1 | 79,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,094 | 1 | 80,188 |
Tags: implementation
Correct Solution:
```
from sys import *
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l3=list(map(int,input().split()))
l4=list(map(int,input().split()))
if l1[-1]:
if sum(l1[:-1]) or l4[2] or l2[0] or l3[1]: print("YES"); exit()
if l2[-1]:
if sum(l2[:-1]) or l1[2] or ... | output | 1 | 40,094 | 1 | 80,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,095 | 1 | 80,190 |
Tags: implementation
Correct Solution:
```
arr = [list(map(int, input().split())) for _ in range(4)]
flag = False
for i in range(4):
f = False
if arr[i][3] == 1:
s = sum([arr[i][j] for j in range(3)]) + arr[(i+2)%4][1] + arr[(i+1)%4][0] + arr[(i+3)%4][2]
if s > 0:
f = True
if f... | output | 1 | 40,095 | 1 | 80,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,096 | 1 | 80,192 |
Tags: implementation
Correct Solution:
```
a = []
for i in range(4):
a.append(list(map(int, input().split())))
state = 0
for i in range(4):
if a[i][3] == 1:
if a[i-1][2] or a[i-2][1] or a[i-3][0]:
state = 1
if a[i][2] or a[i][1] or a[i][0]:
state = 1
if state:
print("YES")
else:
print("NO")
``` | output | 1 | 40,096 | 1 | 80,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,097 | 1 | 80,194 |
Tags: implementation
Correct Solution:
```
conf = [[int(num) for num in input().split()] for i in range(4)]
bad = False
for ind in range(4):
bad |= conf[ind][3] and (1 in conf[ind][:3] or
conf[(ind + 1) % 4][0] or
conf[(ind + 2) % 4][1] or
... | output | 1 | 40,097 | 1 | 80,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,098 | 1 | 80,196 |
Tags: implementation
Correct Solution:
```
a=[int(i)for i in input().split()]
b=[int(i)for i in input().split()]
c=[int(i)for i in input().split()]
d=[int(i)for i in input().split()]
ans=False
if a[3]:ans = c[1]or b[0] or d[2] or a[0] or a[1] or a[2]
if not ans and b[3]: ans = d[1] or c[0] or a[2] or b[0] or b[1] or b... | output | 1 | 40,098 | 1 | 80,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,099 | 1 | 80,198 |
Tags: implementation
Correct Solution:
```
import sys
A = []
for i in range(4):
s = list(map(int, input().split()))
A.append(s)
B = [A[i][3] for i in range(4)]
for i in range(4):
for j in range(3):
if A[i][j] == 1:
if j == 0:
if B[i] or B[(i - 1)%4]:
p... | output | 1 | 40,099 | 1 | 80,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,100 | 1 | 80,200 |
Tags: implementation
Correct Solution:
```
a = []
n = 4
for i in range(4):
temp = list(map(int,input().split()))
a.append(temp)
cnt = True
if a[0][3] == 1:
if a[0][0] == 1 or a[0][1] == 1 or a[0][2] == 1:
cnt = False
elif a[1][0] == 1 or a[2][1] == 1 or a[3][2] == 1:
c... | output | 1 | 40,100 | 1 | 80,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the inter... | instruction | 0 | 40,101 | 1 | 80,202 |
Tags: implementation
Correct Solution:
```
l = []
for i in range(4):
l.append(list(map(int, input().split())))
flag = False
for i in range(4):
if l[i][3] == 1:
if l[i][0] == 1 or l[i][1] == 1 or l[i][2] == 1 or l[(i+1)%4][0] == 1 or l[(i+2)%4][1] == 1 or l[(i+3)%4][2] == 1:
print("YES")
... | output | 1 | 40,101 | 1 | 80,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,102 | 1 | 80,204 |
Yes | output | 1 | 40,102 | 1 | 80,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,103 | 1 | 80,206 |
Yes | output | 1 | 40,103 | 1 | 80,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,104 | 1 | 80,208 |
Yes | output | 1 | 40,104 | 1 | 80,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,105 | 1 | 80,210 |
Yes | output | 1 | 40,105 | 1 | 80,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,106 | 1 | 80,212 |
No | output | 1 | 40,106 | 1 | 80,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,107 | 1 | 80,214 |
No | output | 1 | 40,107 | 1 | 80,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,108 | 1 | 80,216 |
No | output | 1 | 40,108 | 1 | 80,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each ... | instruction | 0 | 40,109 | 1 | 80,218 |
No | output | 1 | 40,109 | 1 | 80,219 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,247 | 1 | 80,494 |
"Correct Solution:
```
n,t=map(int,input().split())
ans=chk=10000
for i in range(n):
x,y=map(int,input().split())
if y<=t: ans=min(ans,x)
print(ans if ans<10000 else "TLE")
``` | output | 1 | 40,247 | 1 | 80,495 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,248 | 1 | 80,496 |
"Correct Solution:
```
n,t=map(int, input().split())
m=10**9
ans=m
for _ in range(n):
ci,ti=map(int, input().split())
if ti<=t:
ans=min(ans,ci)
print(ans if ans<m else "TLE")
``` | output | 1 | 40,248 | 1 | 80,497 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,249 | 1 | 80,498 |
"Correct Solution:
```
N,T=map(int,input().split())
ans=2000
for i in range(N):
c,t=map(int,input().split())
if t<=T:
ans=min(ans,c)
print(ans if ans!=2000 else "TLE")
``` | output | 1 | 40,249 | 1 | 80,499 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,250 | 1 | 80,500 |
"Correct Solution:
```
N,T=map(int, input().split())
R=[999999999]
for i in range(N):
c,t=map(int, input().split())
if T>=t:
R.append(c)
print('TLE' if len(R)==1 else min(R))
``` | output | 1 | 40,250 | 1 | 80,501 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,251 | 1 | 80,502 |
"Correct Solution:
```
N,T=map(int,input().split())
ctl=[list(map(int,input().split())) for _ in range(N)]
cl =[ct[0] for ct in ctl if ct[1]<=T]
print(min(cl) if len(cl)>0 else 'TLE')
``` | output | 1 | 40,251 | 1 | 80,503 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,252 | 1 | 80,504 |
"Correct Solution:
```
n, t = map(int,input().split())
ct = [list(map(int,input().split())) for _ in range(n)]
for c, ti in sorted(ct):
if int(ti) <= t:
print(c)
exit()
print("TLE")
``` | output | 1 | 40,252 | 1 | 80,505 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,253 | 1 | 80,506 |
"Correct Solution:
```
N,T=map(int,input().split())
lst=[]
for i in range(N):
c,t=map(int,input().split())
if t<=T:
lst.append(c)
print("TLE" if len(lst)==0 else min(lst))
``` | output | 1 | 40,253 | 1 | 80,507 |
Provide a correct Python 3 solution for this coding contest problem.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. X uses the i-th of these routes, he will get home in tim... | instruction | 0 | 40,254 | 1 | 80,508 |
"Correct Solution:
```
N, T = map(int, input().split())
mn = 1001
for i in range(N):
c,t = map(int, input().split())
if t <= T:
mn = min(c,mn)
print(mn if mn < 1001 else 'TLE')
``` | output | 1 | 40,254 | 1 | 80,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,255 | 1 | 80,510 |
Yes | output | 1 | 40,255 | 1 | 80,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,256 | 1 | 80,512 |
Yes | output | 1 | 40,256 | 1 | 80,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,257 | 1 | 80,514 |
Yes | output | 1 | 40,257 | 1 | 80,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,258 | 1 | 80,516 |
Yes | output | 1 | 40,258 | 1 | 80,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,259 | 1 | 80,518 |
No | output | 1 | 40,259 | 1 | 80,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,260 | 1 | 80,520 |
No | output | 1 | 40,260 | 1 | 80,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,261 | 1 | 80,522 |
No | output | 1 | 40,261 | 1 | 80,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.
You, the smartwatch, has found N routes to his home.
If Mr. ... | instruction | 0 | 40,262 | 1 | 80,524 |
No | output | 1 | 40,262 | 1 | 80,525 |
Provide a correct Python 3 solution for this coding contest problem.
E: Jam
problem
There are N cities in a country, numbered 1, \ 2, \ ..., \ N. These cities are connected in both directions by M roads, and the i-th road allows you to travel between the cities u_i and v_i in time t_i. Also, any two cities can be re... | instruction | 0 | 40,402 | 1 | 80,804 |
"Correct Solution:
```
import sys
from heapq import heappop as hpp, heappush as hp
def dijkstra(N, s, Edge):
inf = 10**18
dist = [inf] * N
Q = [(0, s)]
decided = set()
for _ in range(N):
while True:
dn, vn = hpp(Q)
if vn not in decided:
decided.add(vn)... | output | 1 | 40,402 | 1 | 80,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Codefortia is a small island country located somewhere in the West Pacific. It consists of n settlements connected by m bidirectional gravel roads. Curiously enough, the beliefs of the inhabitants require the time needed to pass each road to... | instruction | 0 | 40,458 | 1 | 80,916 |
Tags: brute force, dp, graphs, greedy
Correct Solution:
```
import heapq
n,m,a,b=map(int,input().split())
graph={i:[] for i in range(n)}
for i in range(m):
u,v,w=map(int,input().split())
graph[u-1].append((v-1,w))
graph[v-1].append((u-1,w))
components=[-1]*n
comp=-1
for i in range(n):
if components[i]==... | output | 1 | 40,458 | 1 | 80,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Codefortia is a small island country located somewhere in the West Pacific. It consists of n settlements connected by m bidirectional gravel roads. Curiously enough, the beliefs of the inhabitan... | instruction | 0 | 40,459 | 1 | 80,918 |
No | output | 1 | 40,459 | 1 | 80,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Codefortia is a small island country located somewhere in the West Pacific. It consists of n settlements connected by m bidirectional gravel roads. Curiously enough, the beliefs of the inhabitan... | instruction | 0 | 40,460 | 1 | 80,920 |
No | output | 1 | 40,460 | 1 | 80,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Codefortia is a small island country located somewhere in the West Pacific. It consists of n settlements connected by m bidirectional gravel roads. Curiously enough, the beliefs of the inhabitan... | instruction | 0 | 40,461 | 1 | 80,922 |
No | output | 1 | 40,461 | 1 | 80,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Codefortia is a small island country located somewhere in the West Pacific. It consists of n settlements connected by m bidirectional gravel roads. Curiously enough, the beliefs of the inhabitan... | instruction | 0 | 40,462 | 1 | 80,924 |
No | output | 1 | 40,462 | 1 | 80,925 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,103 | 1 | 82,206 |
"Correct Solution:
```
while 1:
try:
tmplist = list(map(int, input().split(",")))
except:
break
lengthlist = tmplist[:10]
v1 = tmplist[10]
v2 = tmplist[11]
lsum = sum(lengthlist)
time = lsum / (v1 + v2)
spot = time * v1
le = 0
for i, l in enumerate(lengthlist):... | output | 1 | 41,103 | 1 | 82,207 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,104 | 1 | 82,208 |
"Correct Solution:
```
import sys
for s in sys.stdin:
data = list(map(int, s.split(',')))
dis = data[:10]
v1, v2 = data[10], data[11]
for i in range(1, len(dis)):
dis[i] += dis[i-1]
time = dis[-1] / (v1+v2)
meetDis = v1 * time
for i in range(len(dis)):
if dis[i] >= meetDis:
print(i+1)
break
``` | output | 1 | 41,104 | 1 | 82,209 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,105 | 1 | 82,210 |
"Correct Solution:
```
while 1:
try:
l=list(map(int,input().split(",")))
v1=l[10]
suml=sum(l[:10])
sumv=sum(l[10:12])
time=suml/sumv
point=time*v1
ans=1
for i in l[:10]:
if point<=i:break
else:
point-=i
... | output | 1 | 41,105 | 1 | 82,211 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,106 | 1 | 82,212 |
"Correct Solution:
```
while True:
try:
dis = 0
kyori = []
Data = list(map(int,input().split(",")))
for i in range(10):
dis += Data[i]
kyori.append(dis)
Ad = dis * Data[10] / (Data[10] + Data[11])
for j in range(9):
if kyori[j] < Ad... | output | 1 | 41,106 | 1 | 82,213 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,107 | 1 | 82,214 |
"Correct Solution:
```
import sys
for line in sys.stdin:
l = list(map(int, line.split(",")))
total_length = sum(l[:-2])
a_v = l[-2]
b_v = l[-1]
crosspointtime = total_length / (a_v + b_v)
crosspoint = crosspointtime * a_v
ans = 0
for i, length in enumerate(l[:-2]):
ans += length... | output | 1 | 41,107 | 1 | 82,215 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,108 | 1 | 82,216 |
"Correct Solution:
```
while True:
try:
inp = list(map(int, input().split(",")))
l = inp[0:10]
l_all = sum(l)
v1 = inp[10]
v2 = inp[11]
l_pass = l_all*v1/(v1 + v2)
for i in range(11):
if sum(l[:i]) >= l_pass:
print(i)
... | output | 1 | 41,108 | 1 | 82,217 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,109 | 1 | 82,218 |
"Correct Solution:
```
import sys
for row in sys.stdin:
row = row.strip().split(',')
ls = list(map(int, row[:-2]))
v1 = int(row[-2])
v2 = int(row[-1])
p = sum(ls) * v1 / (v1+v2)
s = 0
for i, l in enumerate(list(ls)):
s += l
if s>=p:
print(i+1)
break
... | output | 1 | 41,109 | 1 | 82,219 |
Provide a correct Python 3 solution for this coding contest problem.
There is a double-track line (up and down are separate lines and pass each other everywhere). There are 11 stations on this line, including the terminal station, and each station is called by the section number shown in the figure.
<image>
Trains ... | instruction | 0 | 41,110 | 1 | 82,220 |
"Correct Solution:
```
while True:
try:
l = list(map(int, input().split(",")))
except:
break
sum_l = sum(l[:10])
M = sum_l*l[10]/(l[10] + l[11])
for i in range(10):
M -= l[i]
if M <= 0:
print(i+1)
break
``` | output | 1 | 41,110 | 1 | 82,221 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.