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 given two segments s1 and s2, print the coordinate of the cross point of them.
s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and p3.
Constraints
* 1 ≤ q ≤ 1000
*... | instruction | 0 | 96,929 | 23 | 193,858 |
No | output | 1 | 96,929 | 23 | 193,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given two segments s1 and s2, print the coordinate of the cross point of them.
s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and p3.
Constraints
* 1 ≤ q ≤ 1000
*... | instruction | 0 | 96,930 | 23 | 193,860 |
No | output | 1 | 96,930 | 23 | 193,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given two segments s1 and s2, print the coordinate of the cross point of them.
s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and p3.
Constraints
* 1 ≤ q ≤ 1000
*... | instruction | 0 | 96,931 | 23 | 193,862 |
No | output | 1 | 96,931 | 23 | 193,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given two segments s1 and s2, print the coordinate of the cross point of them.
s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and p3.
Constraints
* 1 ≤ q ≤ 1000
*... | instruction | 0 | 96,932 | 23 | 193,864 |
No | output | 1 | 96,932 | 23 | 193,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a of n points in k-dimensional space. Let the distance between two points a_x and a_y be ∑ _{i = 1}^{k} |a_{x, i} - a_{y, i}| (it is also known as Manhattan distance).
Yo... | instruction | 0 | 96,972 | 23 | 193,944 |
No | output | 1 | 96,972 | 23 | 193,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a of n points in k-dimensional space. Let the distance between two points a_x and a_y be ∑ _{i = 1}^{k} |a_{x, i} - a_{y, i}| (it is also known as Manhattan distance).
Yo... | instruction | 0 | 96,973 | 23 | 193,946 |
No | output | 1 | 96,973 | 23 | 193,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a of n points in k-dimensional space. Let the distance between two points a_x and a_y be ∑ _{i = 1}^{k} |a_{x, i} - a_{y, i}| (it is also known as Manhattan distance).
Yo... | instruction | 0 | 96,974 | 23 | 193,948 |
No | output | 1 | 96,974 | 23 | 193,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a of n points in k-dimensional space. Let the distance between two points a_x and a_y be ∑ _{i = 1}^{k} |a_{x, i} - a_{y, i}| (it is also known as Manhattan distance).
Yo... | instruction | 0 | 96,975 | 23 | 193,950 |
No | output | 1 | 96,975 | 23 | 193,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,004 | 23 | 194,008 |
Tags: brute force, strings
Correct Solution:
```
if __name__ == '__main__':
cin = lambda: [*map(int, input().split())] #一行一行读
n, m = cin()
se = set()
x = [tuple(sorted(cin())) for _ in range(m)]
for e in x:
se.add((e[0] - 1, e[1] - 1))
for i in range(1, n):
if n % i !=... | output | 1 | 97,004 | 23 | 194,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,005 | 23 | 194,010 |
Tags: brute force, strings
Correct Solution:
```
"""
Satwik_Tiwari ;) .
30th july , 2020 - Thursday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Frac... | output | 1 | 97,005 | 23 | 194,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,006 | 23 | 194,012 |
Tags: brute force, strings
Correct Solution:
```
nz = [int(x) for x in input().split()]
edges = set()
divisors = set()
for x in range (0,nz[1]):
uv = [ y for y in input().split()]
edges.add(uv[0] + ' ' + uv[1])
for x in range(1,nz[0]):
if nz[0] % x == 0:
divisors.add(x)
flag = 0
for y in divisors:
flag = 0... | output | 1 | 97,006 | 23 | 194,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,007 | 23 | 194,014 |
Tags: brute force, strings
Correct Solution:
```
def gcd(x,y):
while y:
x,y = y,x%y
return x
def lcm(a,b): return (a*b)//gcd(a,b)
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
kk=lambda:map(int,input().split())
k2=lambda:map(lambda x:int(x)-1, input().split())
ll=lambda:list(kk())
n,m=k... | output | 1 | 97,007 | 23 | 194,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,008 | 23 | 194,016 |
Tags: brute force, strings
Correct Solution:
```
import sys
import collections
# see tutorial at https://codeforces.com/blog/entry/66878
n, m = map(int, input().split())
# segment length -> start
segs = set()
for _ in range(m):
start, end = map(int, input().split())
segs.add((start-1, end-1))
def get_di... | output | 1 | 97,008 | 23 | 194,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,009 | 23 | 194,018 |
Tags: brute force, strings
Correct Solution:
```
import sys
def No():
print('No')
sys.exit()
def divi(n):
res = [1]
for i in range(2, int(n**0.5)+1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n//i)
return res
N, M = map(int, input().split... | output | 1 | 97,009 | 23 | 194,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,010 | 23 | 194,020 |
Tags: brute force, strings
Correct Solution:
```
import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
n, m = map(int, input().split())
S = set()
for i in range(m):
a, b = map(int, input().split())
a, b = a-1, b-1
if a > b:
a, ... | output | 1 | 97,010 | 23 | 194,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, and so are points n and 1.
There are m straight... | instruction | 0 | 97,011 | 23 | 194,022 |
Tags: brute force, strings
Correct Solution:
```
n, m = map(int, input().split())
arr = [set() for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
f = b - a
if f < 0:
f += n
arr[a].add(f)
f = a - b
if f < 0:
f += n
arr[b].add(f)
lst = ... | output | 1 | 97,011 | 23 | 194,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,012 | 23 | 194,024 |
Yes | output | 1 | 97,012 | 23 | 194,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,013 | 23 | 194,026 |
Yes | output | 1 | 97,013 | 23 | 194,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,014 | 23 | 194,028 |
Yes | output | 1 | 97,014 | 23 | 194,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,015 | 23 | 194,030 |
Yes | output | 1 | 97,015 | 23 | 194,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,016 | 23 | 194,032 |
No | output | 1 | 97,016 | 23 | 194,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,017 | 23 | 194,034 |
No | output | 1 | 97,017 | 23 | 194,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,018 | 23 | 194,036 |
No | output | 1 | 97,018 | 23 | 194,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inaka has a disc, the circumference of which is n units. The circumference is equally divided by n points numbered clockwise from 1 to n, such that points i and i + 1 (1 ≤ i < n) are adjacent, a... | instruction | 0 | 97,019 | 23 | 194,038 |
No | output | 1 | 97,019 | 23 | 194,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,158 | 23 | 194,316 |
Yes | output | 1 | 97,158 | 23 | 194,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,159 | 23 | 194,318 |
Yes | output | 1 | 97,159 | 23 | 194,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,160 | 23 | 194,320 |
Yes | output | 1 | 97,160 | 23 | 194,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,161 | 23 | 194,322 |
Yes | output | 1 | 97,161 | 23 | 194,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,162 | 23 | 194,324 |
No | output | 1 | 97,162 | 23 | 194,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,163 | 23 | 194,326 |
No | output | 1 | 97,163 | 23 | 194,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,164 | 23 | 194,328 |
No | output | 1 | 97,164 | 23 | 194,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,165 | 23 | 194,330 |
No | output | 1 | 97,165 | 23 | 194,331 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two lists of segments [al_1, ar_1], [al_2, ar_2], ..., [al_n, ar_n] and [bl_1, br_1], [bl_2, br_2], ..., [bl_n, br_n].
Initially, all segments [al_i, ar_i] are equal to [l_1, r_1]... | instruction | 0 | 97,166 | 23 | 194,332 |
No | output | 1 | 97,166 | 23 | 194,333 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,167 | 23 | 194,334 |
Tags: geometry, math
Correct Solution:
```
from math import asin, pi
n, R, r = map(int, input().split())
if n == 1 and r <= R:
print('YES')
elif 2 * r > R:
print('NO')
elif (pi / asin(r / (R - r))) + 10 ** -6 >= n:
print('YES')
else:
print('NO')
``` | output | 1 | 97,167 | 23 | 194,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,168 | 23 | 194,336 |
Tags: geometry, math
Correct Solution:
```
import math
def Rp(n, R, r):
if n == 1:
return r
else:
return r * (1 + 1 / math.sin(math.pi / n)) - 1e-6
n, R, r = map(int, input().split())
print("YES" if R >= Rp(n, R, r) else "NO")
``` | output | 1 | 97,168 | 23 | 194,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,169 | 23 | 194,338 |
Tags: geometry, math
Correct Solution:
```
import math
n, R, r = map(int, input().split())
if n == 1:
print("YES" if r <= R else "NO")
exit(0)
theta = math.pi / n
RR = r / math.sin(theta) + r
print("YES" if R >= RR else "NO")
``` | output | 1 | 97,169 | 23 | 194,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,170 | 23 | 194,340 |
Tags: geometry, math
Correct Solution:
```
"""
Author : Arif Ahmad
Date :
Algo :
Difficulty :
"""
def main():
n, R, r = map(int, input().split())
if n == 1:
if r <= R: print('YES')
else: print('NO')
else:
import math
# calculate side of inscribed n-gon
a = (R - r) * math.sin(math.pi / n)
... | output | 1 | 97,170 | 23 | 194,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,171 | 23 | 194,342 |
Tags: geometry, math
Correct Solution:
```
from math import sin, pi
def table(n, R, r):
if r > R:
return "NO"
if n == 1:
return "YES"
if 2 * r < (R - r) * sin(pi / n) * 2 + 1e-8:
return "YES"
return "NO"
n, R, r = [int(i) for i in input().split()]
print(table(n, R, r))
``` | output | 1 | 97,171 | 23 | 194,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,172 | 23 | 194,344 |
Tags: geometry, math
Correct Solution:
```
import math
n,R,r=map(int,input().split())
if n==1 :
if r>R :
print("NO")
else:
print("YES")
quit()
if n==2 :
if 2*r>R :
print("NO")
else:
print("YES")
quit()
Rv=2*r/(2*math.sin(360/2/n*math.pi/180))
t=r+Rv
if ... | output | 1 | 97,172 | 23 | 194,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,173 | 23 | 194,346 |
Tags: geometry, math
Correct Solution:
```
from math import pi, sin
n, R, r = map(int, input().split())
print('NO' if r > R or (n > 1 and ((R - r) * sin(pi / n) + 0.0000001) < r) else 'YES')
``` | output | 1 | 97,173 | 23 | 194,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round an... | instruction | 0 | 97,174 | 23 | 194,348 |
Tags: geometry, math
Correct Solution:
```
import math
n,R,r=map(int,input().split())
if 2*r>R and n>1:
print('NO')
exit()
if n==1 and r<=R:
print('YES')
exit()
if n==1 and r>R:
print('NO')
exit()
if n>1 and r>=R:
print('NO')
exit()
c = 2*math.pi/(2*math.asin(r/(R-r)))
if c-n>-10**-6:
... | output | 1 | 97,174 | 23 | 194,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,175 | 23 | 194,350 |
Yes | output | 1 | 97,175 | 23 | 194,351 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,176 | 23 | 194,352 |
Yes | output | 1 | 97,176 | 23 | 194,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,177 | 23 | 194,354 |
Yes | output | 1 | 97,177 | 23 | 194,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,178 | 23 | 194,356 |
Yes | output | 1 | 97,178 | 23 | 194,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,179 | 23 | 194,358 |
No | output | 1 | 97,179 | 23 | 194,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,180 | 23 | 194,360 |
No | output | 1 | 97,180 | 23 | 194,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all t... | instruction | 0 | 97,181 | 23 | 194,362 |
No | output | 1 | 97,181 | 23 | 194,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kavi has 2n points lying on the OX axis, i-th of which is located at x = i.
Kavi considers all ways to split these 2n points into n pairs. Among those, he is interested in good pairings, which ... | instruction | 0 | 97,239 | 23 | 194,478 |
Yes | output | 1 | 97,239 | 23 | 194,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kavi has 2n points lying on the OX axis, i-th of which is located at x = i.
Kavi considers all ways to split these 2n points into n pairs. Among those, he is interested in good pairings, which ... | instruction | 0 | 97,240 | 23 | 194,480 |
Yes | output | 1 | 97,240 | 23 | 194,481 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.