message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,199 | 17 | 142,398 |
No | output | 1 | 71,199 | 17 | 142,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,200 | 17 | 142,400 |
No | output | 1 | 71,200 | 17 | 142,401 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,511 | 17 | 143,022 |
"Correct Solution:
```
# AOJ 0211: Jogging
# Python3 2018.6.25 bal4u
def lcm(a, b):
return a // gcd(a, b) * b
def gcd(a, b):
while b != 0:
r = a % b
a, b = b, r
return a
def ngcd(n, a): # aが整数のリスト
if n == 1: return a[0]
g = gcd(a[0], a[1]);
for i in range(2, n):
if g == 1: break
g = gcd(g, a[i])
retu... | output | 1 | 71,511 | 17 | 143,023 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,512 | 17 | 143,024 |
"Correct Solution:
```
from fractions import gcd
from functools import reduce
from sys import stdin
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
while(True):
n = int(stdin.readline())... | output | 1 | 71,512 | 17 | 143,025 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,513 | 17 | 143,026 |
"Correct Solution:
```
from sys import stdin
readline = stdin.readline
from fractions import Fraction
from fractions import gcd
from functools import reduce
from collections import namedtuple
Runner = namedtuple('Runner', 'd v')
def common_denominator(r0, ri):
return Fraction(r0.d * ri.v, r0.v * ri.d).denominat... | output | 1 | 71,513 | 17 | 143,027 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,514 | 17 | 143,028 |
"Correct Solution:
```
def GCD(a,b):
if min(a,b)==0:
return max(a,b)
else:
return GCD(min(a,b),max(a,b)%min(a,b))
def _LCM(a,b):
return a*b//GCD(a,b)
def LCM(array):
lcm=1
for i in array:
lcm=_LCM(lcm,i)
return lcm
while True:
n=int(input())
if n==0:
br... | output | 1 | 71,514 | 17 | 143,029 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,515 | 17 | 143,030 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Jogging
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0211
"""
import sys
from math import gcd
from functools import reduce
def solve(n, data):
res = []
for i in range(n):
t = 1
for j in range(n):
t *= (data[j][0], data[... | output | 1 | 71,515 | 17 | 143,031 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,516 | 17 | 143,032 |
"Correct Solution:
```
from fractions import gcd
from functools import reduce
from sys import stdin
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
while(True):
n = int(stdin.readline())
if not n: break
s = [list(map(int,stdin.readline().... | output | 1 | 71,516 | 17 | 143,033 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,517 | 17 | 143,034 |
"Correct Solution:
```
from math import gcd
from functools import reduce
def gcd_mul(numbers):
return reduce(gcd, numbers)
def lcm(x, y):
return x * y // gcd(x, y)
def lcm_mul(numbers):
return reduce(lcm, numbers)
def solve():
from sys import stdin
file_input = stdin
from operator impor... | output | 1 | 71,517 | 17 | 143,035 |
Provide a correct Python 3 solution for this coding contest problem.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will be returned to elementary school. How many laps do they ... | instruction | 0 | 71,518 | 17 | 143,036 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def lcm(a, b):
return (a // gcd(a, b)) * b
while True:
n = int(input())
if n == 0:
break
students = [0] * n
v_... | output | 1 | 71,518 | 17 | 143,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will ... | instruction | 0 | 71,519 | 17 | 143,038 |
Yes | output | 1 | 71,519 | 17 | 143,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will ... | instruction | 0 | 71,520 | 17 | 143,040 |
No | output | 1 | 71,520 | 17 | 143,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will ... | instruction | 0 | 71,521 | 17 | 143,042 |
No | output | 1 | 71,521 | 17 | 143,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will ... | instruction | 0 | 71,522 | 17 | 143,044 |
No | output | 1 | 71,522 | 17 | 143,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At Akabeko Elementary School, all the students participate in a slightly unusual jogging. Students run their own lap courses at their own pace. After going around each of your courses, you will ... | instruction | 0 | 71,523 | 17 | 143,046 |
No | output | 1 | 71,523 | 17 | 143,047 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Alice and Bob are competing in the 50m dash.
However, in this world, the higher the AOJ rate is, the better, so the higher the AOJ rate wins.
If there is no AOJ rate on either side, there is no comparison, so there is no choice but to compet... | instruction | 0 | 71,590 | 17 | 143,180 |
"Correct Solution:
```
t1, t2, r1, r2 = map(int, input().split())
if r1 != -1 and r2 != -1 :
if r1 > r2 :
print("Alice")
elif r1 < r2 :
print("Bob")
else :
print("Draw")
else :
if t1 < t2 :
print("Alice")
elif t1 > t2 :
print("Bob")
else :
print("D... | output | 1 | 71,590 | 17 | 143,181 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Alice and Bob are competing in the 50m dash.
However, in this world, the higher the AOJ rate is, the better, so the higher the AOJ rate wins.
If there is no AOJ rate on either side, there is no comparison, so there is no choice but to compet... | instruction | 0 | 71,591 | 17 | 143,182 |
"Correct Solution:
```
T1, T2, R1, R2 = map(int, input().split())
if -1 in [R1, R2]:
if T1<T2:
print("Alice")
elif T1>T2:
print("Bob")
else:
print("Draw")
else:
if R1 > R2:
print("Alice")
elif R1 < R2:
print("Bob")
else:
print("Draw")
``` | output | 1 | 71,591 | 17 | 143,183 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Alice and Bob are competing in the 50m dash.
However, in this world, the higher the AOJ rate is, the better, so the higher the AOJ rate wins.
If there is no AOJ rate on either side, there is no comparison, so there is no choice but to compet... | instruction | 0 | 71,592 | 17 | 143,184 |
"Correct Solution:
```
t1,t2,r1,r2 = map(int,input().split())
if r1 == -1 or r2 == -1:
if t1 < t2:
print('Alice')
elif t1 > t2:
print('Bob')
else:
print('Draw')
elif r1 > r2:
print('Alice')
elif r1 < r2:
print('Bob')
else:
print('Draw')
``` | output | 1 | 71,592 | 17 | 143,185 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Alice and Bob are competing in the 50m dash.
However, in this world, the higher the AOJ rate is, the better, so the higher the AOJ rate wins.
If there is no AOJ rate on either side, there is no comparison, so there is no choice but to compet... | instruction | 0 | 71,593 | 17 | 143,186 |
"Correct Solution:
```
a,b,c,d = map(int,input().split())
def A_win():
print("Alice")
def B_win():
print("Bob")
def Draw():
print("Draw")
if c == -1 or d == -1:
if a < b:
A_win()
elif a > b:
B_win()
else:
Draw()
elif c > d:
A_win()
elif c < d:
B_win()
elif c == d:... | output | 1 | 71,593 | 17 | 143,187 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Alice and Bob are competing in the 50m dash.
However, in this world, the higher the AOJ rate is, the better, so the higher the AOJ rate wins.
If there is no AOJ rate on either side, there is no comparison, so there is no choice but to compet... | instruction | 0 | 71,595 | 17 | 143,190 |
"Correct Solution:
```
t1,t2,r1,r2 = [ int(s) for s in input().split() ]
if r1 == -1 or r2 == -1:
if t1 < t2:
print('Alice')
elif t1 > t2:
print('Bob')
else:
print('Draw')
else:
if r1 > r2:
print('Alice')
elif r1 < r2:
print('Bob')
else:
print('... | output | 1 | 71,595 | 17 | 143,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,770 | 17 | 143,540 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
t=int(input())
for i in range(t):
n=int(input())
s=set()
f=[]
for j in range(1,int(n**0.5)+1):
d=n//j
e=n//(n//j)
if d not in s:
s.add(d)
f.append(d)
if e not in s:
... | output | 1 | 71,770 | 17 | 143,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,771 | 17 | 143,542 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
t=int(input())
for i in range(0,t):
n=int(input())
L=[0,1]
if(n==1):
print(2)
print(*L)
else:
y=int(n**0.5)
L=[i for i in range(y+1)]
for i in range(y+1,0,-1):
x=n//i
if(L[-1]<x):
L.append(x)
print(len... | output | 1 | 71,771 | 17 | 143,543 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,772 | 17 | 143,544 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
ans=[]
i=1
while i<n:
if len(ans)!=0:
if ans[-1]==n//i:
break
ans.append(n//i)
i+=1
if len(ans)==0:
print(2)
... | output | 1 | 71,772 | 17 | 143,545 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,773 | 17 | 143,546 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
aa=set()
aa.add(0)
for i in range(1,int(n**0.5)+1):
aa.add(n//i)
aa.add(i)
print(len(aa))
print(*sorted(aa))
``` | output | 1 | 71,773 | 17 | 143,547 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,774 | 17 | 143,548 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
l = [n]
test = 2
while n//test != l[-1]:
l.append(n//test)
test += 1
while l[-1] != 0:
l.append(l[-1] - 1)
print(len(l))
... | output | 1 | 71,774 | 17 | 143,549 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,775 | 17 | 143,550 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
import math
def main():
t = int(input())
for i in range(t):
n = int(input())
c = int(math.sqrt(n)) + 10
result = set()
for i in range(1, c):
result.add(n // i)
c = n // (c - 1)... | output | 1 | 71,775 | 17 | 143,551 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the well-known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according to the following algorithm: if k participants take part in this event, then the n rating is evenly distributed betwee... | instruction | 0 | 71,777 | 17 | 143,554 |
Tags: binary search, math, meet-in-the-middle, number theory
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
lst = [0]
for j in range(1,n+1):
tmp = int(n//j)
lst.append(tmp)
if tmp*tmp <= n:
# print(tmp)
for k in range(tmp+2):
... | output | 1 | 71,777 | 17 | 143,555 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,899 | 17 | 143,798 |
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split())
l=[]
for i in range(n):
p=list(map(int,list(input())))
l.append(p)
q=[]
for i in range(m):
x=[l[k][i] for k in range(n)]
r=max(x)
q.append(r)
k=0
for i in range(n):
if any(l[i][j]==q[j] for j in range(m)):
k+=1
pr... | output | 1 | 71,899 | 17 | 143,799 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,900 | 17 | 143,800 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
count = 0
b = [0]*101
c = list()
for i in range(n):
s = input()
c.append(s)
for i in range(m):
if int(s[i])>=b[i]:
b[i]=int(s[i])
for i in range(n):
for j in range(m):
if int(c[i][j])==b[j]:
count+=1
break
print(count)
``` | output | 1 | 71,900 | 17 | 143,801 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,901 | 17 | 143,802 |
Tags: implementation
Correct Solution:
```
"""Things to do if you are stuck:-
1.Read the problem statement again, maybe you've read something wrong.
2.See the explanation for the sample input .
3.If the solution is getting too complex in cases where no. of submissions
are high ,then drop that idea because there is s... | output | 1 | 71,901 | 17 | 143,803 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,902 | 17 | 143,804 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
a = [input() for i in range(n)]
sel = [0] * n
for j in range(m):
mx = '1'
for i in range(n):
if a[i][j] > mx:
mx = a[i][j]
for i in range(n):
if a[i][j] == mx:
sel[i] = 1
print(sum(sel))
``` | output | 1 | 71,902 | 17 | 143,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,903 | 17 | 143,806 |
Tags: implementation
Correct Solution:
```
n,m=list(map(int,input().split()))
l=[]
count=0
for i in range(n):
l.append(input())
final=[]
for i in range(m):
f=[]
for j in l:
f.append(int(j[i]))
r=max(f)
for k in range(n):
if r==f[k] and k+1 not in final:
count+=1
... | output | 1 | 71,903 | 17 | 143,807 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,904 | 17 | 143,808 |
Tags: implementation
Correct Solution:
```
# Description of the problem can be found at http://codeforces.com/problemset/problem/152/A
n, m = map(int, input().split())
d_s = {}
l_s = list(set() for _ in range(m))
for i in range(n):
s = input()
for j in range(m):
if j not in d_s:
d_s[... | output | 1 | 71,904 | 17 | 143,809 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,905 | 17 | 143,810 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
maxes = [[0] for i in range(m)]
ss = []
def set_max(s: str):
ss.append(s)
for i in range(m):
if maxes[i][0] < int(s[i]):
maxes[i][0] = int(s[i])
for i in range(n):
set_max(input())
count, jj = 0, []
for i in range(m):
for j in ran... | output | 1 | 71,905 | 17 | 143,811 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received marks for m subjects. Each student got a mark from ... | instruction | 0 | 71,906 | 17 | 143,812 |
Tags: implementation
Correct Solution:
```
import sys
n,m,*l = sys.stdin.read().split()
n = int(n)
m = int(m)
g = []
st = 0
for s in l:
sb = 0
for c in s:
if st == 0:
g.append([])
g[sb].append(int(c))
sb +=1
st += 1
best = [0] * n
for sb in range(m):
mx = max(g[s... | output | 1 | 71,906 | 17 | 143,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,907 | 17 | 143,814 |
Yes | output | 1 | 71,907 | 17 | 143,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,908 | 17 | 143,816 |
Yes | output | 1 | 71,908 | 17 | 143,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,909 | 17 | 143,818 |
Yes | output | 1 | 71,909 | 17 | 143,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,910 | 17 | 143,820 |
Yes | output | 1 | 71,910 | 17 | 143,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,911 | 17 | 143,822 |
No | output | 1 | 71,911 | 17 | 143,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,912 | 17 | 143,824 |
No | output | 1 | 71,912 | 17 | 143,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,913 | 17 | 143,826 |
No | output | 1 | 71,913 | 17 | 143,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya, or Mr. Vasily Petrov is a dean of a department in a local university. After the winter exams he got his hands on a group's gradebook.
Overall the group has n students. They received mark... | instruction | 0 | 71,914 | 17 | 143,828 |
No | output | 1 | 71,914 | 17 | 143,829 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,404 | 17 | 144,808 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
import os
import math
for s in sys.stdin:
a, b = map(float, s.split())
if a < 35.5 and b < 71:
print('AAA')
elif a < 37.5 and b < 77:
print('AA')
elif a < 40 and b < 83:
print('A')
elif a < 43 and b < 89:
pr... | output | 1 | 72,404 | 17 | 144,809 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,405 | 17 | 144,810 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0123
"""
import sys
def solve(r500, r1000):
criteria = [(35.50, 71.0, 'AAA'),
(37.50, 77.0, 'AA'),
(40.0, 83.0, 'A'),
(43.0, 89.0, 'B'),
... | output | 1 | 72,405 | 17 | 144,811 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,406 | 17 | 144,812 |
"Correct Solution:
```
def get_input():
while True:
try:
yield ''.join(input())
except EOFError:
break
N = list(get_input())
for l in range(len(N)):
t1, t2 = [float(i) for i in N[l].split()]
if t1 < 35.5 and t2 < 71.0:
print("AAA")
elif t1 < 37.5 and t2 ... | output | 1 | 72,406 | 17 | 144,813 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,407 | 17 | 144,814 |
"Correct Solution:
```
# Aizu Problem 00123: Speed Skating Badge Test
#
import sys, math, os, copy
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
grades = ["AAA", "AA", "A", "B", "C", "D", "E", "NA"]
limits = [[35.5, 71], [37.5, 77], [40, 83], [43, 89],... | output | 1 | 72,407 | 17 | 144,815 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,408 | 17 | 144,816 |
"Correct Solution:
```
while True:
try:
t1, t2 = map(float, input().split())
except:
break
t1, t2 = int(t1*100), int(t2*100)
if t1 < 3550 and t2 < 7100:
print("AAA")
elif t1 < 3750 and t2 < 7700:
print("AA")
elif t1 < 4000 and t2 < 8300:
print("A")
eli... | output | 1 | 72,408 | 17 | 144,817 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,409 | 17 | 144,818 |
"Correct Solution:
```
# AOJ 0123 Speed Skating Badge Test
# Python3 2018.6.18 bal4u
m500 = [ 35.5, 37.5, 40.0, 43.0, 50.0, 55.0, 70.0, 1000.0 ]
m1000 = [ 71.0, 77.0, 83.0, 89.0, 105.0, 116.0, 148.0, 1000.0 ]
clas = [ "AAA", "AA", "A", "B", "C", "D", "E", "NA" ]
while True:
try: t500, t1000 = list(map(float, input()... | output | 1 | 72,409 | 17 | 144,819 |
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,410 | 17 | 144,820 |
"Correct Solution:
```
import sys
for line in sys.stdin:
[p, q] = line.split();
a = float(p);
b = float(q);
if (a < 35.5) & (b < 71.0):
print('AAA');
elif (a < 37.5) & (b < 77.0):
print('AA');
elif (a < 40.0) & (b < 83.0):
print('A');
elif (a < 43.0) & (b < 89.0):
print('B');
elif (a < 50.0) & (b < 1... | output | 1 | 72,410 | 17 | 144,821 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.