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.
A 3Γ3 grid with a integer written in each square, is called a magic square if and only if the integers in each row, the integers in each column, and the integers in each diagonal (from the top l... | instruction | 0 | 92,514 | 23 | 185,028 |
No | output | 1 | 92,514 | 23 | 185,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A 3Γ3 grid with a integer written in each square, is called a magic square if and only if the integers in each row, the integers in each column, and the integers in each diagonal (from the top l... | instruction | 0 | 92,515 | 23 | 185,030 |
No | output | 1 | 92,515 | 23 | 185,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The following sorting operation is repeated for the stacked blocks as shown in Fig. A.
1. Stack all the bottom blocks (white blocks in Figure a) on the right edge (the remaining blocks will aut... | instruction | 0 | 92,539 | 23 | 185,078 |
No | output | 1 | 92,539 | 23 | 185,079 |
Provide a correct Python 3 solution for this coding contest problem.
There are a number of rectangles on the x-y plane. The four sides of the rectangles are parallel to either the x-axis or the y-axis, and all of the rectangles reside within a range specified later. There are no other constraints on the coordinates of... | instruction | 0 | 92,558 | 23 | 185,116 |
"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 | 92,558 | 23 | 185,117 |
Provide a correct Python 3 solution for this coding contest problem.
There are a number of rectangles on the x-y plane. The four sides of the rectangles are parallel to either the x-axis or the y-axis, and all of the rectangles reside within a range specified later. There are no other constraints on the coordinates of... | instruction | 0 | 92,559 | 23 | 185,118 |
"Correct Solution:
```
# coding: utf-8
import sys
sys.setrecursionlimit(1000000)
def check(i,j):
global n
global m
if m[i][j]==0:
m[i][j]=-1
if i+1<n*4+2:
check(i+1,j)
if i-1>=0:
check(i-1,j)
if j+1<n*4+2:
check(i,j+1)
if j-1>=0:
... | output | 1 | 92,559 | 23 | 185,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,959 | 23 | 185,918 |
Tags: geometry, implementation, math
Correct Solution:
```
# Fancy Fence
cases = int(input())
x = 0
while x < cases:
interiorAngle = int(input())
ExteriorAngle = 180 - interiorAngle
numOfEdgesFloat = 360 / ExteriorAngle
numOfEdgesInt = 360 // ExteriorAngle
if(numOfEdgesFloat == numOfEdgesInt):
... | output | 1 | 92,959 | 23 | 185,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,960 | 23 | 185,920 |
Tags: geometry, implementation, math
Correct Solution:
```
options = []
for n in range(3,361):
if 180*(n-2) % n == 0:
options.append(180*(n-2) // n)
cases = int(input())
for _ in range(cases):
if int(input()) in options:
print('YES')
else:
print('NO')
``` | output | 1 | 92,960 | 23 | 185,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,961 | 23 | 185,922 |
Tags: geometry, implementation, math
Correct Solution:
```
for i in range(int(input())):
a = int(input())
if 360%(180-a)==0:
print('YES')
else:
print('NO')
``` | output | 1 | 92,961 | 23 | 185,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,962 | 23 | 185,924 |
Tags: geometry, implementation, math
Correct Solution:
```
from math import gcd
for i in range(int(input())):
x = int(input())
gcf = gcd(x,180)
a,b = x//gcf,180//gcf
if b-a == 2 or b*2-a*2 == 2:#Odd and Even cases
print('YES')
else:
print('NO')
``` | output | 1 | 92,962 | 23 | 185,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,963 | 23 | 185,926 |
Tags: geometry, implementation, math
Correct Solution:
```
t = int(input())
for i in range(t):
angle = int(input())
if(360%(180 - angle) == 0):
print("YES")
else:
print("NO")
``` | output | 1 | 92,963 | 23 | 185,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,964 | 23 | 185,928 |
Tags: geometry, implementation, math
Correct Solution:
```
# Author : raj1307 - Raj Singh
# Date : 02.01.2020
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, ... | output | 1 | 92,964 | 23 | 185,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,965 | 23 | 185,930 |
Tags: geometry, implementation, math
Correct Solution:
```
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
ans = []
t = ini()
for ... | output | 1 | 92,965 | 23 | 185,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c... | instruction | 0 | 92,966 | 23 | 185,932 |
Tags: geometry, implementation, math
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
if 360 % (180-n) == 0:
print('YES')
else:
print('NO')
``` | output | 1 | 92,966 | 23 | 185,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,967 | 23 | 185,934 |
Yes | output | 1 | 92,967 | 23 | 185,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,968 | 23 | 185,936 |
Yes | output | 1 | 92,968 | 23 | 185,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,969 | 23 | 185,938 |
Yes | output | 1 | 92,969 | 23 | 185,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,970 | 23 | 185,940 |
Yes | output | 1 | 92,970 | 23 | 185,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,971 | 23 | 185,942 |
No | output | 1 | 92,971 | 23 | 185,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,972 | 23 | 185,944 |
No | output | 1 | 92,972 | 23 | 185,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,973 | 23 | 185,946 |
No | output | 1 | 92,973 | 23 | 185,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
He wants the fence to be a regular polygon. The robot builds the fence al... | instruction | 0 | 92,974 | 23 | 185,948 |
No | output | 1 | 92,974 | 23 | 185,949 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,407 | 23 | 186,814 |
"Correct Solution:
```
INF=1e8
path=[]
dp=[]
while(True):
try:
temp=list(map(int,input().split(',')))
path.append(temp)
dp.append([INF for i in range(len(temp))])
except:
break
dp[0][0]=path[0][0]
for i in range(1,len(dp)):
for j in range(len(dp[i])):
if len(dp[i])>le... | output | 1 | 93,407 | 23 | 186,815 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,408 | 23 | 186,816 |
"Correct Solution:
```
import sys
s=[list(map(int,e.split(',')))for e in sys.stdin]
for i in range(1,len(s)):
for j in range(len(s[i])):
b=len(s[i])>len(s[i-1])
s[i][j]+=max(s[i-1][(j-b)*(j>0):j+2-b])
print(*s[-1])
``` | output | 1 | 93,408 | 23 | 186,817 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,409 | 23 | 186,818 |
"Correct Solution:
```
path=[]
while(True):
try:
temp=list(map(int,input().split(',')))
path.append(temp)
except:
break
path[0][0]
for i in range(1,len(path)):
for j in range(len(path[i])):
if len(path[i])>len(path[i-1]):
start=0 if j<1 else j-1
path[i... | output | 1 | 93,409 | 23 | 186,819 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,410 | 23 | 186,820 |
"Correct Solution:
```
import sys
s=[list(map(int,e.split(',')))for e in sys.stdin]
for i in range(1,len(s)):
k=len(s[i])
for j in range(k):
t=j-(k>len(s[i-1]))
s[i][j]+=max(s[i-1][t*(j>0):t+2])
print(*s[-1])
``` | output | 1 | 93,410 | 23 | 186,821 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,411 | 23 | 186,822 |
"Correct Solution:
```
diamond=[]
path=[]
while True:
try:
s=[int(i) for i in input().split(",")]
if(len(diamond)==0):
diamond.append(s)
path.append(s)
elif(len(diamond[-1])<len(s)):
diamond.append(s)
_path=[path[-1][0]+s[0]]
for i ... | output | 1 | 93,411 | 23 | 186,823 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,412 | 23 | 186,824 |
"Correct Solution:
```
while 1:
try:
count = 0
rom = []
while count != 2:
N = list(map(int, input().split(",")))
if len(N) == 1:
count += 1
rom.append(N)
half = len(rom) // 2
for i in range(1, len(rom)):
for j i... | output | 1 | 93,412 | 23 | 186,825 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,413 | 23 | 186,826 |
"Correct Solution:
```
import sys
path=[list(map(int,e.split(',')))for e in sys.stdin]
for i in range(1,len(path)):
for j in range(len(path[i])):
if len(path[i])>len(path[i-1]):
start=0 if j<1 else j-1
path[i][j]+=max(path[i-1][start:j+1])
else:
path[i][j]+=max(pa... | output | 1 | 93,413 | 23 | 186,827 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the sum of the integers that pass when starting from the top a... | instruction | 0 | 93,414 | 23 | 186,828 |
"Correct Solution:
```
import sys
s=[list(map(int,e.split(',')))for e in sys.stdin]
for i in range(1,len(s)):
k=len(s[i]);b=k>len(s[i-1])
for j in range(k):
t=j-b;s[i][j]+=max(s[i-1][t*(j>0):t+2])
print(*s[-1])
``` | output | 1 | 93,414 | 23 | 186,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,415 | 23 | 186,830 |
Yes | output | 1 | 93,415 | 23 | 186,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,416 | 23 | 186,832 |
Yes | output | 1 | 93,416 | 23 | 186,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,417 | 23 | 186,834 |
Yes | output | 1 | 93,417 | 23 | 186,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,418 | 23 | 186,836 |
Yes | output | 1 | 93,418 | 23 | 186,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,419 | 23 | 186,838 |
No | output | 1 | 93,419 | 23 | 186,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,420 | 23 | 186,840 |
No | output | 1 | 93,420 | 23 | 186,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,421 | 23 | 186,842 |
No | output | 1 | 93,421 | 23 | 186,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Arrange integers (0 or more and 99 or less) in a rhombus as illustrated in Fig. 1. Create a program that reads the data representing the rhombus and outputs the maximum value of the su... | instruction | 0 | 93,422 | 23 | 186,844 |
No | output | 1 | 93,422 | 23 | 186,845 |
Provide a correct Python 3 solution for this coding contest problem.
Open Binary and Object Group organizes a programming contest every year. Mr. Hex belongs to this group and joins the judge team of the contest. This year, he created a geometric problem with its solution for the contest. The problem required a set of... | instruction | 0 | 93,478 | 23 | 186,956 |
"Correct Solution:
```
from collections import defaultdict
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def gcd(m, n):
while n:
m, n = n, m % n
return m
def solve():
N = int(readline())
P = [list(map(int, readline().split())) for i in range(N)]
ok = 0
x0, y0 = P[0]; ... | output | 1 | 93,478 | 23 | 186,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Ma... | instruction | 0 | 93,528 | 23 | 187,056 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import math
t = int(input())
L = [int(x) for x in input().split()]
L.sort()
ma = max(L)
S = 2*sum(L)
Div = []
for i in range(1,int(math.sqrt(t))+1):
if t%i == 0:
Div.append(i)
Div.append(t//i)
if len(Div) >= 2:
if... | output | 1 | 93,528 | 23 | 187,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Ma... | instruction | 0 | 93,529 | 23 | 187,058 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import functools
import time
def timer(func):
@functools.wraps(func)
def wrapper(*args, **kwargs):
stime = time.perf_counter()
res = func(*args, **kwargs)
elapsed = time.perf_counter() - stime
print... | output | 1 | 93,529 | 23 | 187,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Ma... | instruction | 0 | 93,530 | 23 | 187,060 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
from collections import Counter as c
def maker(m, n, x, y, a):
small, larg = min(x, y), max(x, y)
k1 = [i + 1 for i in range(small)] + [small for i in range(small, larg)] + [small + larg - i - 1 for i in range(larg, small + larg)]... | output | 1 | 93,530 | 23 | 187,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Ma... | instruction | 0 | 93,531 | 23 | 187,062 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
def get(n,m,a,b,t):
freq=[0]*(t+1)
for i in range(n):
for j in range(m):
val=abs(i-a)+abs(j-b)
freq[val]+=1
return freq
t=int(input())
a=list(map(int,input().split()))
mx=max(a)
f=[0]*(t+1)
for i... | output | 1 | 93,531 | 23 | 187,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Ma... | instruction | 0 | 93,532 | 23 | 187,064 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
from math import sqrt
from collections import Counter
def f(h, w, y, x):
return h * w * (h + w - (x + y + 1) * 2) // 2 + h * x * (x + 1) + w * y * (y + 1)
def check(h, w, y, x, cnt):
for i in range(1, y + 1):
for j in r... | output | 1 | 93,532 | 23 | 187,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Ma... | instruction | 0 | 93,533 | 23 | 187,066 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import sys
from collections import Counter
from itertools import chain
def i_ints():
return map(int, sys.stdin.readline().split())
def check(w, h, x, y, c):
counts = Counter(chain.from_iterable(range(abs(i-x), abs(i-x)+y) for i i... | output | 1 | 93,533 | 23 | 187,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exac... | instruction | 0 | 93,534 | 23 | 187,068 |
No | output | 1 | 93,534 | 23 | 187,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exac... | instruction | 0 | 93,535 | 23 | 187,070 |
No | output | 1 | 93,535 | 23 | 187,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exac... | instruction | 0 | 93,536 | 23 | 187,072 |
No | output | 1 | 93,536 | 23 | 187,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya has just learned the basics of matrices, she decided to play with them a little bit.
Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exac... | instruction | 0 | 93,537 | 23 | 187,074 |
No | output | 1 | 93,537 | 23 | 187,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nowadays all circuses in Berland have a round arena with diameter 13 meters, but in the past things were different.
In Ancient Berland arenas in circuses were shaped as a regular (equiangular) polygon, the size and the number of angles coul... | instruction | 0 | 93,779 | 23 | 187,558 |
Tags: geometry, math
Correct Solution:
```
import math
EPSILON = 0.0001
def radians(x1, y1, x2, y2):
product = x1*x2 + y1*y2
norm1 = (x1*x1+y1*y1) ** 0.5
norm2 = (x2*x2+y2*y2) ** 0.5
cosVal = max(-1, min(1, product/norm1/norm2))
return math.acos(cosVal)
x1, y1 = map(float, input().split(" "))
x2, ... | output | 1 | 93,779 | 23 | 187,559 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nowadays all circuses in Berland have a round arena with diameter 13 meters, but in the past things were different.
In Ancient Berland arenas in circuses were shaped as a regular (equiangular) polygon, the size and the number of angles coul... | instruction | 0 | 93,780 | 23 | 187,560 |
Tags: geometry, math
Correct Solution:
```
from math import *
def rt(x, y):
return sum((i - j) ** 2 for i, j in zip(x, y))
def tr(a, b, c):
return acos((b + c - a) / (2 * (b * c) ** 0.5)) / pi
def trt(x, n):
return 0.01 < (x * n) % 1 < 0.99
x, y, z = (tuple(map(float, input().split())) for i in range(3))
a,... | output | 1 | 93,780 | 23 | 187,561 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.