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.
Kiwon's favorite video game is now holding a new year event to motivate the users! The game is about building and defending a castle, which led Kiwon to think about the following puzzle.
In a 2... | instruction | 0 | 34,417 | 23 | 68,834 |
No | output | 1 | 34,417 | 23 | 68,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem H without modification queries.
Lester and Delbert work at an electronics company. They are currently working on a microchip component serving to connec... | instruction | 0 | 34,454 | 23 | 68,908 |
No | output | 1 | 34,454 | 23 | 68,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem H without modification queries.
Lester and Delbert work at an electronics company. They are currently working on a microchip component serving to connec... | instruction | 0 | 34,455 | 23 | 68,910 |
No | output | 1 | 34,455 | 23 | 68,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem H without modification queries.
Lester and Delbert work at an electronics company. They are currently working on a microchip component serving to connec... | instruction | 0 | 34,456 | 23 | 68,912 |
No | output | 1 | 34,456 | 23 | 68,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,632 | 23 | 69,264 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
n, m, k = map(int, input().split())
c = k
dir = "right"
start_x = 1
start_y = 1
ans = []
while c > 0:
if c == 1:
r = m*n-2*(k-1)
s = str(r)+' '
pos = []
while r > 0:
pos.append((start_y,... | output | 1 | 34,632 | 23 | 69,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,633 | 23 | 69,266 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
from itertools import chain
r, c, n = map(int, input().split())
ans = []
for i in range(1, r + 1):
x, y, z = (1, c + 1, 1) if i % 2 == 1 else (c, 0, -1)
for j in range(x, y, z):
ans.append((i, j))
l = r * c // n
sans =... | output | 1 | 34,633 | 23 | 69,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,634 | 23 | 69,268 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
import time,math,bisect,sys
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi=3.14159265358979323846264338327950
def II(): #... | output | 1 | 34,634 | 23 | 69,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,635 | 23 | 69,270 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
n,m,k = map(int,input().split())
ans=[]
i=1
j=1
gg = (n*m)//2
for g in range(gg):
if i%2!=0:
if j!=m:
ans.append([i,j,i,j+1])
j+=2
if j==m+1:
j=m
i+=1
... | output | 1 | 34,635 | 23 | 69,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,636 | 23 | 69,272 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
import sys, math, itertools, random, bisect
from collections import defaultdict
# sys.setrecursionlimit(999999999)
INF = 10**18
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int,... | output | 1 | 34,636 | 23 | 69,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,637 | 23 | 69,274 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
n, m, k = [int(c) for c in input().split()]
x, y = [1, 1]
def next_cell(x, y):
if x % 2 == 1 and y < m:
return [x, y + 1]
elif x % 2 == 0 and y > 1:
return [x, y - 1]
else:
return [x + 1, y]
for i... | output | 1 | 34,637 | 23 | 69,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,638 | 23 | 69,276 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
#===========Template===============
from io import BytesIO, IOBase
from math import sqrt
import sys,os
from os import path
inpl=lambda:list(map(int,input().split()))
inpm=lambda:map(int,input().split())
inpi=lambda:int(input())
inp=lam... | output | 1 | 34,638 | 23 | 69,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersec... | instruction | 0 | 34,639 | 23 | 69,278 |
Tags: constructive algorithms, dfs and similar, implementation
Correct Solution:
```
n, m, k = [int(i) for i in input().split()]
arr = []
start = 0
end = m
cont = 1
for i in range(n):
for j in range(start, end, cont):
arr.append(i+1)
arr.append(j+1)
if start == 0:
start = m-1
end... | output | 1 | 34,639 | 23 | 69,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,640 | 23 | 69,280 |
Yes | output | 1 | 34,640 | 23 | 69,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,641 | 23 | 69,282 |
Yes | output | 1 | 34,641 | 23 | 69,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,642 | 23 | 69,284 |
Yes | output | 1 | 34,642 | 23 | 69,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,643 | 23 | 69,286 |
Yes | output | 1 | 34,643 | 23 | 69,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,644 | 23 | 69,288 |
No | output | 1 | 34,644 | 23 | 69,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,645 | 23 | 69,290 |
No | output | 1 | 34,645 | 23 | 69,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,646 | 23 | 69,292 |
No | output | 1 | 34,646 | 23 | 69,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera has got a rectangle table consisting of n rows and m columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right.... | instruction | 0 | 34,647 | 23 | 69,294 |
No | output | 1 | 34,647 | 23 | 69,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a matrix of size n × m. Each element of the matrix is either 1 or 0. You have to determine the number of connected components consisting of 1's. Two cells belong to the same compon... | instruction | 0 | 34,856 | 23 | 69,712 |
No | output | 1 | 34,856 | 23 | 69,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a matrix of size n × m. Each element of the matrix is either 1 or 0. You have to determine the number of connected components consisting of 1's. Two cells belong to the same compon... | instruction | 0 | 34,857 | 23 | 69,714 |
No | output | 1 | 34,857 | 23 | 69,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a matrix of size n × m. Each element of the matrix is either 1 or 0. You have to determine the number of connected components consisting of 1's. Two cells belong to the same compon... | instruction | 0 | 34,858 | 23 | 69,716 |
No | output | 1 | 34,858 | 23 | 69,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a matrix of size n × m. Each element of the matrix is either 1 or 0. You have to determine the number of connected components consisting of 1's. Two cells belong to the same compon... | instruction | 0 | 34,859 | 23 | 69,718 |
No | output | 1 | 34,859 | 23 | 69,719 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature and the pillars found in the ruins. Was a clue to the lo... | instruction | 0 | 35,085 | 23 | 70,170 |
"Correct Solution:
```
def main():
while True:
n = int(input())
if not n:
break
ps = [list(map(int,input().split())) for i in range(n)]
dic = set()
for t in ps:
dic.add((t[0],t[1]))
ans = 0
for i in range(n):
for j in range(n):
p1 = ps[i]
p2 = ps[j]
... | output | 1 | 35,085 | 23 | 70,171 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature and the pillars found in the ruins. Was a clue to the lo... | instruction | 0 | 35,086 | 23 | 70,172 |
"Correct Solution:
```
while True:
n = int(input())
if not n:
break
poles = [tuple(map(int, input().split())) for _ in range(n)]
poles_set = set(poles)
max_square = 0
for i in range(n):
x1, y1 = poles[i]
for j in range(i, n):
x2, y2 = poles[j]
dx... | output | 1 | 35,086 | 23 | 70,173 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature and the pillars found in the ruins. Was a clue to the lo... | instruction | 0 | 35,087 | 23 | 70,174 |
"Correct Solution:
```
def main():
#points = [[False for i in range(5001)] for j in range(5001)]
while True:
n = int(input())
if not n:
break
ps = []
dic = {}
for i in range(n):
x, y = map(int,input().split())
dic[(x, y)] = 1;
#points[x][y] = True
ps.append((x,y))
... | output | 1 | 35,087 | 23 | 70,175 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature and the pillars found in the ruins. Was a clue to the lo... | instruction | 0 | 35,088 | 23 | 70,176 |
"Correct Solution:
```
def main():
while True:
n = int(input())
if not n:
break
ps = []
dic = {}
for i in range(n):
x, y = map(int,input().split())
dic[(x, y)] = 1;
ps.append((x,y))
ans = 0
for i in range(n):
for j in range(n):
p1 = ps[i]
... | output | 1 | 35,088 | 23 | 70,177 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature and the pillars found in the ruins. Was a clue to the lo... | instruction | 0 | 35,089 | 23 | 70,178 |
"Correct Solution:
```
def main():
while True:
n = int(input())
if not n:
break
ps = [list(map(int,input().split())) for i in range(n)]
dic = set()
for t in ps:
dic.add((t[0],t[1]))
ans = 0
for i in range(n):
p1 = ps[i]
p1x = p1[0]
p1y = p1[1]
for j i... | output | 1 | 35,089 | 23 | 70,179 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature and the pillars found in the ruins. Was a clue to the lo... | instruction | 0 | 35,090 | 23 | 70,180 |
"Correct Solution:
```
def main():
while True:
n = int(input())
if not n:
break
ps = [tuple(map(int,input().split())) for i in range(n)]
dic = set()
for t in ps:
dic.add(t)
ans = 0
for i in range(n):
p1 = ps[i]
p1x = p1[0]
p1y = p1[1]
for j in range(n... | output | 1 | 35,090 | 23 | 70,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature ... | instruction | 0 | 35,091 | 23 | 70,182 |
No | output | 1 | 35,091 | 23 | 70,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature ... | instruction | 0 | 35,092 | 23 | 70,184 |
No | output | 1 | 35,092 | 23 | 70,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature ... | instruction | 0 | 35,093 | 23 | 70,186 |
No | output | 1 | 35,093 | 23 | 70,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
Once upon a time there were settlements and many people lived there. People built buildings of various shapes and sizes. But those buildings have already been lost, only the literature ... | instruction | 0 | 35,094 | 23 | 70,188 |
No | output | 1 | 35,094 | 23 | 70,189 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,112 | 23 | 70,224 |
"Correct Solution:
```
from itertools import accumulate
n = int(input())
a = [[0] * 1001 for _ in range(1001)]
for x1, y1, x2, y2 in (map(int, input().split()) for _ in range(n)):
a[x1][y1] += 1
a[x1][y2] -= 1
a[x2][y1] -= 1
a[x2][y2] += 1
print(max(map(max, map(accumulate, zip(*map(accumulate, a))))))... | output | 1 | 35,112 | 23 | 70,225 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,113 | 23 | 70,226 |
"Correct Solution:
```
from itertools import accumulate
n=int(input())
size=1005
sheet=[[0for i in range(size)] for i in range(size)]
for i in range(n):
a,b,c,d=map(int,input().split())
sheet[b][a]+=1
sheet[b][c]-=1
sheet[d][a]-=1
sheet[d][c]+=1
for i in range(size):
sheet[i]=list(accumulate(she... | output | 1 | 35,113 | 23 | 70,227 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,114 | 23 | 70,228 |
"Correct Solution:
```
from itertools import accumulate
N = int(input())
xys = []
m_x = 0
m_y = 0
for i in range(N):
xy = list(map(int, input().split()))
xys += [xy]
x_1,y_1,x_2,y_2 = xy
m_x = max(x_2, m_x)
m_y = max(y_2, m_y)
im = [[0]*(m_x+1) for i in range(m_y+1)]
for xy in xys:
x_1,y_1,x_2,y_2 = xy
im[y_... | output | 1 | 35,114 | 23 | 70,229 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,115 | 23 | 70,230 |
"Correct Solution:
```
#!/usr/bin/env python3
# DSL_5_B: The Maximum Number of Overlaps
from itertools import accumulate
import sys
if __name__ == '__main__':
n = int(input())
ys = [0] * 1001
rects = [None] * 2 * n
i = 0
for line in sys.stdin:
x1, y1, x2, y2 = [int(j) for j in line.split... | output | 1 | 35,115 | 23 | 70,231 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,116 | 23 | 70,232 |
"Correct Solution:
```
from itertools import accumulate
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
grid = [[0] * 1002 for _ in range(1002)]
for _ in range(N):
x, y, xx, yy = map(int, input().split())
grid[x][y] += 1
grid[x][yy] -= 1
grid[xx][y] -= 1
... | output | 1 | 35,116 | 23 | 70,233 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,117 | 23 | 70,234 |
"Correct Solution:
```
N = int(input())
xs = set();ys = set()
P = []
for i in range(N):
x1,y1,x2,y2 = map(int, input().split())
xs.add(x1);xs.add(x2)
ys.add(y1);ys.add(y2)
P.append((x1,x2,y1,y2))
X = sorted(xs);Y = sorted(ys)
MX = {x: i for i, x in enumerate(X)}
MY = {y: i for i, y in enumerate(Y)... | output | 1 | 35,117 | 23 | 70,235 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,118 | 23 | 70,236 |
"Correct Solution:
```
from itertools import accumulate
im = [[0]*1001 for i in range(1001)]
for x_1, y_1, x_2, y_2 in (map(int, input().split()) for _ in range(int(input()))):
im[x_1][y_1] += 1
im[x_1][y_2] -= 1
im[x_2][y_1] -= 1
im[x_2][y_2] += 1
print(max(map(max, map(accumulate, zip(*map(accumulate, im))))))
`... | output | 1 | 35,118 | 23 | 70,237 |
Provide a correct Python 3 solution for this coding contest problem.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* $ 0 \leq x1_i < x2_i \leq 1000 $
* $ 0 \leq y1_i < y2_i ... | instruction | 0 | 35,119 | 23 | 70,238 |
"Correct Solution:
```
n = int(input())
lec = [[0 for i in range(1001)] for j in range(1001)]
max_x = 0
max_y = 0
for i in range(n):
x,y,s,t = map(int, input().split(" "))
lec[y][x] += 1
lec[y][s] -= 1
lec[t][x] -= 1
lec[t][s] += 1
max_x = max(max_x, s)
max_y = max(max_y, t)
for i in range(... | output | 1 | 35,119 | 23 | 70,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* ... | instruction | 0 | 35,120 | 23 | 70,240 |
No | output | 1 | 35,120 | 23 | 70,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* ... | instruction | 0 | 35,121 | 23 | 70,242 |
No | output | 1 | 35,121 | 23 | 70,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Constraints
* $ 1 \leq N \leq 100000 $
* ... | instruction | 0 | 35,122 | 23 | 70,244 |
No | output | 1 | 35,122 | 23 | 70,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of n × ... | instruction | 0 | 35,345 | 23 | 70,690 |
Yes | output | 1 | 35,345 | 23 | 70,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of n × ... | instruction | 0 | 35,346 | 23 | 70,692 |
Yes | output | 1 | 35,346 | 23 | 70,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of n × ... | instruction | 0 | 35,347 | 23 | 70,694 |
Yes | output | 1 | 35,347 | 23 | 70,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of n × ... | instruction | 0 | 35,348 | 23 | 70,696 |
Yes | output | 1 | 35,348 | 23 | 70,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of n × ... | instruction | 0 | 35,349 | 23 | 70,698 |
No | output | 1 | 35,349 | 23 | 70,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.