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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,873 | 23 | 51,746 |
Tags: brute force, geometry
Correct Solution:
```
import sys
from math import *
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def right(x1,y1,x2,y2,x3,y3):
x2-=x1
y2-=y1
x3-=x1
y3-=y1
if x2*y3-x3*y2 == 0:
return False
l1 = x2**... | output | 1 | 25,873 | 23 | 51,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,874 | 23 | 51,748 |
Tags: brute force, geometry
Correct Solution:
```
def distance(x1, y1, x2, y2): #deltas of points. distance between them on Oxy
deltax = x2 - x1
deltay = y2 - y1
return deltax * deltax + deltay * deltay
def trianglech(x1, y1, x2, y2, x3, y3):
a = distance(x1, y1, x2, y2) #distances of catetes
b = distance(x... | output | 1 | 25,874 | 23 | 51,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,875 | 23 | 51,750 |
Tags: brute force, geometry
Correct Solution:
```
# python 3
"""
"""
def dist_squared(point_1, point_2):
return pow(point_1[0] - point_2[0], 2) + pow(point_1[1] - point_2[1], 2)
def right_triangle(p12_squared, p23_squared, p13_squared):
if p12_squared == p13_squared + p23_squared or \
p23_square... | output | 1 | 25,875 | 23 | 51,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,876 | 23 | 51,752 |
Tags: brute force, geometry
Correct Solution:
```
x1,y1,x2,y2,x3,y3=map(int,input().split())
def tri(x1,y1,x2,y2,x3,y3):
if (x1==x2 and y1==y2) or (x3==x2 and y3==y2) or (x1==x3 and y1==y3):
return False
if ((x1-x2)*(x3-x2)==-(y1-y2)*(y3-y2)) or ((x2-x1)*(x3-x1)==-(y2-y1)*(y3-y1)) or ((x1-x3)*(x2-x3)==... | output | 1 | 25,876 | 23 | 51,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,877 | 23 | 51,754 |
Tags: brute force, geometry
Correct Solution:
```
def check(a1, a2, b1, b2, c1, c2):
x = (a1 - b1) ** 2 + (a2 - b2) ** 2
y = (b1 - c1) ** 2 + (c2 - b2) ** 2
z = (a1 - c1) **2 + (c2 - a2) ** 2
l1 = [x,y,z]
l1.sort()
if l1[0] + l1[1] == l1[2] and x != 0 and y != 0 and z != 0:
return True
... | output | 1 | 25,877 | 23 | 51,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,878 | 23 | 51,756 |
Tags: brute force, geometry
Correct Solution:
```
class point:
def __init__(self, x=0, y=0):
self.x = x
self.y = y
def trans(self, d):
return point(self.x + d[0], self.y + d[1])
def cross(a, b, c): return (a.x-c.x) * (b.y-c.y) - (a.y-c.y) * (b.x-c.x)
def dot(a, b, c): return (a.x-c.x) * (b.x-c.x) + (a.y-c.y) * ... | output | 1 | 25,878 | 23 | 51,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,879 | 23 | 51,758 |
Tags: brute force, geometry
Correct Solution:
```
from math import sqrt
def distance(a,b):
delta_x=a[0]-b[0]
delta_y=a[1]-b[1]
return sqrt( delta_x**2+delta_y**2 )
a,b,c=0,0,0
def check(liste):
p1,p2,p3=liste
a,b,c=distance(p1,p2),distance(p2,p3),distance(p1,p3)
a,b,c=sorted([a,b,c])
if a+b<... | output | 1 | 25,879 | 23 | 51,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,880 | 23 | 51,760 |
Yes | output | 1 | 25,880 | 23 | 51,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,881 | 23 | 51,762 |
Yes | output | 1 | 25,881 | 23 | 51,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,882 | 23 | 51,764 |
Yes | output | 1 | 25,882 | 23 | 51,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,883 | 23 | 51,766 |
Yes | output | 1 | 25,883 | 23 | 51,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,884 | 23 | 51,768 |
No | output | 1 | 25,884 | 23 | 51,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,885 | 23 | 51,770 |
No | output | 1 | 25,885 | 23 | 51,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,886 | 23 | 51,772 |
No | output | 1 | 25,886 | 23 | 51,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper... | instruction | 0 | 25,887 | 23 | 51,774 |
No | output | 1 | 25,887 | 23 | 51,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,044 | 23 | 52,088 |
Tags: dfs and similar
Correct Solution:
```
#### IMPORTANT LIBRARY ####
############################
### DO NOT USE import random --> 250ms to load the library
############################
### In case of extra libraries: https://github.com/cheran-senthil/PyRival
######################
####### IMPORT #######
#####... | output | 1 | 26,044 | 23 | 52,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,045 | 23 | 52,090 |
Tags: dfs and similar
Correct Solution:
```
import sys
n, m = map(int, sys.stdin.buffer.readline().decode('utf-8').split())
a = [list(line.decode('utf-8').rstrip()) for line in sys.stdin.buffer]
group = [[0]*m for _ in range(n)]
size = [0]
gi = 1
for i in range(n):
for j in range(m):
if a[i][j] == '*' or... | output | 1 | 26,045 | 23 | 52,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,046 | 23 | 52,092 |
Tags: dfs and similar
Correct Solution:
```
import sys
input=sys.stdin.readline
from collections import defaultdict
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def root(self, x):
stack = []
tbl = self.table
while tbl[x] >= 0:
stack.append(x)
... | output | 1 | 26,046 | 23 | 52,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,047 | 23 | 52,094 |
Tags: dfs and similar
Correct Solution:
```
from sys import stdin, stdout
n, m = map(int, stdin.readline().split())
mtx = [[ch for ch in stdin.readline()] for _ in range(n)]
groups = [[0 for _ in range(m)] for _ in range(n)]
sizes = [0]
shard_id = 1
for i in range(n):
for j in range(m):
if mtx[i][j] ==... | output | 1 | 26,047 | 23 | 52,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,048 | 23 | 52,096 |
Tags: dfs and similar
Correct Solution:
```
# n=int(input())
# n,k=map(int,input().split())
# arr=list(map(int,input().split()))
#ls=list(map(int,input().split()))
#for i in range(m):
# for _ in range(int(input())):
from collections import Counter
#from fractions import Fraction
#n=int(input())
#arr=list(map(int,input(... | output | 1 | 26,048 | 23 | 52,097 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,049 | 23 | 52,098 |
Tags: dfs and similar
Correct Solution:
```
from sys import stdin,stdout
st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")
def valid(x,y):
if x>=n or y>=m o... | output | 1 | 26,049 | 23 | 52,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,050 | 23 | 52,100 |
Tags: dfs and similar
Correct Solution:
```
from collections import defaultdict
import sys
input = sys.stdin.readline
def get_root(s):
v = []
while not s == root[s]:
v.append(s)
s = root[s]
for i in v:
root[i] = s
return s
def unite(s, t):
root_s = get_root(s)
root_t = ... | output | 1 | 26,050 | 23 | 52,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side... | instruction | 0 | 26,051 | 23 | 52,102 |
Tags: dfs and similar
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
class DisjointSetUnion:
def __init__(self, n):
self.parent = list(range(n))
self.size = [1] * n
self.num_sets = n
def find(self, a):
acopy = a
while a != ... | output | 1 | 26,051 | 23 | 52,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,052 | 23 | 52,104 |
Yes | output | 1 | 26,052 | 23 | 52,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,053 | 23 | 52,106 |
Yes | output | 1 | 26,053 | 23 | 52,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,054 | 23 | 52,108 |
Yes | output | 1 | 26,054 | 23 | 52,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,055 | 23 | 52,110 |
Yes | output | 1 | 26,055 | 23 | 52,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,056 | 23 | 52,112 |
No | output | 1 | 26,056 | 23 | 52,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,057 | 23 | 52,114 |
No | output | 1 | 26,057 | 23 | 52,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,058 | 23 | 52,116 |
No | output | 1 | 26,058 | 23 | 52,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's cal... | instruction | 0 | 26,059 | 23 | 52,118 |
No | output | 1 | 26,059 | 23 | 52,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,136 | 23 | 52,272 |
Tags: geometry
Correct Solution:
```
def r(pred, cur, nxt):
x1, y1 = nxt['x'] - pred['x'], nxt['y'] - pred['y']
x2, y2 = cur['x'] - pred['x'], cur['y'] - pred['y']
m = abs(x1 * y2 - x2 * y1)
return m / (x1**2 + y1**2)**0.5
n = int(input())
a = []
for i in range(n):
x, y = (int(_) for _ in input().... | output | 1 | 26,136 | 23 | 52,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,137 | 23 | 52,274 |
Tags: geometry
Correct Solution:
```
from collections import Counter
n=int(input())
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
#a.append(a[0])
m=10000000000
for i in range(-1,n-1):
b=a[i+1][0]-a[i-1][0]
c=a[i-1][1]-a[i+1][1]
d=-a[i-1][1]*b-a[i-1][0]*c
m=min(m,((a[i-1][0]-a[i][0... | output | 1 | 26,137 | 23 | 52,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,138 | 23 | 52,276 |
Tags: geometry
Correct Solution:
```
def d(x, y, x1, y1, x2, y2):
if x1 == x2:
return abs(x - x1)
elif y1 == y2:
return abs(y - y1)
else:
return abs(((x-x1)/(x2-x1) - (y-y1)/(y2-y1)) / (1/(x2-x1)**2 + 1/(y2-y1)**2)**0.5)
def delta(a, b, c):
return d(a[0], a[1], b[0], b[1], c[0], c[1]) / 2
n = i... | output | 1 | 26,138 | 23 | 52,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,139 | 23 | 52,278 |
Tags: geometry
Correct Solution:
```
"""
ATSTNG's ejudge Python3 solution template
(actual solution is below)
"""
import sys, queue, string, math
try:
import dev_act_ffc429465ab634 # empty file in directory
DEV = True
except:
DEV = False
def log(*s):
if DEV: print('LOG', *s)
class EJudge:
def __... | output | 1 | 26,139 | 23 | 52,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,140 | 23 | 52,280 |
Tags: geometry
Correct Solution:
```
def calc(distance_1,distance_2,distance_3):
return ((2*distance_1*distance_3 + 2*distance_2*distance_3 - distance_3*distance_3 - (distance_1-distance_2)**2)/(16*distance_3))**0.5
def distance(point_1,point_2):
point_1,y1 = point_1
point_2,y2 = point_2
return (point_1-point_2)**2... | output | 1 | 26,140 | 23 | 52,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,141 | 23 | 52,282 |
Tags: geometry
Correct Solution:
```
d = lambda i, j: (t[i][0] - t[j % n][0]) ** 2 + (t[i][1] - t[j % n][1]) ** 2
n = int(input())
t = [list(map(int, input().split())) for q in range(n)]
h = 1e20
for i in range(n):
a, b, c = d(i - 1, i), d(i, i + 1), d(i - 1, i + 1)
h = min(h, (4 * a * b - (a + b - c) ** 2) / c... | output | 1 | 26,141 | 23 | 52,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,142 | 23 | 52,284 |
Tags: geometry
Correct Solution:
```
n = int(input())
P = []
def h(p1, p2, m):
return abs(((p2[0] - p1[0])*(m[1] - p1[1])-(p2[1] - p1[1])*(m[0] - p1[0]))\
/((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1])**2) ** 0.5)
for i in range(n):
P.append(list(map(int, input().split())))
answer = float("inf")
for... | output | 1 | 26,142 | 23 | 52,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a real number D and move each vertex of the polygon ... | instruction | 0 | 26,143 | 23 | 52,286 |
Tags: geometry
Correct Solution:
```
from sys import stdin, stdout
import math
n = int(stdin.readline().rstrip())
pointsList=[]
for i in range(n):
x,y = map(int, stdin.readline().rstrip().split())
pointsList.append((x,y))
maxD=999999999999999
for i in range(n):
if i==n-2:
j=n-1
k=0
e... | output | 1 | 26,143 | 23 | 52,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a rea... | instruction | 0 | 26,144 | 23 | 52,288 |
No | output | 1 | 26,144 | 23 | 52,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a rea... | instruction | 0 | 26,145 | 23 | 52,290 |
No | output | 1 | 26,145 | 23 | 52,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a rea... | instruction | 0 | 26,146 | 23 | 52,292 |
No | output | 1 | 26,146 | 23 | 52,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.
You can choose a rea... | instruction | 0 | 26,147 | 23 | 52,294 |
No | output | 1 | 26,147 | 23 | 52,295 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.
For a quadruple of intege... | instruction | 0 | 26,251 | 23 | 52,502 |
"Correct Solution:
```
N,M=map(int,input().split())
A=[]
for i in range(2**N):
B=[]
for j in range(2**M):
B.append(bin(i&j).count("1")%2)
A.append(B)
ANS=[[0]*(2**M) for i in range(2**N)]
for i in range(1,2**N):
for j in range(1,2**M):
if A[i][j]!=(A[i-1][j]+A[i][j-1]-A[i-1][j-1])%2:
... | output | 1 | 26,251 | 23 | 52,503 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.
For a quadruple of intege... | instruction | 0 | 26,252 | 23 | 52,504 |
"Correct Solution:
```
n,m=map(int,input().split())
ans=[["1"]*(2**m-1) for _ in range(2**n-1)]
for k in range(1,11):
for i in range(2**k,2**n,2**k):
for j in range(2**k,2**m,2**k):
if ans[i-1][j-1]=="1":
ans[i-1][j-1]="0"
else:
ans[i-1][j-1]="1"
for i... | output | 1 | 26,252 | 23 | 52,505 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.
For a quadruple of intege... | instruction | 0 | 26,253 | 23 | 52,506 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [li... | output | 1 | 26,253 | 23 | 52,507 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.
For a quadruple of intege... | instruction | 0 | 26,254 | 23 | 52,508 |
"Correct Solution:
```
import sys
bitcnt = [0] * (1 << 10)
for i in range(1,1 << 10):
bitcnt[i] = bitcnt[i//2] + i % 2
bitcnt[i] %= 2
field = [[bitcnt[i & j] for j in range(1 << 10)] for i in range(1 << 10)]
n, m = map(int, input().split())
n = 1 << n
m = 1 << m
for i in range(1, n):
for j in range(1... | output | 1 | 26,254 | 23 | 52,509 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.
For a quadruple of intege... | instruction | 0 | 26,255 | 23 | 52,510 |
"Correct Solution:
```
n, m = map(int, input().split())
ans = [0, 1]
for i in range(1, min(n, m)):
k = 1 << i
x = (1 << k) - 1
slide = [a << k for a in ans]
new_ans = [s | a for s, a in zip(slide, ans)]
new_ans.extend(s | (a ^ x) for s, a in zip(slide, ans))
ans = new_ans
if n > m:
ans *= 1 ... | output | 1 | 26,255 | 23 | 52,511 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.
For a quadruple of intege... | instruction | 0 | 26,256 | 23 | 52,512 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read
n,m = [int(i) for i in read().split()]
def popcount(i): # i < 2^32
i = i - ((i >> 1) & 0x55555555)
i = (i & 0x33333333) + ((i >> 2) & 0x33333333)
return ((... | output | 1 | 26,256 | 23 | 52,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and t... | instruction | 0 | 26,257 | 23 | 52,514 |
No | output | 1 | 26,257 | 23 | 52,515 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.