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.
This is an interactive problem
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,963 | 23 | 151,926 |
Yes | output | 1 | 75,963 | 23 | 151,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,964 | 23 | 151,928 |
Yes | output | 1 | 75,964 | 23 | 151,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,965 | 23 | 151,930 |
No | output | 1 | 75,965 | 23 | 151,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,966 | 23 | 151,932 |
No | output | 1 | 75,966 | 23 | 151,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,967 | 23 | 151,934 |
No | output | 1 | 75,967 | 23 | 151,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,968 | 23 | 151,936 |
No | output | 1 | 75,968 | 23 | 151,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a set of n segments on a line [L_i; R_i]. All 2n segment endpoints are pairwise distinct integers.
The set is laminar — any two segments are either disjoint or one of them contain... | instruction | 0 | 76,108 | 23 | 152,216 |
No | output | 1 | 76,108 | 23 | 152,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a set of n segments on a line [L_i; R_i]. All 2n segment endpoints are pairwise distinct integers.
The set is laminar — any two segments are either disjoint or one of them contain... | instruction | 0 | 76,109 | 23 | 152,218 |
No | output | 1 | 76,109 | 23 | 152,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a set of n segments on a line [L_i; R_i]. All 2n segment endpoints are pairwise distinct integers.
The set is laminar — any two segments are either disjoint or one of them contain... | instruction | 0 | 76,110 | 23 | 152,220 |
No | output | 1 | 76,110 | 23 | 152,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,129 | 23 | 152,258 |
Tags: brute force, geometry
Correct Solution:
```
x,y,z=map(int,input().split())
x1,y1,z1=map(int,input().split())
arr=list(map(int,input().split()))
sums=0
if x1>0:
if x>x1:
sums+=arr[5]
elif x<0:
sums+=arr[4]
elif x1<0:
if x<x1:
sums+=arr[5]
elif x>0:
sums+=arr[4]
if y1>0:
if y>y1:
sums+... | output | 1 | 76,129 | 23 | 152,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,130 | 23 | 152,260 |
Tags: brute force, geometry
Correct Solution:
```
x, y, z = map(int, input().split())
x1, y1, z1 = map(int, input().split())
a1, a2, a3, a4, a5, a6 = map(int, input().split())
ans = 0
if x > x1:
ans += a6
if x < 0:
ans += a5
if y > y1:
ans += a2
if y < 0:
ans += a1
if z > z1:
ans += a4
if z < 0:
... | output | 1 | 76,130 | 23 | 152,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,131 | 23 | 152,262 |
Tags: brute force, geometry
Correct Solution:
```
x,y,z=map(int,input().split())
a,b,c=map(int,input().split())
a1,a2,a3,a4,a5,a6=map(int,input().split())
sum=0
if x>a:
sum+=a6
if x<0:
sum+=a5
if y>b:
sum+=a2
if y<0:
sum+=a1
if z>c:
sum+=a4
if z<0:
sum+=a3
print(sum)
``` | output | 1 | 76,131 | 23 | 152,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,132 | 23 | 152,264 |
Tags: brute force, geometry
Correct Solution:
```
x, y, z = map(int, input().split())
x1, y1, z1 = map(int, input().split())
a1, a2, a3, a4, a5, a6 = map(int, input().split())
s = 0
if x > x1: s += a6
elif x < 0: s += a5
if y > y1: s += a2
elif y < 0: s += a1
if z > z1: s += a4
elif z < 0: s += a3
print(s)
``` | output | 1 | 76,132 | 23 | 152,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,133 | 23 | 152,266 |
Tags: brute force, geometry
Correct Solution:
```
from decimal import *
getcontext().prec=16
x,y,z=[int(element) for element in input().split(" ")]
a,b,c=[int(element) for element in input().split(" ")]
liste=[int(element) for element in input().split(" ")]
count=0
if x<0:
count+=liste[4]
if x>a:
count+=liste... | output | 1 | 76,133 | 23 | 152,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,134 | 23 | 152,268 |
Tags: brute force, geometry
Correct Solution:
```
#input
x,y,z=map(int,input().strip().split(" "));
x1,y1,z1=map(int,input().strip().split(" "));
a1,a2,a3,a4,a5,a6=map(int,input().strip().split(" "));
#process
ans=0;
if(z>z1):
ans+=a4;
if(z<0):
ans+=a3;
if(x>x1):
ans+=a6;
if(x<0):
ans+=a5;
if(y>y1):
ans+=a2... | output | 1 | 76,134 | 23 | 152,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,135 | 23 | 152,270 |
Tags: brute force, geometry
Correct Solution:
```
# import itertools
# import bisect
import math
from collections import defaultdict, Counter, deque
import os
import sys
from io import BytesIO, IOBase
# sys.setrecursionlimit(10 ** 5)
ii = lambda: int(input())
lmii = lambda: list(map(int, input().split()))
slmii = lamb... | output | 1 | 76,135 | 23 | 152,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one ... | instruction | 0 | 76,136 | 23 | 152,272 |
Tags: brute force, geometry
Correct Solution:
```
x, y, z = map(int, input().split())
x1, y1, z1, s = map(int, input().split() + [0])
a = list(map(int, input().split()))
s += a[0] if y < 0 else a[1] if y > y1 else 0
s += a[2] if z < 0 else a[3] if z > z1 else 0
s += a[4] if x < 0 else a[5] if x > x1 else 0
print(s)
``` | output | 1 | 76,136 | 23 | 152,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,137 | 23 | 152,274 |
Yes | output | 1 | 76,137 | 23 | 152,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,138 | 23 | 152,276 |
Yes | output | 1 | 76,138 | 23 | 152,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,139 | 23 | 152,278 |
Yes | output | 1 | 76,139 | 23 | 152,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,140 | 23 | 152,280 |
Yes | output | 1 | 76,140 | 23 | 152,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,141 | 23 | 152,282 |
No | output | 1 | 76,141 | 23 | 152,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,142 | 23 | 152,284 |
No | output | 1 | 76,142 | 23 | 152,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,143 | 23 | 152,286 |
No | output | 1 | 76,143 | 23 | 152,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its ... | instruction | 0 | 76,144 | 23 | 152,288 |
No | output | 1 | 76,144 | 23 | 152,289 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,145 | 23 | 152,290 |
Tags: brute force, geometry, math
Correct Solution:
```
def angle(v):
x, y = v
return atan2(x, y)
def main():
n = int(input())
import sys
if n == 1:
input()
print(0)
else:
l = sorted(atan2(*(int(i)for i in line.split())) for line in sys.stdin)
print(360 ... | output | 1 | 76,145 | 23 | 152,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,146 | 23 | 152,292 |
Tags: brute force, geometry, math
Correct Solution:
```
from math import atan2, pi
n = int(input())
a = [map(int, input().split()) for i in range(n)]
a = sorted(atan2(y, x) for x, y in a)
d = [a[i + 1] - a[i] for i in range(n - 1)]
d.append(2 * pi - a[n - 1] + a[0])
print(360 - 180 * max(d) / pi)
``` | output | 1 | 76,146 | 23 | 152,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,147 | 23 | 152,294 |
Tags: brute force, geometry, math
Correct Solution:
```
import math
n = int(input())
coors = [[int(item) for item in input().split(' ')] for i in range(n)]
def get_pos(item):
(x, y) = item
deg = math.degrees(math.atan(abs(math.inf if x == 0 else y / x)))
if y < 0:
if x >= 0:
return... | output | 1 | 76,147 | 23 | 152,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,148 | 23 | 152,296 |
Tags: brute force, geometry, math
Correct Solution:
```
import math
n=int(input())
angles=[]
for i in range(n):
a,b=map(int,input().split())
if a==0 and b>0:
angle=90
elif a==0 and b<0:
angle=270
elif b==0 and a>0:
angle=0
elif b==0 and a<0:
angle=180
elif a<0... | output | 1 | 76,148 | 23 | 152,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,149 | 23 | 152,298 |
Tags: brute force, geometry, math
Correct Solution:
```
import math
n, max_diff = int(input()), 0
values = [[int(i) for i in input().split()] for j in range(n)]
values = sorted([math.atan2(values[i][1], values[i][0]) for i in range(n)])
for i in range(n - 1):
max_diff = max(max_diff, values[i + 1] - values[i])
max... | output | 1 | 76,149 | 23 | 152,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,150 | 23 | 152,300 |
Tags: brute force, geometry, math
Correct Solution:
```
import math
a=-400
m=400
n=int(input())
ang=[]
for _ in ' '*n:
x,y=map(int,input().split())
theta =(180*math.atan2(y, x)/math.pi)
ang.append(theta)
ang.sort()
ans=ang[-1]-ang[0]
for i in range(n-1):
ans=min(ans,360-(ang[i+1]-ang[i]))
print(ans)
``` | output | 1 | 76,150 | 23 | 152,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,151 | 23 | 152,302 |
Tags: brute force, geometry, math
Correct Solution:
```
from math import pi, atan2
n = int(input())
if n == 1:
input()
print(0)
else:
l = sorted([atan2(*(int(x) for x in input().split())) for i in range(n)])
print(360 - 180 * max(max(j - i for i, j in zip(l[:-1], l[1:])), 2 *pi +l[0] - l[-1]) /... | output | 1 | 76,151 | 23 | 152,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of ... | instruction | 0 | 76,152 | 23 | 152,304 |
Tags: brute force, geometry, math
Correct Solution:
```
from math import atan2
from math import pi
from math import degrees
n = int(input())
if n == 1:
print(0)
exit()
arr = []
for _ in range(n):
x, y = map(int, input().split())
arr.append(degrees(atan2(y, x)))
arr.sort()
arr.append(arr[0]+360)
prin... | output | 1 | 76,152 | 23 | 152,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,153 | 23 | 152,306 |
Yes | output | 1 | 76,153 | 23 | 152,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,154 | 23 | 152,308 |
Yes | output | 1 | 76,154 | 23 | 152,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,155 | 23 | 152,310 |
Yes | output | 1 | 76,155 | 23 | 152,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,156 | 23 | 152,312 |
Yes | output | 1 | 76,156 | 23 | 152,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,157 | 23 | 152,314 |
No | output | 1 | 76,157 | 23 | 152,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,158 | 23 | 152,316 |
No | output | 1 | 76,158 | 23 | 152,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,159 | 23 | 152,318 |
No | output | 1 | 76,159 | 23 | 152,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the ... | instruction | 0 | 76,160 | 23 | 152,320 |
No | output | 1 | 76,160 | 23 | 152,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).
Your task is to find a maximum s... | instruction | 0 | 76,163 | 23 | 152,326 |
Tags: implementation, math
Correct Solution:
```
import sys
from fractions import gcd
with sys.stdin as fin, sys.stdout as fout:
n, m, x, y, a, b = map(int, next(fin).split())
d = gcd(a, b)
a //= d
b //= d
k = min(n // a, m // b)
w = k * a
h = k * b
x1 = x - (w + 1) // 2
y1 =... | output | 1 | 76,163 | 23 | 152,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).
Your task is to find a maximum s... | instruction | 0 | 76,164 | 23 | 152,328 |
Tags: implementation, math
Correct Solution:
```
import math
n, m, x, y, a, b = map(int, input().split())
gcd = math.gcd(a, b)
a //= gcd
b //= gcd
max_ratio = min(n // a, m // b)
a *= max_ratio
b *= max_ratio
x1 = max(0, min(x - (a + 1) // 2, n - a))
y1 = max(0, min(y - (b + 1) // 2, m - b))
print(x1, y1, x1 + a, y1 + ... | output | 1 | 76,164 | 23 | 152,329 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).
Your task is to find a maximum s... | instruction | 0 | 76,165 | 23 | 152,330 |
Tags: implementation, math
Correct Solution:
```
from fractions import gcd
n, m, x, y, a, b = map(int, input().split())
r = gcd(a, b)
a, b = a // r, b // r
r = min(n // a, m // b)
a, b = a * r, b * r
cx, cy = (a + 1) // 2, (b + 1) // 2
dx, dy = min(n - a, max(cx, x) - cx), min(m - b, max(cy, y) - cy)
print(dx, dy, a + ... | output | 1 | 76,165 | 23 | 152,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).
Your task is to find a maximum s... | instruction | 0 | 76,166 | 23 | 152,332 |
Tags: implementation, math
Correct Solution:
```
from fractions import gcd
n, m, x, y, a, b = map(int, input().split())
r = gcd(a, b)
a, b = a // r, b // r
r = min(n // a, m // b)
a, b = a * r, b * r
cx, cy = (a + 1) // 2, (b + 1) // 2
dx, dy = min(n - a, max(cx, x) - cx), min(m - b, max(cy, y) - cy)
print(dx... | output | 1 | 76,166 | 23 | 152,333 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).
Your task is to find a maximum s... | instruction | 0 | 76,167 | 23 | 152,334 |
Tags: implementation, math
Correct Solution:
```
import sys
from fractions import gcd
with sys.stdin as fin, sys.stdout as fout:
n, m, x, y, a, b = map(int, next(fin).split())
d = gcd(a, b)
a //= d
b //= d
k = min(n // a, m // b) # >_<
w = k * a
h = k * b
best = tuple([float('inf... | output | 1 | 76,167 | 23 | 152,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).
Your task is to find a maximum s... | instruction | 0 | 76,168 | 23 | 152,336 |
Tags: implementation, math
Correct Solution:
```
from fractions import gcd
n, m, x, y, a, b = map(int, input().split())
g = gcd(a, b)
a, b = a // g, b // g
k = min(n // a, m // b)
a, b = k * a, k * b
x1, x2 = x - (a - a // 2), x + a // 2
y1, y2 = y - (b - b // 2), y + b // 2
d = max(0, 0 - x1)
x1, x2 = x1 + d, x2 + d... | output | 1 | 76,168 | 23 | 152,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n... | instruction | 0 | 76,169 | 23 | 152,338 |
No | output | 1 | 76,169 | 23 | 152,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n... | instruction | 0 | 76,170 | 23 | 152,340 |
No | output | 1 | 76,170 | 23 | 152,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n... | instruction | 0 | 76,171 | 23 | 152,342 |
No | output | 1 | 76,171 | 23 | 152,343 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.