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 a correct Python 3 solution for this coding contest problem.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop comes in three different sizes: Large, Medium, and Smal... | instruction | 0 | 36,750 | 23 | 73,500 |
"Correct Solution:
```
ar = [[0]*14 for _ in range(14)]
while(True):
try:
x,y,s = map(int,input().split(","))
if s == 3:
for x1,y1 in [[-2,0],[0,2],[2,0],[0,-2],[-1,-1],[0,-1],[1,-1],[-1,0],[0,0],[1,0],[-1,1],[0,1],[1,1]]:
ar[y1+y+2][x1+x+2] += 1
elif s == 2:
... | output | 1 | 36,750 | 23 | 73,501 |
Provide a correct Python 3 solution for this coding contest problem.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop comes in three different sizes: Large, Medium, and Smal... | instruction | 0 | 36,751 | 23 | 73,502 |
"Correct Solution:
```
A=[[int(0) for i in range(10)]for j in range(10)]
count=0
while 1:
try:
x,y,s = map(int, input().split(','))
if s==1:
for i in range(x-1,x+2):
if i>=0 and i<=9:
A[i][y]=A[i][y]+1
for i in range(y-1,y+2):
... | output | 1 | 36,751 | 23 | 73,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,752 | 23 | 73,504 |
Yes | output | 1 | 36,752 | 23 | 73,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,753 | 23 | 73,506 |
Yes | output | 1 | 36,753 | 23 | 73,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,754 | 23 | 73,508 |
Yes | output | 1 | 36,754 | 23 | 73,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,755 | 23 | 73,510 |
Yes | output | 1 | 36,755 | 23 | 73,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,756 | 23 | 73,512 |
No | output | 1 | 36,756 | 23 | 73,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,757 | 23 | 73,514 |
No | output | 1 | 36,757 | 23 | 73,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,758 | 23 | 73,516 |
No | output | 1 | 36,758 | 23 | 73,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As shown in the following figure, there is a paper consisting of a grid structure where each cell is indicated by (x, y) coordinate system.
We are going to put drops of ink on the paper. A drop... | instruction | 0 | 36,759 | 23 | 73,518 |
No | output | 1 | 36,759 | 23 | 73,519 |
Provide a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY loves puzzles. One of his favorite puzzles is the magic square. He has recently had an idea to automate the solution of this puzzle. The Beaver decided to offer this challenge to the ABBYY Cup contestants.
The magic squar... | instruction | 0 | 37,095 | 23 | 74,190 |
"Correct Solution:
```
import sys, random
def f(b):
global a
a = [[0] * n for o in range(n)]
for i in range(n):
for j in range(n):
a[i][j] = b[i * n + j]
rez = 0
for i in range(n):
ns = 0
for j in range(n):
ns += a[i][j]
rez += abs(su - ns)
... | output | 1 | 37,095 | 23 | 74,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has a very big sheet of paper. This sheet has a form of rectangle with dimensions 1 × n. Your task is help Appleman with folding of such a sheet. Actually, you need to perform q queries. Each query will have one of the following typ... | instruction | 0 | 37,195 | 23 | 74,390 |
Tags: data structures, implementation
Correct Solution:
```
from itertools import starmap
def main():
n, q = map(int, input().split())
a = list(range(n + 1))
flipped = False
start = 0
end = n
for _ in range(q):
cmd, *args = map(int, input().split())
if cmd == 1:
... | output | 1 | 37,195 | 23 | 74,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has a very big sheet of paper. This sheet has a form of rectangle with dimensions 1 × n. Your task is help Appleman with folding of such a sheet. Actually, you need to perform q queries... | instruction | 0 | 37,196 | 23 | 74,392 |
No | output | 1 | 37,196 | 23 | 74,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,205 | 23 | 74,410 |
Yes | output | 1 | 37,205 | 23 | 74,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,206 | 23 | 74,412 |
Yes | output | 1 | 37,206 | 23 | 74,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,207 | 23 | 74,414 |
Yes | output | 1 | 37,207 | 23 | 74,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,208 | 23 | 74,416 |
Yes | output | 1 | 37,208 | 23 | 74,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,209 | 23 | 74,418 |
No | output | 1 | 37,209 | 23 | 74,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,210 | 23 | 74,420 |
No | output | 1 | 37,210 | 23 | 74,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,211 | 23 | 74,422 |
No | output | 1 | 37,211 | 23 | 74,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.
Let's suppose that your task is to b... | instruction | 0 | 37,212 | 23 | 74,424 |
No | output | 1 | 37,212 | 23 | 74,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,612 | 23 | 75,224 |
Yes | output | 1 | 37,612 | 23 | 75,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,613 | 23 | 75,226 |
Yes | output | 1 | 37,613 | 23 | 75,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,614 | 23 | 75,228 |
Yes | output | 1 | 37,614 | 23 | 75,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,615 | 23 | 75,230 |
Yes | output | 1 | 37,615 | 23 | 75,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,616 | 23 | 75,232 |
No | output | 1 | 37,616 | 23 | 75,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,617 | 23 | 75,234 |
No | output | 1 | 37,617 | 23 | 75,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,618 | 23 | 75,236 |
No | output | 1 | 37,618 | 23 | 75,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right. Each square in the grid ... | instruction | 0 | 37,619 | 23 | 75,238 |
No | output | 1 | 37,619 | 23 | 75,239 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the puzzle by programming.
The numbers n x n are arranged in a grid pattern. Some of the numbers are circled and we will call them the starting point. The rules of the puzzle are as follows:
* Draw one line that goes vertically and hori... | instruction | 0 | 37,691 | 23 | 75,382 |
"Correct Solution:
```
board = []
used = []
v = []
n = 0
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
def set_v():
global v
for y in range(0, n):
for x in range(0, n):
if board[y][x] < 0:
v += [(x, y)]
used[y][x] = 1
def solve(x, y, rest, s, k):
if s == 0:
... | output | 1 | 37,691 | 23 | 75,383 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the puzzle by programming.
The numbers n x n are arranged in a grid pattern. Some of the numbers are circled and we will call them the starting point. The rules of the puzzle are as follows:
* Draw one line that goes vertically and hori... | instruction | 0 | 37,692 | 23 | 75,384 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
mp = [list(map(int, input().split())) for _ in range(n)]
used = [[False] * n for _ in range(n)]
inits = []
for y in range(n):
for x in range(n):
if mp[y][x] < 0:
inits.append((x, y, mp[y][x]))
used[y][x] = True
... | output | 1 | 37,692 | 23 | 75,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the puzzle by programming.
The numbers n x n are arranged in a grid pattern. Some of the numbers are circled and we will call them the starting point. The rules of the puzzle are as... | instruction | 0 | 37,693 | 23 | 75,386 |
No | output | 1 | 37,693 | 23 | 75,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the puzzle by programming.
The numbers n x n are arranged in a grid pattern. Some of the numbers are circled and we will call them the starting point. The rules of the puzzle are as... | instruction | 0 | 37,694 | 23 | 75,388 |
No | output | 1 | 37,694 | 23 | 75,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the puzzle by programming.
The numbers n x n are arranged in a grid pattern. Some of the numbers are circled and we will call them the starting point. The rules of the puzzle are as... | instruction | 0 | 37,695 | 23 | 75,390 |
No | output | 1 | 37,695 | 23 | 75,391 |
Provide a correct Python 3 solution for this coding contest problem.
There is a chain consisting of multiple circles on a plane. The first (last) circle of the chain only intersects with the next (previous) circle, and each intermediate circle intersects only with the two neighboring circles.
Your task is to find the... | instruction | 0 | 37,696 | 23 | 75,392 |
"Correct Solution:
```
from heapq import heappop, heappush
def cross(a,b):
return a[0]*b[1]-a[1]*b[0]
def calc(r1,r2):
a = ((r1[0]-r2[0])**2+(r1[1]-r2[1])**2)**0.5
b = r1[2]
c = r2[2]
cos = (a**2+b**2-c**2)/(2*a*b)
s = b*cos
t = (b**2-s**2)**0.5
e = ((r2[0]-r1[0])/a,(r2[1]-r1[1])/a)
... | output | 1 | 37,696 | 23 | 75,393 |
Provide a correct Python 3 solution for this coding contest problem.
There is a chain consisting of multiple circles on a plane. The first (last) circle of the chain only intersects with the next (previous) circle, and each intermediate circle intersects only with the two neighboring circles.
Your task is to find the... | instruction | 0 | 37,697 | 23 | 75,394 |
"Correct Solution:
```
import math
class Vec:
def __init__(self, x, y):
self.x = x
self.y = y
def __mul__(self, other):
return Vec(self.x * other, self.y * other)
def length(self):
return math.sqrt(self.x * self.x + self.y * self.y)
def __str__(self):
return ... | output | 1 | 37,697 | 23 | 75,395 |
Provide a correct Python 3 solution for this coding contest problem.
There is a chain consisting of multiple circles on a plane. The first (last) circle of the chain only intersects with the next (previous) circle, and each intermediate circle intersects only with the two neighboring circles.
Your task is to find the... | instruction | 0 | 37,698 | 23 | 75,396 |
"Correct Solution:
```
def solve():
from math import acos
from cmath import phase, rect, pi
from sys import stdin
file_input = stdin
while True:
n = int(file_input.readline())
if n == 0:
break
C = (map(int, file_input.readline().split()) for i i... | output | 1 | 37,698 | 23 | 75,397 |
Provide a correct Python 3 solution for this coding contest problem.
There is a chain consisting of multiple circles on a plane. The first (last) circle of the chain only intersects with the next (previous) circle, and each intermediate circle intersects only with the two neighboring circles.
Your task is to find the... | instruction | 0 | 37,699 | 23 | 75,398 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 37,699 | 23 | 75,399 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,712 | 23 | 75,424 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
# gcd
from fractions import gcd
# 切り上げ，切り捨て
from math import ceil, floor
# リストの真のコピー（変更が伝播しない）
from copy import deepcopy
# 累積和。list(accumulate(A))としてAの累積和
from itertools import accumulate
# l = ['a', 'b', 'b', 'c', 'b', 'a', 'c', ... | output | 1 | 37,712 | 23 | 75,425 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,713 | 23 | 75,426 |
"Correct Solution:
```
def inpl(): return list(map(int, input().split()))
H, W = inpl()
ans = 0
C = [input() for _ in range(H)]
for i in range(2):
L = [0]*H
R = [0]*H
Lk = []
Rk = []
for h in range(H):
L[h] = C[h].find("B")
R[h] = C[h].rfind("B")
if L[h] >= 0:
L... | output | 1 | 37,713 | 23 | 75,427 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,714 | 23 | 75,428 |
"Correct Solution:
```
# from sys import exit, stderr
# from inspect import currentframe
# def debug(*args):
# names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
# print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args), file=stderr)
# return
INF = 10e10
H, W = [int(n) for... | output | 1 | 37,714 | 23 | 75,429 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,715 | 23 | 75,430 |
"Correct Solution:
```
# from sys import exit
H, W = [int(n) for n in input().split()]
c = [[0 for _ in range(W)] for __ in range(H)]
Bs = []
for i in range(H):
c[i] = list(str(input()))
for j in range(W):
if c[i][j] == "B":
Bs.append((i, j))
INF = 10e10
a, c = -INF, -INF
b, d = INF, INF
f... | output | 1 | 37,715 | 23 | 75,431 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,716 | 23 | 75,432 |
"Correct Solution:
```
#!/usr/bin/python3
# -*- coding: utf-8 -*-
H,W = map(int, input().split())
builds = []
for h in range(H):
l = str(input())
for w in range(W):
if l[w] == "B":
builds.append([h,w])
# [min,max]
lu = [H+W,0]
ld = [H+W,0]
for h,w in builds:
lu = [min(lu[0],h+w),max(lu[1],h+w)]
ld... | output | 1 | 37,716 | 23 | 75,433 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,717 | 23 | 75,434 |
"Correct Solution:
```
H, W = map(int,input().split())
s = []
for k in range(H):
s.append(input())
m1 = float("inf")
M1 = 0
m2 = float("inf")
M2 = 0
for k in range(H):
for l in range(W):
if s[k][l] == "B":
m1 = min(m1,k+l)
M1 = max(M1,k+l)
m2 = min(m2,W-1-l+k)
... | output | 1 | 37,717 | 23 | 75,435 |
Provide a correct Python 3 solution for this coding contest problem.
B: Hokkaido University Hard
Note
Please note that the question settings are the same as question A, except for the constraints.
story
Homura-chan, who passed Hokkaido University and is excited about the beginning of a new life. But in front of he... | instruction | 0 | 37,718 | 23 | 75,436 |
"Correct Solution:
```
H,W=map(int,input().split())
MAP=[list(input()) for i in range(H)]
BLIST=[]
for i in range(H):
for j in range(W):
if MAP[i][j]=="B":
BLIST.append([i,j])
BLIST.sort(key=lambda x:x[0]+x[1])
ANS=abs(BLIST[0][0]-BLIST[-1][0])+abs(BLIST[0][1]-BLIST[-1][1])
BLIST.sort(key=la... | output | 1 | 37,718 | 23 | 75,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.
The task is to draw a broken line that would go along the grid lines and that ... | instruction | 0 | 37,794 | 23 | 75,588 |
Tags: implementation, math
Correct Solution:
```
n,x,y=map(int,input().split())
a=[(n//2),(n//2)+1]
print(['YES','NO'][x in a and y in a])
``` | output | 1 | 37,794 | 23 | 75,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.
The task is to draw a broken line that would go along the grid lines and that ... | instruction | 0 | 37,795 | 23 | 75,590 |
Tags: implementation, math
Correct Solution:
```
n,x,y=map(int,input().split())
n=n//2
if (n==x or n==x-1) and (n==y or n==y-1):
print("NO")
else:
print("YES")
``` | output | 1 | 37,795 | 23 | 75,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.
The task is to draw a broken line that would go along the grid lines and that ... | instruction | 0 | 37,796 | 23 | 75,592 |
Tags: implementation, math
Correct Solution:
```
a,b,c=map(int,input().split())
a=a/2
if (a==b or a+1==b) and (a==c or a+1==c) :
print("NO")
else:
print("YES")
``` | output | 1 | 37,796 | 23 | 75,593 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.
The task is to draw a broken line that would go along the grid lines and that ... | instruction | 0 | 37,797 | 23 | 75,594 |
Tags: implementation, math
Correct Solution:
```
n, x, y = map(int, input().split())
n = n // 2
print('NO' if x in [n, n + 1] and y in [n, n + 1] else 'YES')
``` | output | 1 | 37,797 | 23 | 75,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.
The task is to draw a broken line that would go along the grid lines and that ... | instruction | 0 | 37,798 | 23 | 75,596 |
Tags: implementation, math
Correct Solution:
```
n, x, y = map(int, input().split())
n //= 2
print('NO' if n <= x <= n + 1 and n <= y <= n + 1 else 'YES')
``` | output | 1 | 37,798 | 23 | 75,597 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.