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.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,139 | 23 | 50,278 |
Yes | output | 1 | 25,139 | 23 | 50,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,140 | 23 | 50,280 |
Yes | output | 1 | 25,140 | 23 | 50,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,141 | 23 | 50,282 |
Yes | output | 1 | 25,141 | 23 | 50,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,142 | 23 | 50,284 |
No | output | 1 | 25,142 | 23 | 50,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,143 | 23 | 50,286 |
No | output | 1 | 25,143 | 23 | 50,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,144 | 23 | 50,288 |
No | output | 1 | 25,144 | 23 | 50,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,145 | 23 | 50,290 |
No | output | 1 | 25,145 | 23 | 50,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,156 | 23 | 50,312 |
Tags: constructive algorithms
Correct Solution:
```
import sys
def check(arr):
n = len(arr)
for i in range(n):
for j in range(i + 1, n):
diff = 0
for k in range(n):
if arr[i][k] == arr[j][k]:
diff += 1
else:
... | output | 1 | 25,156 | 23 | 50,313 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,157 | 23 | 50,314 |
Tags: constructive algorithms
Correct Solution:
```
n = int(input())
ans=[[1]]
k=0
while k<n:
k+=1
for i in range(len(ans)):
ans[i].extend(ans[i])
for i in range(len(ans)):
ans.append(ans[i][:])
for i in range(int(len(ans)/2),len(ans)):
for j in range(int(len(ans[i])/2),len(a... | output | 1 | 25,157 | 23 | 50,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,158 | 23 | 50,316 |
Tags: constructive algorithms
Correct Solution:
```
n = int(input())
h = [1]
for i in range(n):
if i == 0:
h = [[1,1], [1,-1]]
else:
x = []
for row in h:
p = row.copy()
p.extend(p)
x.append(p)
for row in h:
p = row.copy()... | output | 1 | 25,158 | 23 | 50,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,159 | 23 | 50,318 |
Tags: constructive algorithms
Correct Solution:
```
from functools import reduce
from operator import *
from math import *
from sys import *
from string import *
from collections import *
setrecursionlimit(10**7)
dX= [-1, 1, 0, 0,-1, 1,-1, 1]
dY= [ 0, 0,-1, 1, 1,-1,-1, 1]
RI=lambda: list(map(int,input().split()))
RS=la... | output | 1 | 25,159 | 23 | 50,319 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,160 | 23 | 50,320 |
Tags: constructive algorithms
Correct Solution:
```
inv=lambda t:''.join('*'if u=='+'else'+'for u in t)
n=int(input())
r=['+']
for _ in range(n):
r=[r[i] * 2 for i in range(len(r))] + [r[i]+inv(r[i]) for i in range(len(r))]
print(*r,sep='\n')
``` | output | 1 | 25,160 | 23 | 50,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,161 | 23 | 50,322 |
Tags: constructive algorithms
Correct Solution:
```
def vec(x):
if x == 0:
return [[1]]
x -= 1
s = vec(x)
y = vec(x)
for i in range(2**x):
for j in range(2**x):
y[i][j] = -y[i][j]
a = [s[i]+y[i] for i in range(2**x)]
b = [s[i]+s[i] for i in range(2**x)]
return a + b
x = int(input())
s = vec(x)
for i in ... | output | 1 | 25,161 | 23 | 50,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,162 | 23 | 50,324 |
Tags: constructive algorithms
Correct Solution:
```
def f(n):
if n == 0:
return ["+"]
else:
pat = f(n-1)
new = [c+c for c in pat]
new.extend(["".join(["+" if d == "*" else "*" for d in c]) + c for c in pat])
return new
n = int(input())
for i in f(n):
print(i)
``` | output | 1 | 25,162 | 23 | 50,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task:... | instruction | 0 | 25,163 | 23 | 50,326 |
Tags: constructive algorithms
Correct Solution:
```
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
#from __future__ import print_function, division #while using python2
# from itertools impo... | output | 1 | 25,163 | 23 | 50,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,164 | 23 | 50,328 |
Yes | output | 1 | 25,164 | 23 | 50,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,165 | 23 | 50,330 |
Yes | output | 1 | 25,165 | 23 | 50,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,166 | 23 | 50,332 |
Yes | output | 1 | 25,166 | 23 | 50,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,167 | 23 | 50,334 |
Yes | output | 1 | 25,167 | 23 | 50,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,168 | 23 | 50,336 |
No | output | 1 | 25,168 | 23 | 50,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,169 | 23 | 50,338 |
No | output | 1 | 25,169 | 23 | 50,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,170 | 23 | 50,340 |
No | output | 1 | 25,170 | 23 | 50,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson ... | instruction | 0 | 25,171 | 23 | 50,342 |
No | output | 1 | 25,171 | 23 | 50,343 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is the error caused by the rounding that occurs when repre... | instruction | 0 | 25,550 | 23 | 51,100 |
"Correct Solution:
```
def gcd(a,b):
while b:a,b=b,a%b
return a
if __name__=="__main__":
a,b=map(int,input().split())
b//=gcd(a,b)
a,c=2,1
while a**2<=b:
if b%a==0:
c*=a
while b%a==0: b//=a
a+=1
print(c if b==1 else c*b)
``` | output | 1 | 25,550 | 23 | 51,101 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is the error caused by the rounding that occurs when repre... | instruction | 0 | 25,551 | 23 | 51,102 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return li... | output | 1 | 25,551 | 23 | 51,103 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is the error caused by the rounding that occurs when repre... | instruction | 0 | 25,553 | 23 | 51,106 |
"Correct Solution:
```
def gcd(a, b):
while b: a, b = b, a % b
return a
a,b=map(int,input().split())
b//=gcd(a,b)
a,c=2,1
while a*a<=b:
if b%a==0:
c*=a
while b%a==0:b//=a
a+=1
print([c*b,c][b==1])
``` | output | 1 | 25,553 | 23 | 51,107 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is the error caused by the rounding that occurs when repre... | instruction | 0 | 25,556 | 23 | 51,112 |
"Correct Solution:
```
import math
p,q=map(int,input().split())
q//=math.gcd(p,q)
i=2
a=1
while i*i<=q:
if q%i==0:
a*=i
while q%i==0:
q//=i
i+=1
print(a*q)
``` | output | 1 | 25,556 | 23 | 51,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is... | instruction | 0 | 25,558 | 23 | 51,116 |
Yes | output | 1 | 25,558 | 23 | 51,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is... | instruction | 0 | 25,559 | 23 | 51,118 |
No | output | 1 | 25,559 | 23 | 51,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is... | instruction | 0 | 25,560 | 23 | 51,120 |
No | output | 1 | 25,560 | 23 | 51,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is... | instruction | 0 | 25,561 | 23 | 51,122 |
No | output | 1 | 25,561 | 23 | 51,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is... | instruction | 0 | 25,562 | 23 | 51,124 |
No | output | 1 | 25,562 | 23 | 51,125 |
Provide a correct Python 3 solution for this coding contest problem.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output | instruction | 0 | 25,569 | 23 | 51,138 |
"Correct Solution:
```
V,E,F=map(int,input().split())
EDGE=dict()
EDGE2=[[] for i in range(V)]
for i in range(E):
x,to,c,d=map(int,input().split())
EDGE[(x,to)]=[c,d]
EDGE2[x].append(to)
BACK=[-1]*V
P=[0]*V
# 一回ベルマンフォードをしてポテンシャルを求める.
ANS=[float("inf")]*V
ANS[0]=0
for rep in range(V):
for x,to i... | output | 1 | 25,569 | 23 | 51,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,685 | 23 | 51,370 |
Tags: implementation, math
Correct Solution:
```
#code
p=10**9+7
h,w = map(int,input().split())
r = list(map(int,input().split()))
c = list(map(int,input().split()))
grid=[]
f=0
x=0
for i in range(h):
l = list('1'*r[i]+'2'+'0'*(w-r[i]-1))
grid.append(l)
#print(grid)
for i in range(w):
if c[i]==0 and grid[0... | output | 1 | 25,685 | 23 | 51,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,686 | 23 | 51,372 |
Tags: implementation, math
Correct Solution:
```
def powe(a,b,mod):
res = 1
a = a%mod
while b>0:
if(b&1==1):
res = (res*a)%mod
b=b>>1
a = (a*a)%mod
return res
h,w = map(int,input().split())
ri = list(map(int,input().split()))
ci = list(map(int,input().split()))
const = [[0 for _ in range(w)] for _ in range... | output | 1 | 25,686 | 23 | 51,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,687 | 23 | 51,374 |
Tags: implementation, math
Correct Solution:
```
#import collections
# import random
# import math
#import itertools
#import math
#mport math
from collections import defaultdict
# import itertools
# from sys import stdin, stdout
#import math
import sys
# import operator
# from decimal import Decimal
# sys.setrecursion... | output | 1 | 25,687 | 23 | 51,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,688 | 23 | 51,376 |
Tags: implementation, math
Correct Solution:
```
h,w=map(int,input().split())
ar=list(map(int,input().split()))
br=list(map(int,input().split()))
flag=True
count=0
for i in range(h):
for j in range(w):
c_1=''
c_2=''
if(ar[i]>j):
c_1='B'
elif(ar[i]<j):
c_1='E'
... | output | 1 | 25,688 | 23 | 51,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,689 | 23 | 51,378 |
Tags: implementation, math
Correct Solution:
```
a,b = map(int, input().split())
h = map(int, input().split())
v = map(int, input().split())
room = [-1 for j in range(a*b)]
for ind, i in enumerate(h):
for j in range(i):
room[b*ind + j] = 1
if i != b:
room[b*ind + i] = 0
#print(room)
for ind, i ... | output | 1 | 25,689 | 23 | 51,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,690 | 23 | 51,380 |
Tags: implementation, math
Correct Solution:
```
h, w = map(int, input().split())
*r, = map(int, input().split())
*c, = map(int, input().split())
s = h*w
minc = [0]*w
for i in range(0, h):
s -= r[i]
if r[i] != w:
s -= 1
if r[i] < w and c[r[i]] >= i+1:
print(0)
exit()
for j in range(w):
if j < r[... | output | 1 | 25,690 | 23 | 51,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,691 | 23 | 51,382 |
Tags: implementation, math
Correct Solution:
```
mod = 1000000007
def fexp(x, y):
ans = 1
while y > 0:
if y % 2 == 1:
ans = ans * x % mod
x = x * x % mod
y //= 2
return ans
h, w = map(int, input().split(' '))
r = list(map(int, input().split(' ')))
c = list(map(int, in... | output | 1 | 25,691 | 23 | 51,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i ≤ h). In particular, r_i=0 if the leftmost cel... | instruction | 0 | 25,692 | 23 | 51,384 |
Tags: implementation, math
Correct Solution:
```
R=lambda:map(int,input().split())
h,w=map(range,R())
r=*R(),0
c=*R(),0
print((pow(2,sum(i>c[j]and j>r[i]for i in h
for j in w),10**9+7),0)[any(i<c[r[i]]for
i in h)|any(i<r[c[i]]for i in w)])
``` | output | 1 | 25,692 | 23 | 51,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,693 | 23 | 51,386 |
Yes | output | 1 | 25,693 | 23 | 51,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,694 | 23 | 51,388 |
Yes | output | 1 | 25,694 | 23 | 51,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,695 | 23 | 51,390 |
Yes | output | 1 | 25,695 | 23 | 51,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,696 | 23 | 51,392 |
Yes | output | 1 | 25,696 | 23 | 51,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,697 | 23 | 51,394 |
No | output | 1 | 25,697 | 23 | 51,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,698 | 23 | 51,396 |
No | output | 1 | 25,698 | 23 | 51,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,699 | 23 | 51,398 |
No | output | 1 | 25,699 | 23 | 51,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Suppose there is a h × w grid consisting of empty or full cells. Let's make some definitions:
* r_{i} is the number of consecutive full cells connected to the left side in the i-th row (1 ≤ i... | instruction | 0 | 25,700 | 23 | 51,400 |
No | output | 1 | 25,700 | 23 | 51,401 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates,... | instruction | 0 | 25,872 | 23 | 51,744 |
Tags: brute force, geometry
Correct Solution:
```
def checkTri(points):
d1 = (points[0] - points[2]) ** 2 + (points[1] - points[3]) ** 2
d2 = (points[0] - points[4]) ** 2 + (points[1] - points[5]) ** 2
d3 = (points[2] - points[4]) ** 2 + (points[3] - points[5]) ** 2
if(d1 ==0 or d2 ==0 or d3 ==0):
... | output | 1 | 25,872 | 23 | 51,745 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.