message stringlengths 2 19.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 322 108k | cluster float64 15 15 | __index_level_0__ int64 644 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp and Vasiliy love simple logical games. Today they play a game with infinite chessboard and one pawn for each player. Polycarp and Vasiliy move in turns, Polycarp starts. In each turn Polycarp can move his pawn from cell (x, y) to (x... | instruction | 0 | 78,690 | 15 | 157,380 |
Tags: games, greedy, implementation, math
Correct Solution:
```
"""
Author - Satwik Tiwari .
15th Jan , 2021 - Thursday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from f... | output | 1 | 78,690 | 15 | 157,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp and Vasiliy love simple logical games. Today they play a game with infinite chessboard and one pawn for each player. Polycarp and Vasiliy move in turns, Polycarp starts. In each turn Polycarp can move his pawn from cell (x, y) to (x... | instruction | 0 | 78,691 | 15 | 157,382 |
Tags: games, greedy, implementation, math
Correct Solution:
```
x, y, a, b = map(int, input().split())
print('Vasiliy' if a < x and b < x + y or b < y and a < x + y else 'Polycarp')
``` | output | 1 | 78,691 | 15 | 157,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp and Vasiliy love simple logical games. Today they play a game with infinite chessboard and one pawn for each player. Polycarp and Vasiliy move in turns, Polycarp starts. In each turn Po... | instruction | 0 | 78,695 | 15 | 157,390 |
No | output | 1 | 78,695 | 15 | 157,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,372 | 15 | 158,744 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip()
def scc(E):
n = len(E)
iE = [[] for _ in range(n)]
for i, e in enumerate(E):
for v in e:
iE[v].append(i)
T = []
done = [0] * n # 0 -> 1 -> 2
ct = 0
for i0... | output | 1 | 79,372 | 15 | 158,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,373 | 15 | 158,746 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import itertools, math
from math import inf
def readline():return map(int, input().split())
def blocks(bits):
start = None
for (i, bit) in enumerate(itertools.chain(bits, [False])):
if bit and start is None:start = i
if not bit and star... | output | 1 | 79,373 | 15 | 158,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,374 | 15 | 158,748 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import itertools, math
from math import inf
def readline():return map(int, input().split())
def blocks(bits):
start = None
for (i, bit) in enumerate(itertools.chain(bits, [False])):
if bit and start is None:start = i
if not bit and star... | output | 1 | 79,374 | 15 | 158,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,375 | 15 | 158,750 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import itertools, math
from math import inf
def readline():return map(int, input().split())
def blocks(bits):
start = None
for (i, bit) in enumerate(itertools.chain(bits, [False])):
if bit and start is None:start = i
if not bit and star... | output | 1 | 79,375 | 15 | 158,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,376 | 15 | 158,752 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
def find_SCC(graph):
SCC, S, P = [], [], []
depth = [0] * len(graph)
stack = list(range(len(graph)))
while stack:
node = stack.pop()
if node < 0:
d = depth[~node] - 1
... | output | 1 | 79,376 | 15 | 158,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,377 | 15 | 158,754 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import io
import os
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappush, heappop, heapify
from math import gcd, inf
# https://raw.githubusercontent.com/cheran-senthil/PyRival/master/pyri... | output | 1 | 79,377 | 15 | 158,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recently received a puzzle from his friend and needs... | instruction | 0 | 79,378 | 15 | 158,756 |
Tags: dfs and similar, graphs, greedy
Correct Solution:
```
import itertools
import math
from math import inf
def readline():
return map(int, input().split())
def blocks(bits):
start = None
for (i, bit) in enumerate(itertools.chain(bits, [False])):
if bit and start is None:
start = i... | output | 1 | 79,378 | 15 | 158,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recen... | instruction | 0 | 79,379 | 15 | 158,758 |
No | output | 1 | 79,379 | 15 | 158,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recen... | instruction | 0 | 79,380 | 15 | 158,760 |
No | output | 1 | 79,380 | 15 | 158,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recen... | instruction | 0 | 79,381 | 15 | 158,762 |
No | output | 1 | 79,381 | 15 | 158,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraints on a_i. You can make hacks only if all versions of the problem are solved.
Little Dormi has recen... | instruction | 0 | 79,382 | 15 | 158,764 |
No | output | 1 | 79,382 | 15 | 158,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,532 | 15 | 159,064 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
def main():
n = int(input())
d = [input() for i in range(n)]
figures = []
for i in range(n):
for j in range(n):
if d[i][j] == 'o':
figures.append([i, j])
result = [['x' for ... | output | 1 | 79,532 | 15 | 159,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,533 | 15 | 159,066 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import datetime
import sys
import copy
import functools
import collections
import itertools
class Solution:
def __init__(self):
self.N = 0
self.boards = None
def test(self):
pass
def readInput(self):... | output | 1 | 79,533 | 15 | 159,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,534 | 15 | 159,068 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
def main():
n = int(input())
d = [input() for i in range(n)]
figures = []
for i in range(n):
for j in range(n):
if d[i][j] == 'o':
figures.append((i, j))
result = [['x' for ... | output | 1 | 79,534 | 15 | 159,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,535 | 15 | 159,070 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
n = int(input())
b = [input() for i in range(n)]
h = [[False] * n for i in range(n)]
p = [[i, j] for i in range(n) for j in range(n) if b[i][j] == 'o']
v = [['.'] * (2 * n - 1) for i in range(2 * n - 1)]
def on(x, y):
return x in range... | output | 1 | 79,535 | 15 | 159,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,536 | 15 | 159,072 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import sys
n = int(input())
s = [input() for i in range(n)]
a = [[1] * (2 * n) for i in range(2 * n)]
for i in range(n):
for j in range(n):
if s[i][j] != 'o':
continue
for x in range(n):
for y i... | output | 1 | 79,536 | 15 | 159,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,537 | 15 | 159,074 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import sys
fin = sys.stdin
n = int(fin.readline())
ma = [[None]] * n
for i in range(0, n):
aux = fin.readline()
aux = aux[:-1]
ma[i] = list(aux)
r = []
for i in range(0, 2 * n - 1):
r.append(None)
r[i] = []
for j in... | output | 1 | 79,537 | 15 | 159,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,538 | 15 | 159,076 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
s=int(input())
opos=[]
xpos=[]
dpos=[]
for i in range(s):
x=input()
for j in range(s):
if x[j]=='o':opos.append([i,j])
elif x[j]=='x':xpos.append([i,j])
else:dpos.append([i,j])
ddifs={}
for i in dpos:
... | output | 1 | 79,538 | 15 | 159,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a square of size n × n cells. Igor decided that simpl... | instruction | 0 | 79,539 | 15 | 159,078 |
Tags: brute force, constructive algorithms, implementation
Correct Solution:
```
import math
from sys import stdin
from math import ceil
import sys
if __name__ == '__main__':
n = int(input())
table = list()
# newT = list()
for i in range(n):
table.append(input())
# for i in range(2 * n):
... | output | 1 | 79,539 | 15 | 159,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,540 | 15 | 159,080 |
Yes | output | 1 | 79,540 | 15 | 159,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,541 | 15 | 159,082 |
Yes | output | 1 | 79,541 | 15 | 159,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,542 | 15 | 159,084 |
Yes | output | 1 | 79,542 | 15 | 159,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,543 | 15 | 159,086 |
No | output | 1 | 79,543 | 15 | 159,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,544 | 15 | 159,088 |
No | output | 1 | 79,544 | 15 | 159,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,545 | 15 | 159,090 |
No | output | 1 | 79,545 | 15 | 159,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think of new rules of the game and become world famous.
Igor's chessboard is a squa... | instruction | 0 | 79,546 | 15 | 159,092 |
No | output | 1 | 79,546 | 15 | 159,093 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,685 | 15 | 159,370 |
"Correct Solution:
```
H, W, M = map(int, input().split())
bombs = set([tuple(map(int, input().split())) for _ in range(M)])
cntH = [0] * (H + 1)
cntW = [0] * (W + 1)
for h, w in bombs:
cntH[h] += 1
cntW[w] += 1
mxH = max(cntH)
mxW = max(cntW)
ans = mxH + mxW - 1
mxH = [h for h in range(1, H + 1) if cntH[h]... | output | 1 | 79,685 | 15 | 159,371 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,686 | 15 | 159,372 |
"Correct Solution:
```
h, w, m = map(int, input().split())
mp = set()
hp = [0] * h
wp = [0] * w
for i in range(m):
a, b = map(int, input().split())
mp.add((a, b))
l = [a, b]
hp[l[0]-1] += 1
wp[l[1]-1] += 1
maxhp = max(hp)
maxwp = max(wp)
hpdex = [i for i, x in enumerate(hp) if x == maxhp]
wpdex =... | output | 1 | 79,686 | 15 | 159,373 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,687 | 15 | 159,374 |
"Correct Solution:
```
x, y, m = map(int,input().split())
mat = set()
r = [0]*x
c = [0]*y
smx = 0
smy = 0
for _ in range(m):
p, q = map(int,input().split())
p -= 1
q -= 1
mat.add((p,q))
r[p] += 1
c[q] += 1
smx = max(smx,r[p])
smy = max(smy,c[q])
xs = []
ys = []
for i in range(x):
if ... | output | 1 | 79,687 | 15 | 159,375 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,688 | 15 | 159,376 |
"Correct Solution:
```
import sys
h,w,m = map(int, input().split())
h_t = [0 for _ in range(h)]
w_t = [0 for _ in range(w)]
t = []
for _ in range(m):
hi,wi = map(int, input().split())
h_t[hi-1] += 1
w_t[wi-1] += 1
t.append([hi-1,wi-1])
hmax = max(h_t)
wmax = max(w_t)
hmaxi = [i1 for i1 in range(h) if h_t[i1] ==... | output | 1 | 79,688 | 15 | 159,377 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,689 | 15 | 159,378 |
"Correct Solution:
```
import sys
h, w, m = map(int, input().split())
row = [0]*h
col = [0]*w
bomb = set()
for x in range(m):
H, W = map(int, input().split())
bomb.add((H-1, W-1))
row[H-1] += 1
col[W-1] += 1
maxrow = max(row)
maxcol = max(col)
ans = maxcol + maxrow - 1
p, q = [], []
for i in range(h):... | output | 1 | 79,689 | 15 | 159,379 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,690 | 15 | 159,380 |
"Correct Solution:
```
H, W, M, *hw = map(int, open(0).read().split())
H_cnt = [0] * (H + 1)
W_cnt = [0] * (W + 1)
bombs = [(h, w) for h, w in zip(*[iter(hw)] * 2)]
for h, w in bombs:
H_cnt[h] += 1
W_cnt[w] += 1
H_max_cnt = max(H_cnt)
W_max_cnt = max(W_cnt)
comb_cnt = H_cnt.count(H_max_cnt) * W_cnt.count(W_ma... | output | 1 | 79,690 | 15 | 159,381 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,691 | 15 | 159,382 |
"Correct Solution:
```
H, W, M = map(int, input().split())
h = [0] * H
w = [0] * W
Mem = [tuple(map(int, input().split())) for _ in range(M) ]
for i, j in Mem:
h[i-1] += 1
w[j-1] += 1
maxh = max(h)
maxw = max(w)
listh = {i for i, v in enumerate(h, 1) if v == maxh}
listw = {j for j, v in enumerate(w, 1) if v ==... | output | 1 | 79,691 | 15 | 159,383 |
Provide a correct Python 3 solution for this coding contest problem.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square in this grid, place a bomb there, and ignite it. The bo... | instruction | 0 | 79,692 | 15 | 159,384 |
"Correct Solution:
```
H,W,M=map(int,input().split())
Y=[0 for i in range(H+1)]
X=[0 for i in range(W+1)]
HW=[]
for i in range(M):
h,w=map(int,input().split())
Y[h]+=1
X[w]+=1
HW.append([h,w])
LY=[]
LX=[]
MY=max(Y)
MX=max(X)
for i in range(H+1):
if Y[i]==MY:
LY.append(i)
for i in range(W+1)... | output | 1 | 79,692 | 15 | 159,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,693 | 15 | 159,386 |
Yes | output | 1 | 79,693 | 15 | 159,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,694 | 15 | 159,388 |
Yes | output | 1 | 79,694 | 15 | 159,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,695 | 15 | 159,390 |
Yes | output | 1 | 79,695 | 15 | 159,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,696 | 15 | 159,392 |
Yes | output | 1 | 79,696 | 15 | 159,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,697 | 15 | 159,394 |
No | output | 1 | 79,697 | 15 | 159,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,698 | 15 | 159,396 |
No | output | 1 | 79,698 | 15 | 159,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,699 | 15 | 159,398 |
No | output | 1 | 79,699 | 15 | 159,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a two-dimensional grid with H \times W squares. There are M targets to destroy in this grid - the position of the i-th target is \left(h_i, w_i \right).
Takahashi will choose one square... | instruction | 0 | 79,700 | 15 | 159,400 |
No | output | 1 | 79,700 | 15 | 159,401 |
Provide a correct Python 3 solution for this coding contest problem.
problem
In one river, there is a slightly dangerous game of jumping from one shore to the other on a stone.
<image>
Now, as shown in Figure 4-1 we consider the stone to be above the squares. The number of rows is n. In Figure 4-1 we have n = 5.
... | instruction | 0 | 79,855 | 15 | 159,710 |
"Correct Solution:
```
while 1:
N, M = map(int, input().split())
if N == M == 0:
break
P = []
K = []
for i in range(N):
k, *S = map(int, input().split())
P.append(list(zip(S[::2], S[1::2])))
K.append(k)
INF = 10**18
memo = {}
def dfs(i, j, k):
key ... | output | 1 | 79,855 | 15 | 159,711 |
Provide a correct Python 3 solution for this coding contest problem.
problem
In one river, there is a slightly dangerous game of jumping from one shore to the other on a stone.
<image>
Now, as shown in Figure 4-1 we consider the stone to be above the squares. The number of rows is n. In Figure 4-1 we have n = 5.
... | instruction | 0 | 79,856 | 15 | 159,712 |
"Correct Solution:
```
from heapq import heappop, heappush
while True:
n, m = map(int, input().split())
if not n:
break
num_stones = 0
row_stones = [None] * n
edges = [None] * n
visited = [None] * n
for row in range(n):
(num, *stones) = map(int, input().split())
row... | output | 1 | 79,856 | 15 | 159,713 |
Provide a correct Python 3 solution for this coding contest problem.
problem
In one river, there is a slightly dangerous game of jumping from one shore to the other on a stone.
<image>
Now, as shown in Figure 4-1 we consider the stone to be above the squares. The number of rows is n. In Figure 4-1 we have n = 5.
... | instruction | 0 | 79,857 | 15 | 159,714 |
"Correct Solution:
```
def main():
import sys
input=sys.stdin.readline
while True:
n,m=map(int,input().split())
if n==0:
break
kis=[list(map(int,input().split())) for _ in [0]*n]
dp1=[dict() for _ in [0]*(m+1)]
dp2=[dict() for _ in [0]*(m+1)]
dp3=[... | output | 1 | 79,857 | 15 | 159,715 |
Provide a correct Python 3 solution for this coding contest problem.
problem
In one river, there is a slightly dangerous game of jumping from one shore to the other on a stone.
<image>
Now, as shown in Figure 4-1 we consider the stone to be above the squares. The number of rows is n. In Figure 4-1 we have n = 5.
... | instruction | 0 | 79,858 | 15 | 159,716 |
"Correct Solution:
```
"""
nodes
0 ... start
k*num + 1 ~ (k+1)*num ... j=k (k <= m)
num * (m + 1) + 1 ... end
"""
from heapq import heappush, heappop
def main():
INF = 10 ** 20
while True:
n, m = map(int, input().split())
if n == 0:
break
lines = []
acc = 1
for _ in range(n):
lst = l... | output | 1 | 79,858 | 15 | 159,717 |
Provide a correct Python 3 solution for this coding contest problem.
A: A-Z-
problem
There is a circular board of 26 squares, each square with one capital letter of the alphabet written clockwise in alphabetical order. That is, the clockwise side of the'A'square is the'B' square, the next side of the'B'square is the... | instruction | 0 | 79,898 | 15 | 159,796 |
"Correct Solution:
```
from sys import stdin
s = "A" + stdin.readline().rstrip()
AZ = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
ans = 0
for i in range(1,len(s)):
if AZ.find(s[i]) <= AZ.find(s[i-1]):
ans += 1
print(ans)
``` | output | 1 | 79,898 | 15 | 159,797 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.