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.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at least D.
Decide whether it is possible to place all N flag... | instruction | 0 | 15,706 | 23 | 31,412 |
"Correct Solution:
```
mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.buffer.readline
from collections import deque
# compressed[v]: 縮約後のグラフで縮約前のvが属する頂点
# num: 縮約後のグラフの頂点数
# 縮約後のグラフの頂点番号はトポロジカル順
def SCC(adj, adj_rev):
N = len(adj) - 1
seen = [0] * (... | output | 1 | 15,706 | 23 | 31,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at lea... | instruction | 0 | 15,707 | 23 | 31,414 |
Yes | output | 1 | 15,707 | 23 | 31,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at lea... | instruction | 0 | 15,708 | 23 | 31,416 |
Yes | output | 1 | 15,708 | 23 | 31,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at lea... | instruction | 0 | 15,709 | 23 | 31,418 |
Yes | output | 1 | 15,709 | 23 | 31,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at lea... | instruction | 0 | 15,710 | 23 | 31,420 |
Yes | output | 1 | 15,710 | 23 | 31,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at lea... | instruction | 0 | 15,711 | 23 | 31,422 |
No | output | 1 | 15,711 | 23 | 31,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider placing N flags on a line. Flags are numbered through 1 to N.
Flag i can be placed on the coordinate X_i or Y_i. For any two different flags, the distance between them should be at lea... | instruction | 0 | 15,712 | 23 | 31,424 |
No | output | 1 | 15,712 | 23 | 31,425 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,732 | 23 | 31,464 |
"Correct Solution:
```
n=int(input())
if n%3==0:
for i in range(n//3):
print("a.."*(n//3))
print("a.."*(n//3))
print(".aa"*(n//3))
elif n%2==0 and n>=4:
x="aacd"+"."*(n-4)
y="bbcd"+"."*(n-4)
for i in range(n//2):
print(x)
print(y)
x=x[2:]+x[:2]
y=y... | output | 1 | 15,732 | 23 | 31,465 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,733 | 23 | 31,466 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
n = int(input())
pata = ["abb",
"a.c",
"ddc"]
patb = ["abcc",
"abdd",
"eefg",
"hhfg"]
patc = ["abbcc",
"ad..e",
"fd..e",
"f.ggh",
"iijjh"]
patd = [".aab... | output | 1 | 15,733 | 23 | 31,467 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,734 | 23 | 31,468 |
"Correct Solution:
```
n = int(input())
if n == 2:
print(-1)
if n == 3:
print("aa.")
print("..b")
print("..b")
if n == 4:
ans = ["aabc","ddbc","bcaa","bcdd"]
print(*ans,sep="\n")
if n == 5:
ans = ["aabbc","dde.c","..eab","a..ab","accdd"]
print(*ans,sep="\n")
if n == 6:
ans = ["aa.bbc","..de.c","..deff... | output | 1 | 15,734 | 23 | 31,469 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,735 | 23 | 31,470 |
"Correct Solution:
```
def GCD(x,y):
if y == 0:
return x
else:
return GCD(y,x%y)
N = int(input())
if N == 2:
print(-1)
exit()
if N == 7:
ans = [".aabbcc",
"c..ddee",
"c..ffgg",
"hij....",
"hij....",
"klm....",
"klm..... | output | 1 | 15,735 | 23 | 31,471 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,736 | 23 | 31,472 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(input())
#n, op = [i for i in readline().split()]
a21 = [["a","a"],["b","b"]]
a22 = [["c","d"],["c","d"]]
a3 = [["a","a","."],[".",".","b"],[".",".","b"]]
a4 = [["q","q","r","s"]... | output | 1 | 15,736 | 23 | 31,473 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,737 | 23 | 31,474 |
"Correct Solution:
```
n = int(input())
if n % 3 == 0:
m = n // 3
for i in range(m):
print('.' * (3 * i) + 'abb' + '.' * (n - 3 - 3 * i))
print('.' * (3 * i) + 'a.a' + '.' * (n - 3 - 3 * i))
print('.' * (3 * i) + 'bba' + '.' * (n - 3 - 3 * i))
elif n % 4 == 0:
m = n // 4
for i i... | output | 1 | 15,737 | 23 | 31,475 |
Provide a correct Python 3 solution for this coding contest problem.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.
For each row of the grid, le... | instruction | 0 | 15,738 | 23 | 31,476 |
"Correct Solution:
```
def join(xs, N):
n = len(xs)
r = ""
s = 0
for i, x in enumerate(xs):
x = x.strip()
t = len(x.split())
S,E="."*s,"."*(N-t-s)
for l in x.split():
r+=S+l+E+"\n"
s += t
return r
s7="""
.bc.a..
.bc.a..
..aabba
aab...a
x.baa..
x..b... | output | 1 | 15,738 | 23 | 31,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,739 | 23 | 31,478 |
Yes | output | 1 | 15,739 | 23 | 31,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,740 | 23 | 31,480 |
Yes | output | 1 | 15,740 | 23 | 31,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,741 | 23 | 31,482 |
Yes | output | 1 | 15,741 | 23 | 31,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,742 | 23 | 31,484 |
Yes | output | 1 | 15,742 | 23 | 31,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,743 | 23 | 31,486 |
No | output | 1 | 15,743 | 23 | 31,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,744 | 23 | 31,488 |
No | output | 1 | 15,744 | 23 | 31,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,745 | 23 | 31,490 |
No | output | 1 | 15,745 | 23 | 31,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be cov... | instruction | 0 | 15,746 | 23 | 31,492 |
No | output | 1 | 15,746 | 23 | 31,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are several rectangular sheets placed on a flat surface. Create a program to find the area and perimeter of the part covered by these sheets.
However, when the plane is regarded as the co... | instruction | 0 | 15,875 | 23 | 31,750 |
No | output | 1 | 15,875 | 23 | 31,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are several rectangular sheets placed on a flat surface. Create a program to find the area and perimeter of the part covered by these sheets.
However, when the plane is regarded as the co... | instruction | 0 | 15,876 | 23 | 31,752 |
No | output | 1 | 15,876 | 23 | 31,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are several rectangular sheets placed on a flat surface. Create a program to find the area and perimeter of the part covered by these sheets.
However, when the plane is regarded as the co... | instruction | 0 | 15,877 | 23 | 31,754 |
No | output | 1 | 15,877 | 23 | 31,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are several rectangular sheets placed on a flat surface. Create a program to find the area and perimeter of the part covered by these sheets.
However, when the plane is regarded as the co... | instruction | 0 | 15,878 | 23 | 31,756 |
No | output | 1 | 15,878 | 23 | 31,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,933 | 23 | 31,866 |
Tags: geometry, number theory
Correct Solution:
```
n, m, k = map(int, input().split())
s = n*m / k
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b, a%b)
if 2*n*m % k == 0:
f = True
if(k % 2 == 0):
k //= 2
f = False
print("YES")
a = n / gcd(n, k)
b = m*gcd(n, k) / k
if(f):
if(a < n): a *= ... | output | 1 | 15,933 | 23 | 31,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,934 | 23 | 31,868 |
Tags: geometry, number theory
Correct Solution:
```
import math
a,b,c=map(int,input().split())
ans1=2*a
ans2=b
v=math.gcd(ans1,c)
ans1//=v
c//=v
v=math.gcd(ans2,c)
ans2//=v
c//=v
if c!=1 :
print("NO")
exit()
if ans1>a :
ans1,ans2=int(ans1/2),ans2*2
print("YES")
print(0,0)
print(ans1,0)
print(0,ans2)
``` | output | 1 | 15,934 | 23 | 31,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,935 | 23 | 31,870 |
Tags: geometry, number theory
Correct Solution:
```
from sys import stdin, stdout
input = stdin.buffer.readline
#print = stdout.write
n, m, k = map(int, input().split())
if 2 * n * m % k == 0:
i = 2
t = k
N = n
while i * i <= k:
while t % i == 0 and (n % i == 0 or m % i == 0):
t //= i
if n % i == 0:
n ... | output | 1 | 15,935 | 23 | 31,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,936 | 23 | 31,872 |
Tags: geometry, number theory
Correct Solution:
```
def nod(a, b):
if(a == 0 or b == 0):
return a + b
if(a > b):
return nod(b, a % b)
else:
return nod(a, b % a)
n, m, k = map(int, input().split())
n2 = n // nod(n, k)
k = k // nod(n, k)
m2 = m // nod(m, k)
k = k // nod(m, k)
if(k >... | output | 1 | 15,936 | 23 | 31,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,937 | 23 | 31,874 |
Tags: geometry, number theory
Correct Solution:
```
def gcd(a, b):
if a==0:
return b
elif b==0:
return a
else:
if a>b:
return gcd (a%b, b)
else:
return gcd (a, b%a)
n, m, k = map(int, input().split())
n1, m1, k1=n, m, k
f=0
if (2*m*n)%k!=0:
print ("NO")
else:
f=0
if k%2==0:
... | output | 1 | 15,937 | 23 | 31,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,938 | 23 | 31,876 |
Tags: geometry, number theory
Correct Solution:
```
n,m,k=map(int,input().split())
from math import gcd
if (n*m)/k-(n*m)//k!=0 and (n*m)/k-(n*m)//k!=0.5:
print("NO")
else:
a=2*n
b=2*m
g1=gcd(a,k)
g2=gcd(b,k)
x=a//g1
y=m//(k//g1)
c=b//g2
d=n//(k//g2)
if x<=n and y<=m:
prin... | output | 1 | 15,938 | 23 | 31,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,939 | 23 | 31,878 |
Tags: geometry, number theory
Correct Solution:
```
import math
import time
from collections import defaultdict,deque,Counter
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
from queue import PriorityQueue
import sys
def gcd(a,b):
if(b==0):
return a
return gcd(b,a%b)
n,m,k=map... | output | 1 | 15,939 | 23 | 31,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,940 | 23 | 31,880 |
Tags: geometry, number theory
Correct Solution:
```
n, m, k = map(int, input().split())
if (n * m * 2) % k != 0:
print("NO")
exit()
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
div = 0
if k % 2 == 0:
k //= 2
div = 1
g = gcd(n, k)
a = n // g
b = (m * g) // k
if not div:
if 2 ... | output | 1 | 15,940 | 23 | 31,881 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.
... | instruction | 0 | 15,941 | 23 | 31,882 |
Tags: geometry, number theory
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
from fractions import gcd
pr = stdout.write
mod=10**9+7
def ni():
return int(raw_input())
def li():
return... | output | 1 | 15,941 | 23 | 31,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,942 | 23 | 31,884 |
Yes | output | 1 | 15,942 | 23 | 31,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,943 | 23 | 31,886 |
Yes | output | 1 | 15,943 | 23 | 31,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,944 | 23 | 31,888 |
Yes | output | 1 | 15,944 | 23 | 31,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,945 | 23 | 31,890 |
Yes | output | 1 | 15,945 | 23 | 31,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,946 | 23 | 31,892 |
No | output | 1 | 15,946 | 23 | 31,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,947 | 23 | 31,894 |
No | output | 1 | 15,947 | 23 | 31,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,948 | 23 | 31,896 |
No | output | 1 | 15,948 | 23 | 31,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,949 | 23 | 31,898 |
No | output | 1 | 15,949 | 23 | 31,899 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the tri... | instruction | 0 | 15,950 | 23 | 31,900 |
No | output | 1 | 15,950 | 23 | 31,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four different integer points p_1, p_2, p_3 and p_4 on XY grid.
In one step you can choose one of the points p_i and move it in one of four directions by one. In other words, if y... | instruction | 0 | 16,186 | 23 | 32,372 |
Yes | output | 1 | 16,186 | 23 | 32,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four different integer points p_1, p_2, p_3 and p_4 on XY grid.
In one step you can choose one of the points p_i and move it in one of four directions by one. In other words, if y... | instruction | 0 | 16,187 | 23 | 32,374 |
Yes | output | 1 | 16,187 | 23 | 32,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four different integer points p_1, p_2, p_3 and p_4 on XY grid.
In one step you can choose one of the points p_i and move it in one of four directions by one. In other words, if y... | instruction | 0 | 16,188 | 23 | 32,376 |
Yes | output | 1 | 16,188 | 23 | 32,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four different integer points p_1, p_2, p_3 and p_4 on XY grid.
In one step you can choose one of the points p_i and move it in one of four directions by one. In other words, if y... | instruction | 0 | 16,189 | 23 | 32,378 |
Yes | output | 1 | 16,189 | 23 | 32,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four different integer points p_1, p_2, p_3 and p_4 on XY grid.
In one step you can choose one of the points p_i and move it in one of four directions by one. In other words, if y... | instruction | 0 | 16,190 | 23 | 32,380 |
No | output | 1 | 16,190 | 23 | 32,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four different integer points p_1, p_2, p_3 and p_4 on XY grid.
In one step you can choose one of the points p_i and move it in one of four directions by one. In other words, if y... | instruction | 0 | 16,191 | 23 | 32,382 |
No | output | 1 | 16,191 | 23 | 32,383 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.