message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 276 109k | cluster float64 23 23 | __index_level_0__ int64 552 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,306 | 23 | 6,612 |
Yes | output | 1 | 3,306 | 23 | 6,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,307 | 23 | 6,614 |
Yes | output | 1 | 3,307 | 23 | 6,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,308 | 23 | 6,616 |
Yes | output | 1 | 3,308 | 23 | 6,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,309 | 23 | 6,618 |
No | output | 1 | 3,309 | 23 | 6,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,310 | 23 | 6,620 |
No | output | 1 | 3,310 | 23 | 6,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,311 | 23 | 6,622 |
No | output | 1 | 3,311 | 23 | 6,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.
g is represented by a sequence of points p1, p2,..., pn where line segments c... | instruction | 0 | 3,312 | 23 | 6,624 |
No | output | 1 | 3,312 | 23 | 6,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,343 | 23 | 6,686 |
Tags: greedy
Correct Solution:
```
import atexit
import io
import sys
_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER
@atexit.register
def write():
sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
from collection... | output | 1 | 3,343 | 23 | 6,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,344 | 23 | 6,688 |
Tags: greedy
Correct Solution:
```
import sys
T = int(sys.stdin.readline().rstrip())
for i in range(T):
n = int(sys.stdin.readline().rstrip())
a = list(map(int, sys.stdin.readline().rstrip().split()))
rec = []
a = sorted(a)
k = 0
while k < n - 1:
if a[k] == a[k + 1]:
rec.appe... | output | 1 | 3,344 | 23 | 6,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,345 | 23 | 6,690 |
Tags: greedy
Correct Solution:
```
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
t = int(input())
for case in range(t):
n = int(input())
a = list(map(int, input().split()))
a.sort()
tmp = 10 ** 4 # INF
ans = 10 ** 9
i = 0
r... | output | 1 | 3,345 | 23 | 6,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,346 | 23 | 6,692 |
Tags: greedy
Correct Solution:
```
ans=[]
def main():
t=int(input())
for l in range(t):
n=int(input())
if n==4:
ans.append(input())
else:
b=y=num=x=0
d=10**10
for i... | output | 1 | 3,346 | 23 | 6,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,347 | 23 | 6,694 |
Tags: greedy
Correct Solution:
```
###### ### ####### ####### ## # ##### ### #####
# # # # # # # # # # # # # ###
# # # # # # # # # # # # # ###
###### ######### # ... | output | 1 | 3,347 | 23 | 6,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,348 | 23 | 6,696 |
Tags: greedy
Correct Solution:
```
from sys import stdout, stdin
def read():
return stdin.readline().rstrip('\n')
def f(a, b):
return a / b + b / a
results = []
for _ in range(int(read())):
read()
arr = sorted(map(int, read().split()))
i = 0
len_arr_minus_one = len(arr) - 1
prev_el, ne... | output | 1 | 3,348 | 23 | 6,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,349 | 23 | 6,698 |
Tags: greedy
Correct Solution:
```
from sys import stdout, stdin
import collections
def read():
return stdin.readline().rstrip('\n')
def read_array(sep=None, maxsplit=-1):
return read().split(sep, maxsplit)
def read_int():
return int(read())
def read_int_array(sep=None, maxsplit=-1):
return [int... | output | 1 | 3,349 | 23 | 6,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be c... | instruction | 0 | 3,350 | 23 | 6,700 |
Tags: greedy
Correct Solution:
```
import sys
from collections import *
l=sys.stdin.readlines()[2::2]
r=[]
for a in l:
a=Counter(map(int,a.split()))
s=sorted([k for k in a if a[k]>1]+[k for k in a if a[k]>3])
r+=['%d %d '%min(zip(s,s[1:]),key=lambda a:sum(a)**2/a[0]/a[1])*2]
print(*r)
``` | output | 1 | 3,350 | 23 | 6,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,351 | 23 | 6,702 |
Yes | output | 1 | 3,351 | 23 | 6,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,352 | 23 | 6,704 |
Yes | output | 1 | 3,352 | 23 | 6,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,353 | 23 | 6,706 |
Yes | output | 1 | 3,353 | 23 | 6,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,354 | 23 | 6,708 |
Yes | output | 1 | 3,354 | 23 | 6,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,355 | 23 | 6,710 |
No | output | 1 | 3,355 | 23 | 6,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,356 | 23 | 6,712 |
No | output | 1 | 3,356 | 23 | 6,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,357 | 23 | 6,714 |
No | output | 1 | 3,357 | 23 | 6,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n sticks of the given lengths.
Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must... | instruction | 0 | 3,358 | 23 | 6,716 |
No | output | 1 | 3,358 | 23 | 6,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. Now he's drawing camels with t humps, representing them as polylines in the plane. Each polyline consists... | instruction | 0 | 3,613 | 23 | 7,226 |
Tags: dp
Correct Solution:
```
n,t = map(int,input().split())
dp = [[[[0,0] for i in range(t+1)] for j in range(5)] for k in range(n+1)]
dp[2][2][1][0]=1
dp[2][3][1][0]=2
dp[2][4][1][0]=3
ans = 0
for i in range(3,n+1):
for j in range(1,5):
for k in range(1,t+1):
for l in range(1,j):
dp[i][j][k][0]+=dp[i-1... | output | 1 | 3,613 | 23 | 7,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. Now he's drawing camels with t humps, representing them as polylines in the plane. Each polyline consists... | instruction | 0 | 3,614 | 23 | 7,228 |
Tags: dp
Correct Solution:
```
__author__ = 'Darren'
def solve():
def find_ways(t, n, h):
if t == breaks and n == total:
return 1
if t > breaks or n == total:
return 0
if (t, n, h) not in dp:
result = 0
if t % 2 == 0:
for i i... | output | 1 | 3,614 | 23 | 7,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. Now he's drawing camels with t humps, representing them as polylines in the plane. Each polyline consists... | instruction | 0 | 3,615 | 23 | 7,230 |
Tags: dp
Correct Solution:
```
n,t=map(int,input().split())
t=2*t-1
dp=[[[[0,0] for h in range(5)] for j in range(t+2)] for i in range(n+1)]
for h in range(1,5):
dp[2][0][h][0]=4-h
dp[2][0][h][1] = h-1
for i in range(2,n):
for j in range(t+1):
for h in range(1,5):
for ne in range(1,5):
... | output | 1 | 3,615 | 23 | 7,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. Now he's drawing camels with t humps, representing them as polylines in the plane. Each polyline consists... | instruction | 0 | 3,616 | 23 | 7,232 |
Tags: dp
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n, t = map(int, input().split())
dp = [[[0] * 5 for _ in range(2 * t + 1)] for _ in range(n)]
dp[0][0] = [0] + [1] * 4
for i in range(n - 1):
for j in range(min(2... | output | 1 | 3,616 | 23 | 7,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. Now he's drawing camels with t humps, representing them as... | instruction | 0 | 3,617 | 23 | 7,234 |
No | output | 1 | 3,617 | 23 | 7,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. Now he's drawing camels with t humps, representing them as... | instruction | 0 | 3,618 | 23 | 7,236 |
No | output | 1 | 3,618 | 23 | 7,237 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,980 | 23 | 7,960 |
"Correct Solution:
```
# 2点 or 3点
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
def 外心(p1,p2,p3):
# https://qiita.com/tatesuke/items/59133758ec25146766c3
a,b = p1
c,d = p2
e,f = p3
aa = a * a
bb = b * b
cc = c * c
dd = d * d
ee = e * e
ff = f * f
... | output | 1 | 3,980 | 23 | 7,961 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,981 | 23 | 7,962 |
"Correct Solution:
```
n=int(input())
def bai(x):
return int(x)*2.0
xy=[list(map(bai, input().split())) for _ in range(n)]
#nは50だから4重ループでも間に合う？
#2500*2500
if n==2:
print((((xy[0][0]-xy[1][0])**2 +(xy[0][1]-xy[1][1])**2) **0.5)*0.5*0.5)
exit()
ans=10**9
def gaishin(a,b,c,d,e,f):
if (a-c)*(d-f)==(c-... | output | 1 | 3,981 | 23 | 7,963 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,982 | 23 | 7,964 |
"Correct Solution:
```
import sys
import cmath
from itertools import combinations
inf = float('inf')
n, *xy = map(int, sys.stdin.read().split())
xy = zip(*[iter(xy)] * 2)
z = [x + y*1j for x, y in xy]
def circumcenter(z1, z2, z3):
a = z2 - z1
b = z3 - z1
numerator = a * b * (b.conjugate() - a.conjugate()... | output | 1 | 3,982 | 23 | 7,965 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,983 | 23 | 7,966 |
"Correct Solution:
```
from math import sqrt
N=int(input())
XY=[tuple(map(int,input().split())) for _ in range(N)]
def calc(r):
lst=[]
for i in range(N-1):
x1=XY[i][0]
y1=XY[i][1]
for j in range(i+1,N):
x2=XY[j][0]
y2=XY[j][1]
diff=sqrt((x1-x2)**2+(y1-y2)**2)
if diff>2*r:
... | output | 1 | 3,983 | 23 | 7,967 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,984 | 23 | 7,968 |
"Correct Solution:
```
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import ... | output | 1 | 3,984 | 23 | 7,969 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,985 | 23 | 7,970 |
"Correct Solution:
```
n = int(input())
l = [[0, 0] for _ in range(n)]
for i in range(n):
x, y = map(int, input().split())
l[i][0] = x
l[i][1] = y
import math
if n == 2:
r = math.sqrt((l[1][0]-l[0][0])**2+(l[1][1]-l[0][1])**2)/2
print(r)
exit()
ans = float('inf')
import itertools
combs = list(itertools.co... | output | 1 | 3,985 | 23 | 7,971 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,986 | 23 | 7,972 |
"Correct Solution:
```
def min_disc(points):
from random import sample
N = len(points)
if N == 1:
return points[0], 0
points = sample(points, N)
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def norm2(a):
return a.real * a.real + a.imag * a.imag
def make_c... | output | 1 | 3,986 | 23 | 7,973 |
Provide a correct Python 3 solution for this coding contest problem.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all d... | instruction | 0 | 3,987 | 23 | 7,974 |
"Correct Solution:
```
from math import sqrt
N = int(input())
THRE = 0.0000001
ps = []
for _ in range(N):
x, y = map(int, input().split())
ps.append((x,y))
# 2点を直径とする円の中心と半径を求める
def circleThrough2Points(x1, y1, x2, y2):
if x1 == x2 and y1 == y2:
return None, None, None
px = (x1 + x2) / 2
p... | output | 1 | 3,987 | 23 | 7,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,988 | 23 | 7,976 |
Yes | output | 1 | 3,988 | 23 | 7,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,989 | 23 | 7,978 |
Yes | output | 1 | 3,989 | 23 | 7,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,990 | 23 | 7,980 |
Yes | output | 1 | 3,990 | 23 | 7,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,991 | 23 | 7,982 |
Yes | output | 1 | 3,991 | 23 | 7,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,992 | 23 | 7,984 |
No | output | 1 | 3,992 | 23 | 7,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,993 | 23 | 7,986 |
No | output | 1 | 3,993 | 23 | 7,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,994 | 23 | 7,988 |
No | output | 1 | 3,994 | 23 | 7,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are N points (x_i, y_i) in a two-dimensional plane.
Find the minimum radius of a circle such that all the points are inside or on it.
Constraints
* 2 \leq N \leq 50
* 0 \leq x_i \leq 10... | instruction | 0 | 3,995 | 23 | 7,990 |
No | output | 1 | 3,995 | 23 | 7,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the Indian Puzzle, one is intended to fill out blanks with numbers and operators in a n by n grid in order to make equalities in the grid true (See Figure 1).
<image>
Figure 1
A blank ... | instruction | 0 | 4,110 | 23 | 8,220 |
No | output | 1 | 4,110 | 23 | 8,221 |
Provide a correct Python 3 solution for this coding contest problem.
For given $N$ points in the 2D Euclidean plane, find the distance of the shortest tour that meets the following criteria:
* Visit the points according to the following steps:
1. It starts from the leftmost point (starting point), goes strictly from ... | instruction | 0 | 4,133 | 23 | 8,266 |
"Correct Solution:
```
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
# import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 ... | output | 1 | 4,133 | 23 | 8,267 |
Provide a correct Python 3 solution for this coding contest problem.
For given $N$ points in the 2D Euclidean plane, find the distance of the shortest tour that meets the following criteria:
* Visit the points according to the following steps:
1. It starts from the leftmost point (starting point), goes strictly from ... | instruction | 0 | 4,134 | 23 | 8,268 |
"Correct Solution:
```
import sys
from math import sqrt
readline = sys.stdin.readline
write = sys.stdout.write
N = int(readline())
PS = [list(map(int, readline().split())) for i in range(N)]
PS.sort()
def dist(P, Q):
return sqrt((P[0] - Q[0])**2 + (P[1] - Q[1])**2)
INF = 10**18
S = [INF]*N; T = [INF]*N
S[0] = T... | output | 1 | 4,134 | 23 | 8,269 |
Provide a correct Python 3 solution for this coding contest problem.
For given $N$ points in the 2D Euclidean plane, find the distance of the shortest tour that meets the following criteria:
* Visit the points according to the following steps:
1. It starts from the leftmost point (starting point), goes strictly from ... | instruction | 0 | 4,135 | 23 | 8,270 |
"Correct Solution:
```
import math
from typing import List, Tuple
def dist(p1: Tuple[int, int], p2: Tuple[int, int]) -> float:
return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)
if __name__ == "__main__":
N = int(input())
points: List[Tuple[int, int]] = [(0, 0)] * N
for idx in range(N):
... | output | 1 | 4,135 | 23 | 8,271 |
Provide a correct Python 3 solution for this coding contest problem.
For given $N$ points in the 2D Euclidean plane, find the distance of the shortest tour that meets the following criteria:
* Visit the points according to the following steps:
1. It starts from the leftmost point (starting point), goes strictly from ... | instruction | 0 | 4,136 | 23 | 8,272 |
"Correct Solution:
```
import math
pts = []
line = input()
N = int(line)
for _ in range(0, N):
line = input()
x, y = list(map(int, line.split()))
pts += [[x, y]]
def dist(i, j):
x1, y1 = pts[i]
x2, y2 = pts[j]
return math.sqrt((x1 - x2)**2 + (y1 - y2)**2)
def btsp():
dp = [ [0] * N fo... | output | 1 | 4,136 | 23 | 8,273 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.