message stringlengths 2 19.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 322 108k | cluster float64 15 15 | __index_level_0__ int64 644 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,496 | 15 | 170,992 |
Yes | output | 1 | 85,496 | 15 | 170,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,497 | 15 | 170,994 |
Yes | output | 1 | 85,497 | 15 | 170,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,498 | 15 | 170,996 |
Yes | output | 1 | 85,498 | 15 | 170,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,499 | 15 | 170,998 |
No | output | 1 | 85,499 | 15 | 170,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,500 | 15 | 171,000 |
No | output | 1 | 85,500 | 15 | 171,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,501 | 15 | 171,002 |
No | output | 1 | 85,501 | 15 | 171,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,502 | 15 | 171,004 |
No | output | 1 | 85,502 | 15 | 171,005 |
Provide a correct Python 3 solution for this coding contest problem.
Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second. The other child is now at coordin... | instruction | 0 | 85,505 | 15 | 171,010 |
"Correct Solution:
```
a,v=list(map(int,input().split()))
b,w=list(map(int,input().split()))
t=int(input())
if w*t+(abs(a-b))<=v*t:
print("YES")
else:
print("NO")
``` | output | 1 | 85,505 | 15 | 171,011 |
Provide a correct Python 3 solution for this coding contest problem.
Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second. The other child is now at coordin... | instruction | 0 | 85,508 | 15 | 171,016 |
"Correct Solution:
```
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
m = abs(A-B)
if V*T >= m+W*T:
print('YES')
else:
print('NO')
``` | output | 1 | 85,508 | 15 | 171,017 |
Provide a correct Python 3 solution for this coding contest problem.
Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second. The other child is now at coordin... | instruction | 0 | 85,511 | 15 | 171,022 |
"Correct Solution:
```
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if(abs(a-b)>t*(v-w)):
print("NO")
else:
print("YES")
``` | output | 1 | 85,511 | 15 | 171,023 |
Provide a correct Python 3 solution for this coding contest problem.
Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.
Today's training is to quickly solve popular puzzles and train your instantaneous power. Today's challenge is a puzzl... | instruction | 0 | 85,682 | 15 | 171,364 |
"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**10
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 | 85,682 | 15 | 171,365 |
Provide a correct Python 3 solution for this coding contest problem.
Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.
Today's training is to quickly solve popular puzzles and train your instantaneous power. Today's challenge is a puzzl... | instruction | 0 | 85,683 | 15 | 171,366 |
"Correct Solution:
```
h, w = map(int, input().split())
mp = [input() for _ in range(h)]
points = {}
for y in range(h):
for x in range(w):
c = mp[y][x]
if c != ".":
if c not in points:
points[c] = [(x, y)]
else:
points[c].append((x, y))
keys = []
preventer = {}
for c, ps in point... | output | 1 | 85,683 | 15 | 171,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.
Today's training is to quickly solve popular puzzles and trai... | instruction | 0 | 85,684 | 15 | 171,368 |
No | output | 1 | 85,684 | 15 | 171,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.
Today's training is to quickly solve popular puzzles and trai... | instruction | 0 | 85,685 | 15 | 171,370 |
No | output | 1 | 85,685 | 15 | 171,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,887 | 15 | 171,774 |
Tags: constructive algorithms, implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
arr = [input() for i in range(n)]
a = arr[0][1]
b = arr[1][0]
c = arr[n-2][n-1]
d = arr[n-1][n-2]
if (a == b):
ans = []
if c == a:
ans.appen... | output | 1 | 85,887 | 15 | 171,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,888 | 15 | 171,776 |
Tags: constructive algorithms, implementation
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
arr=[]
for i in range(n):
temp=list(str(input()))
arr.append(temp)
change=[]
#print(arr)
if arr[0][1]==arr[1][0]:
if arr[0][1]=="1":
i... | output | 1 | 85,888 | 15 | 171,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,889 | 15 | 171,778 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def ans(a, n):
s1 = a[0][1]
s2 = a[1][0]
f2 = a[n-1][n-2]
f1 = a[n-2][n-1]
if f1==f2 and s1==s2 and f1!=s1:
print(0) #correct
elif f1==f2 and f1==s1 and s1==s2:
print(2)
#change s1 and s2
prin... | output | 1 | 85,889 | 15 | 171,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,890 | 15 | 171,780 |
Tags: constructive algorithms, implementation
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
r = []
for j in range(n):
temp = input()
r.append(temp)
s1, s2 = int(r[0][1]), int(r[1][0])
f1, f2 = int(r[-1][-2]), int(r[-2][-1])
if s1 == s2 and f1 == f2:
... | output | 1 | 85,890 | 15 | 171,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,891 | 15 | 171,782 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def solve():
n = int(input())
start_numbers = set()
finish_numbers = set()
matrix = list()
inversion = list()
for _ in range(n):
inp = list(input())
matrix.append(inp)
start_numbers.add(matrix[0][1])
start_numbers.add(matrix[1][0])
fi... | output | 1 | 85,891 | 15 | 171,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,892 | 15 | 171,784 |
Tags: constructive algorithms, implementation
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = [input() for _ in range(n)]
for color in range(2):
result = []
if int(a[0][1]) != color:
result.append((0, 1))
if int(a[1][0]) != color:
re... | output | 1 | 85,892 | 15 | 171,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,893 | 15 | 171,786 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def main():
for _ in range(int(input())):
n=int(input())
matx=[]
for j in range(n):
matx.append([str(x) for x in input()])
x=[int(matx[0][1]),int(matx[1][0])]
y=[int(matx[n-1][n-2]),int(matx[n-2]... | output | 1 | 85,893 | 15 | 171,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from exiting his room which can be seen as a grid.
... | instruction | 0 | 85,894 | 15 | 171,788 |
Tags: constructive algorithms, implementation
Correct Solution:
```
import sys
import math
import random
from typing import List
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
input = sys.stdin.readline
class Cell:
def __init__(self, a, row, col):
self.a = a
self.row = row
self.c... | output | 1 | 85,894 | 15 | 171,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,895 | 15 | 171,790 |
Yes | output | 1 | 85,895 | 15 | 171,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,896 | 15 | 171,792 |
Yes | output | 1 | 85,896 | 15 | 171,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,897 | 15 | 171,794 |
Yes | output | 1 | 85,897 | 15 | 171,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,898 | 15 | 171,796 |
Yes | output | 1 | 85,898 | 15 | 171,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,899 | 15 | 171,798 |
No | output | 1 | 85,899 | 15 | 171,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,900 | 15 | 171,800 |
No | output | 1 | 85,900 | 15 | 171,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,901 | 15 | 171,802 |
No | output | 1 | 85,901 | 15 | 171,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtube.com/watch?v=YR5ApYxkU-U), he wants to be able to walk freely, so they are blocking him from ... | instruction | 0 | 85,902 | 15 | 171,804 |
No | output | 1 | 85,902 | 15 | 171,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,593 | 15 | 173,186 |
Tags: implementation, math
Correct Solution:
```
def editor():
import sys
sys.stdin=open("input.txt",'r')
sys.stdout=open("output.txt",'w')
def solve():
n,q=map(int,input().split())
till= (n**2+1)//2
if n%2==0:
half=n//2
for _ in range(q):
x,y=map(int,input().split())
if (x+y)%2==0:
print((x-1)*hal... | output | 1 | 86,593 | 15 | 173,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,594 | 15 | 173,188 |
Tags: implementation, math
Correct Solution:
```
'''
n=eval(input())
print(n)
for i in range(n):
len=int(input())
s=input()
flag=True
for j in range(len):
d=abs(ord(s[j])-ord(s[len-1-j]))
if not(abs(d)==0 or abs(d)==2):
flag=False
break
if flag:
print('YES')
else :
print('NO')
'''
import sys
n,q=ma... | output | 1 | 86,594 | 15 | 173,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,595 | 15 | 173,190 |
Tags: implementation, math
Correct Solution:
```
import sys
n,q=map(int,sys.stdin.readline().split())
for _ in range(q):
x,y=map(int,sys.stdin.readline().split())
print( ((x-1)*n+y+1+(x+y)%2*n*n)//2 )
``` | output | 1 | 86,595 | 15 | 173,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,596 | 15 | 173,192 |
Tags: implementation, math
Correct Solution:
```
import sys
res = sys.stdin.readline().split()
n, query = int(res[0]), int(res[1])
for i in range(0, query):
result = sys.stdin.readline().split()
rows, columns = int(result[0]), int(result[1])
posicion = ((rows - 1) * n + columns)
ans = (posicion + 1) ... | output | 1 | 86,596 | 15 | 173,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,597 | 15 | 173,194 |
Tags: implementation, math
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
def solve(n, x, y):
r = (n * (x - 1) + (y - 1)) // 2 + 1 + int((x + y) % 2 == 1) * ((n ** 2) // 2 + int(n % 2 == 1))
return r
n, q = [int(s) for s in input().split(' ')]
for query in range(q):
x, y = [in... | output | 1 | 86,597 | 15 | 173,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,598 | 15 | 173,196 |
Tags: implementation, math
Correct Solution:
```
import math
import sys
inputlist=sys.stdin.readlines()
n,q=list(map(int,inputlist[0].split(' ')))
for i in range(q):
x,y=list(map(int,inputlist[i+1].split(' ')))
if((x+y)%2==0):
print(((x-1)*n+y+1)//2)
else:
initial_sum=(n*n+1)//2
print(initial_sum+((x-1)*n+y+1)... | output | 1 | 86,598 | 15 | 173,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,599 | 15 | 173,198 |
Tags: implementation, math
Correct Solution:
```
import sys
from array import array # noqa: F401
def readline(): return sys.stdin.buffer.readline().decode('utf-8')
n, q = map(int, readline().split())
ans = [0]*q
for i in range(q):
y, x = map(int, readline().split())
z = ((y-1) >> 1) * n + ((x + 1) >> 1)
... | output | 1 | 86,599 | 15 | 173,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size n × n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈ (n^2)/(2) ⌉ numbers from 1 to ⌈ (n^2)/(2) ⌉ are written in the cells with even sum of coordinates from left to right from top... | instruction | 0 | 86,600 | 15 | 173,200 |
Tags: implementation, math
Correct Solution:
```
n,q=map(int,input().split())
k=0
z=[]
for i in range(q):
x,y=map(int,input().split())
if n%2:
if (x+y)%2:
k=(n**2+1)//2
k+=(x-1)*n//2
k+=(y+1)//2
z.append(k)
else:
k=n//2*(x-1)
... | output | 1 | 86,600 | 15 | 173,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,823 | 15 | 173,646 |
Tags: math
Correct Solution:
```
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_lef... | output | 1 | 86,823 | 15 | 173,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,824 | 15 | 173,648 |
Tags: math
Correct Solution:
```
import sys
def In():
return sys.stdin.readline()
def Out(x):
return sys.stdout.write(str(x)+'\n')
def solve(x1,y1,x2,y2):
if x1==x2:
return abs(y2-y1)
if y1==y2:
return abs(x2-x1)
return abs(x2-x1)+2+abs(y2-y1)
t=int(In())
for i in rang... | output | 1 | 86,824 | 15 | 173,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,825 | 15 | 173,650 |
Tags: math
Correct Solution:
```
t = int(input())
for _ in range(t):
x1, y1, x2, y2 = map(int, input().split())
if x1 == x2 or y1 == y2:
print(abs(x2 - x1) + abs(y2 - y1))
else:
print(abs(x2 - x1) + abs(y2 - y1) + 2)
``` | output | 1 | 86,825 | 15 | 173,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,826 | 15 | 173,652 |
Tags: math
Correct Solution:
```
for _ in range(int(input())):
a, b, c, d = list(map(int, input().split()))
if a == c and b == d:
print(0)
elif a == c:
print(abs(b - d))
elif b == d:
print(abs(a - c))
else:
ans = abs(a - c) + abs(b - d) + 2
print(ans)
``` | output | 1 | 86,826 | 15 | 173,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,827 | 15 | 173,654 |
Tags: math
Correct Solution:
```
t = int(input())
for case in range(t):
X = [int(s) for s in input().split(' ')]
left = abs(X[0] - X[2])
up = abs(X[1] - X[3])
ans = left + up
if min(left, up) > 0:
ans += 2
print(ans)
``` | output | 1 | 86,827 | 15 | 173,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,828 | 15 | 173,656 |
Tags: math
Correct Solution:
```
t=int(input())
for i in range(t):
x1,y1,x2,y2=map(int,input().split())
if x1==x2:
print(abs(y1-y2))
elif y1==y2:
print(abs(x1-x2))
else:
print(abs(y1-y2)+abs(x1-x2)+2)
``` | output | 1 | 86,828 | 15 | 173,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,829 | 15 | 173,658 |
Tags: math
Correct Solution:
```
for i in range(int(input())):
a,b,c,d=list(map(int,input().split(' ')))
if abs(a-c)==0 or abs(b-d)==0:
print(abs(a-c)+abs(b-d))
else:
print(abs(a-c)+abs(b-d)+2)
``` | output | 1 | 86,829 | 15 | 173,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1... | instruction | 0 | 86,830 | 15 | 173,660 |
Tags: math
Correct Solution:
```
t = int(input())
for t0 in range(t):
a = list(map(int, input().split()))
print(abs(a[0] - a[2]) + abs(a[1] - a[3]) + 2 * ((a[0] != a[2]) and (a[1] != a[3])))
``` | output | 1 | 86,830 | 15 | 173,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. ... | instruction | 0 | 86,831 | 15 | 173,662 |
Yes | output | 1 | 86,831 | 15 | 173,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. ... | instruction | 0 | 86,832 | 15 | 173,664 |
Yes | output | 1 | 86,832 | 15 | 173,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. ... | instruction | 0 | 86,833 | 15 | 173,666 |
Yes | output | 1 | 86,833 | 15 | 173,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. ... | instruction | 0 | 86,834 | 15 | 173,668 |
Yes | output | 1 | 86,834 | 15 | 173,669 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.