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.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,063 | 23 | 178,126 |
"Correct Solution:
```
h,w,k = map(int,input().split())
mod = 10**9+7
dp = [[0]*(w+2) for _ in range(h+1)]
dp[0][1] = 1
#左右の余白を埋める場合の数
ref = [1,2,3,5,8,13,21]
pat = lambda l,r:ref[max(l,0)]*ref[max(r,0)]
for i in range(h):
for j in range(1,w+1):
dp[i+1][j] = dp[i][j-1]*pat(j-3,w-j-1) + dp[i][j]*pat(j-2,w-j-1) + dp... | output | 1 | 89,063 | 23 | 178,127 |
Provide a correct Python 3 solution for this coding contest problem.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,064 | 23 | 178,128 |
"Correct Solution:
```
h,w,k = (int(x) for x in input().split())
MOD = 1000000007
dp=[[0]*(w+2) for _ in range(h+2)]
fib = [0]*(w+1)
# 初期条件
fib[1] = 1
dp[0][1] = 1
# フィボナッチ
for i in range(2,w+1):
fib[i] = fib[i-1] + fib[i-2]
for i in range(1, h+1):
for j in range(1, w+1):
dp[i][j] = (dp[i - 1][j - 1]*fib[j... | output | 1 | 89,064 | 23 | 178,129 |
Provide a correct Python 3 solution for this coding contest problem.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,065 | 23 | 178,130 |
"Correct Solution:
```
H, W, K = map(int, input().split())
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
for i in range(1, H + 1):
for j in range(W):
for k in range(2 ** (W - 1)):
if bin(k).count("11") >= 1:
continue
if j + 1 <= W - 1 and (k >> j)... | output | 1 | 89,065 | 23 | 178,131 |
Provide a correct Python 3 solution for this coding contest problem.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,066 | 23 | 178,132 |
"Correct Solution:
```
MOD = 10**9 + 7
H, W, K = map(int, input().split())
fibs = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
def getFib(i):
return fibs[i+2]
numLs, numCs, numRs = [0]*W, [0]*W, [0]*W
for j in range(W):
numCs[j] = getFib(j-1) * getFib(W-1-j-1)
numLs[j] = getFib(j-2) * getFib(W-1-j-1)
numRs[j] =... | output | 1 | 89,066 | 23 | 178,133 |
Provide a correct Python 3 solution for this coding contest problem.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,067 | 23 | 178,134 |
"Correct Solution:
```
h,w,k = map(int,input().split())
if w == 1:
print(1)
exit()
a = [0]*(w+2)
a[1] = 1
f = [0]*(w-1)
p = 0
q = 1
for i in range(w-1):
f[i] = p+q
q = p + q
p = q - p
f.append(1)
b = []
mod = 10**9+7
for i in range(w):
if i == 0:
b.append([0,f[w-2],f[w-3]])
elif i == w-1:
b.appe... | output | 1 | 89,067 | 23 | 178,135 |
Provide a correct Python 3 solution for this coding contest problem.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,068 | 23 | 178,136 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Sat Jan 5 10:49:47 2019
@author: Yamazaki Kenichi
"""
H,W,K = map(int, input().split())
mod = 10**9 +7
a = [1,1,2,3,5,8,13,21]
T = [[-1 for i in range(9)] for i in range(H+1) ]
def n(h,k):
if T[h][k] != -1:
return T[h][k]
res = 0
if h ... | output | 1 | 89,068 | 23 | 178,137 |
Provide a correct Python 3 solution for this coding contest problem.
Amidakuji is a traditional method of lottery in Japan.
To make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal... | instruction | 0 | 89,069 | 23 | 178,138 |
"Correct Solution:
```
H,W,K=map(int,input().split())
dp=[[0]*(W+1) for _ in range(H+1)]
dp[0][0]=1
mod=10**9+7
for h in range(H):
for b in range(1<<(W-1)):
if "11" in bin(b):continue
b<<=1
for w in range(W):
if b&(1<<w):
dp[h+1][w]+=dp[h][w-1]
elif b&(1<<(w+1)):
dp[h+1][w]+=d... | output | 1 | 89,069 | 23 | 178,139 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,176 | 23 | 178,352 |
"Correct Solution:
```
'''
hardest 2.
Aizu Online Judge 1165: Pablo Squarson's Headache
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1165
## ?§£??¬
??£?????¢?????????????????£?????§???????????¢?????\????????????????????¢???????°????????????¨???????????????????????????????????§???
??£?????¢???????????¢????... | output | 1 | 89,176 | 23 | 178,353 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,177 | 23 | 178,354 |
"Correct Solution:
```
def main():
while True:
sq_sum = int(input())
if sq_sum == 0: break
abs_list = [[0, 0]]
for i in range(sq_sum - 1):
n, d = map(int, input().split())
abs_list.append(abs_p(abs_list, n, d))
xlist = []
ylist = []
... | output | 1 | 89,177 | 23 | 178,355 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,178 | 23 | 178,356 |
"Correct Solution:
```
def solve(N, nd):
dire = [(0,-1), (-1,0), (0,1), (1,0)]
table = [[0]*(2*N+1) for i in range(2*N+1)]
table[N][N] = 1
position = [None]*N
position[0] = (N, N)
for i,ndi in enumerate(nd,start=1):
n, d = ndi
y, x = position[n]
ny, nx = y+dire[d][0], x+d... | output | 1 | 89,178 | 23 | 178,357 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,179 | 23 | 178,358 |
"Correct Solution:
```
D = ((-1,0),(0,1),(1,0),(0,-1))
while 1:
N = int(input())
if not N:break
min_x = min_y = max_x = max_y = 0
a = [(0,0)]
for i in range(N-1):
n1, d1 = list(map(int, input().split()))
spam = (lambda x: (x[0] + D[d1][0], x[1] + D[d1][1]))(a[n1])
min_x = ... | output | 1 | 89,179 | 23 | 178,359 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,180 | 23 | 178,360 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0: break
xs = [(0, 0)]
dic = [(-1, 0), (0, 1), (1, 0), (0, -1)]
maxX, minX, maxY, minY = 0, 0, 0, 0
for i in range(n - 1):
n, d = map(int, input().split())
xs.append((xs[n][0] + dic[d][0], xs[n][1] + dic[d][1]))
... | output | 1 | 89,180 | 23 | 178,361 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,181 | 23 | 178,362 |
"Correct Solution:
```
d = [[-1,0],[0,1],[1,0],[0,-1]]
while True:
n = int(input())
if not(n): break
# l = [[1,1]]
w,h = [1],[1]
for i in range(n-1):
l = list(map(int,input().split()))
w.append(w[l[0]]+d[l[1]][0])
h.append(h[l[0]]+d[l[1]][1])
print(max(w)-min(w)+1,max(h)-... | output | 1 | 89,181 | 23 | 178,363 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,182 | 23 | 178,364 |
"Correct Solution:
```
def main():
D = ((-1,0), (0,-1), (1,0), (0,1))
while True:
n = int(input())
if n==0:
exit()
sx = [0]
sy = [0]
for i in range(n-1):
ni, di = [int(x) for x in input().split()]
sx.append(sx[ni]+D[di][0])
... | output | 1 | 89,182 | 23 | 178,365 |
Provide a correct Python 3 solution for this coding contest problem.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of his studio, there is a huuuuuge table and beside it are m... | instruction | 0 | 89,183 | 23 | 178,366 |
"Correct Solution:
```
while True:
N=int(input())
if N==0:break
t=[0]
y=[0]
lst=list(range(N))
for k in lst[1:]:
[x,d]=input().split()
[x,d]=[int(x),int(d)]
if d==0:
t=t+[t[x]]
y=y+[y[x]-1]
if d==1:
t=t+[t[x]-1]
y=y+... | output | 1 | 89,183 | 23 | 178,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of h... | instruction | 0 | 89,184 | 23 | 178,368 |
Yes | output | 1 | 89,184 | 23 | 178,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of h... | instruction | 0 | 89,185 | 23 | 178,370 |
Yes | output | 1 | 89,185 | 23 | 178,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of h... | instruction | 0 | 89,186 | 23 | 178,372 |
Yes | output | 1 | 89,186 | 23 | 178,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of h... | instruction | 0 | 89,187 | 23 | 178,374 |
Yes | output | 1 | 89,187 | 23 | 178,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of h... | instruction | 0 | 89,188 | 23 | 178,376 |
No | output | 1 | 89,188 | 23 | 178,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pablo Squarson is a well-known cubism artist. This year's theme for Pablo Squarson is "Squares". Today we are visiting his studio to see how his masterpieces are given birth.
At the center of h... | instruction | 0 | 89,189 | 23 | 178,378 |
No | output | 1 | 89,189 | 23 | 178,379 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,218 | 23 | 178,436 |
"Correct Solution:
```
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
# import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 ... | output | 1 | 89,218 | 23 | 178,437 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,219 | 23 | 178,438 |
"Correct Solution:
```
H, W = map(int, input().split())
S = [list(map(int, input().split())) for i in range(H)]
dp = [[0]*(W) for i in range(H)]
for i in range(H):
for j in range(W):
if S[i][j] == 0:
dp[i][j] = min(dp[i-1][j-1], dp[i-1][j], dp[i][j-1])+1
# print(max([max([max(a) for a in dp])**2]))
print(m... | output | 1 | 89,219 | 23 | 178,439 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,220 | 23 | 178,440 |
"Correct Solution:
```
h, w = map(int, input().split( ))
#c = [ [0] * w ]
#下の奴がまずい。各行が同一のアドレス指してる。上も一応変えておく。
#DP = [ [0] * w ] * ( h + 1 )
c=[[0 for _ in range(w)]]
DP = [[0 for _ in range(w)] for __ in range(h+1)]
for _ in range(h):
c_tmp = list(map(int, input().split( )))
c.append( c_tmp )
for i in range(w... | output | 1 | 89,220 | 23 | 178,441 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,221 | 23 | 178,442 |
"Correct Solution:
```
# DPL_3_A: Largest Square
import sys
H, W = map(int, sys.stdin.readline().strip().split())
dp = [[0] * (W + 1) for _ in range(H + 1)]
for h in range(1, H + 1):
c = list(map(int, sys.stdin.readline().strip().split()))
dirty = [i for i, x in enumerate(c) if x == 1]
for w in dirty:
... | output | 1 | 89,221 | 23 | 178,443 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,222 | 23 | 178,444 |
"Correct Solution:
```
import sys
import itertools
h, w = map(int, sys.stdin.readline().split())
dp = [[0] * w for _ in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for _ in range(h)]
for x in range(h):
dp[x][0] = 1 if G[x][0] == 0 else 0
for y in range(w):
dp[0][y] = 1 if G[0][y] == 0 else 0
f... | output | 1 | 89,222 | 23 | 178,445 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,223 | 23 | 178,446 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def ... | output | 1 | 89,223 | 23 | 178,447 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,224 | 23 | 178,448 |
"Correct Solution:
```
# DPL 3 A
def solve():
H, W = map(int, input().split())
c = [list(map(int, input().split())) for _ in range(H)]
dp = [[0] * (W+1) for _ in range(H+1)]
ans = 0
for i in range(1, H+1):
for j in range(1, W+1):
if c[i-1][j-1] == 1:
dp[i][j] ==... | output | 1 | 89,224 | 23 | 178,449 |
Provide a correct Python 3 solution for this coding contest problem.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... c2,W
:
cH,1 cH,2 ... cH,W
In the first line, two i... | instruction | 0 | 89,225 | 23 | 178,450 |
"Correct Solution:
```
H, W = map(int, input().split())
c = []
for i in range(H):
c.append([int(i) for i in input().split()])
dp = [[0 for i in range(W)] for i in range(H)]
maxwidth = 0
for i in range(H):
for j in range(W):
dp[i][j] = (c[i][j] + 1) % 2
maxwidth |= dp[i][j]
for i in range(1, H):... | output | 1 | 89,225 | 23 | 178,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,226 | 23 | 178,452 |
Yes | output | 1 | 89,226 | 23 | 178,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,227 | 23 | 178,454 |
Yes | output | 1 | 89,227 | 23 | 178,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,228 | 23 | 178,456 |
Yes | output | 1 | 89,228 | 23 | 178,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,229 | 23 | 178,458 |
Yes | output | 1 | 89,229 | 23 | 178,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,230 | 23 | 178,460 |
No | output | 1 | 89,230 | 23 | 178,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,231 | 23 | 178,462 |
No | output | 1 | 89,231 | 23 | 178,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,232 | 23 | 178,464 |
No | output | 1 | 89,232 | 23 | 178,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Constraints
* 1 ≤ H, W ≤ 1,400
Input
H W
c1,1 c1,2 ... c1,W
c2,1 c2,2 ... | instruction | 0 | 89,233 | 23 | 178,466 |
No | output | 1 | 89,233 | 23 | 178,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,250 | 23 | 178,500 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
def photo(n,m):
if n<=1:
return 0
m=m.split()
m=[int(m[i]) for i in range(len(m))]
m.sort()
x1=m[len(m)-1]-m[0]
c=m[1:len(m)-1]
differ=[(c[i+n-1]-c[i]) for i in range(len(c)+2-n-1)]
y1=min(differ)
result=... | output | 1 | 89,250 | 23 | 178,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,251 | 23 | 178,502 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
from sys import stdin, stdout
# string input
n = int(stdin.readline())
arr = [int(x) for x in stdin.readline().split()]
arr.sort()
x1 = arr[0]
x2 = arr[n-1]
y1 = arr[n]
y2 = arr[(2*n) - 1]
mini = (x2-x1)*(y2-y1)
for i in range(1, n):
j = i +... | output | 1 | 89,251 | 23 | 178,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,252 | 23 | 178,504 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Mon Jul 30 14:37:45 2018
@author: Amrita
"""
N = int(input())
Ns = list(map(int,input().strip().split()))
Ns.sort()
diff1 = Ns[N-1] - Ns[0]
diff2 = Ns[-1] - Ns[N]
best = diff1*diff2
diff_ends = Ns[-1]... | output | 1 | 89,252 | 23 | 178,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,253 | 23 | 178,506 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
n=int(input())
a=sorted(map(int,input().split()))
print(min([(a[n-1]-a[0])*(a[-1]-a[n])]+[(a[-1]-a[0])*(a[i+n-1]-a[i])
for i in range(n)]))
# Made By Mostafa_Khaled
``` | output | 1 | 89,253 | 23 | 178,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,254 | 23 | 178,508 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
n = int(input())
nums = [int(i) for i in input().split()]
if n == 1:
print(0)
else:
nums.sort()
area_1 = None
for i in range(1,n):
temp = (nums[-1]-nums[0])*(nums[i+n-1]-nums[i])
if area_1 is None or temp < area_1... | output | 1 | 89,254 | 23 | 178,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,255 | 23 | 178,510 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
if __name__ == "__main__":
n = int(input())
s = sorted(map(int, input().split()))
h = s[2 * n - 1] - s[0]
best = (s[n-1] - s[0]) * (s[2*n - 1] - s[n])
for i in range(1, n):
w = s[i + n - 1] - s[i]
new = h * w
... | output | 1 | 89,255 | 23 | 178,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,256 | 23 | 178,512 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
import sys
import math
import bisect
def input():
return sys.stdin.readline().strip()
def iinput():
return int(input())
def finput():
return float(input())
def tinput():
return input().split()
def rinput():
return map(int, ... | output | 1 | 89,256 | 23 | 178,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaking, it makes a photo of all points with coordin... | instruction | 0 | 89,257 | 23 | 178,514 |
Tags: brute force, implementation, math, sortings
Correct Solution:
```
import heapq
from math import sqrt
from collections import defaultdict
n = int(input())
a = list(map(int, input().split()))
dic = defaultdict(int)
if n == 1:
print(0)
exit()
for v in a:
dic[v] += 1
for v, j in dic.items():
if ... | output | 1 | 89,257 | 23 | 178,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaki... | instruction | 0 | 89,258 | 23 | 178,516 |
Yes | output | 1 | 89,258 | 23 | 178,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaki... | instruction | 0 | 89,259 | 23 | 178,518 |
Yes | output | 1 | 89,259 | 23 | 178,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaki... | instruction | 0 | 89,260 | 23 | 178,520 |
Yes | output | 1 | 89,260 | 23 | 178,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaki... | instruction | 0 | 89,261 | 23 | 178,522 |
Yes | output | 1 | 89,261 | 23 | 178,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pavel made a photo of his favourite stars in the sky. His camera takes a photo of all points of the sky that belong to some rectangle with sides parallel to the coordinate axes.
Strictly speaki... | instruction | 0 | 89,262 | 23 | 178,524 |
No | output | 1 | 89,262 | 23 | 178,525 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.