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.
You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, yi). We know that no two bombs are at the same point and that no bomb is at ... | instruction | 0 | 61,761 | 15 | 123,522 |
Tags: greedy, implementation, sortings
Correct Solution:
```
###################################################################
# ."-,.__
# `. `. ,
# .--' .._,'"-' `.
# . .' `'
# `. / ,'
# ` '--. ,-"... | output | 1 | 61,761 | 15 | 123,523 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, yi). We know that no two bombs are at the same point and that no bomb is at ... | instruction | 0 | 61,762 | 15 | 123,524 |
Tags: greedy, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python3
import io
import os
import sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def printd(*args, **kwargs):
#print(*args, **kwargs, file=sys.stderr)
print(*args, **kwargs)
pass
def get_str():
return input(... | output | 1 | 61,762 | 15 | 123,525 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, yi). We know that no two bombs are at the same point and that no bomb is at ... | instruction | 0 | 61,763 | 15 | 123,526 |
Tags: greedy, implementation, sortings
Correct Solution:
```
def dist(p):
return abs(p[0]) + abs(p[1])
n = int(input())
points = []
for i in range(n):
x,y = map(int,input().split())
points.append((x,y))
points.sort(key = dist)
ans = []
for x,y in points:
if x > 0:
ans.append(f'1 {x} R')
... | output | 1 | 61,763 | 15 | 123,527 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,888 | 15 | 123,776 |
Tags: dp, implementation
Correct Solution:
```
n,m=map(int,input().split())
a=[[] for i in range(n)]
for i in range(n):
a[i]=list(input())
hor,ver=[[0]*2005 for i in range(2005)],[[0]*2005 for i in range(2005)]
for i in range(0,n+1):
for j in range(0,m+1):
if i==0 or j==0:
ver[i][j]=hor[i][j... | output | 1 | 61,888 | 15 | 123,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,889 | 15 | 123,778 |
Tags: dp, implementation
Correct Solution:
```
n, m = map(int, input().split())
li = [' '*(m+1)]+[' '+input() for _ in range(n)]
r,c = [[0 for i in range(m+1)] for i in range(n+1)],[[0 for i in range(m+1)] for i in range(n+1)]
q = int(input())
for i in range(1,n+1):
for j in range(1,m+1):
r[i][j]=r[i-1][j]+r[i][j-1]... | output | 1 | 61,889 | 15 | 123,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,890 | 15 | 123,780 |
Tags: dp, implementation
Correct Solution:
```
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
# Copyright © 2016 missingdays <missingdays@missingdays>
#
# Distributed under terms of the MIT license.
"""
"""
def read_list():
return [int(i) for i in input().split()]
def new_list(n):
return [0... | output | 1 | 61,890 | 15 | 123,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,891 | 15 | 123,782 |
Tags: dp, implementation
Correct Solution:
```
n, m = map(int, input().split())
a = [' ' + input() for i in range(n)]
a = [' '*(m+1)] + a
q = int(input())
col = [[0 for i in range(m+1)] for i in range(n+1)]
row = [[0 for i in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(1, m+1):
... | output | 1 | 61,891 | 15 | 123,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,892 | 15 | 123,784 |
Tags: dp, implementation
Correct Solution:
```
#!/usr/bin/env python3
import itertools, functools, math
def II(r1, c1, r2, c2, table):
if r1 > r2:
return 0
if c1 > c2:
return 0
res = table[r2][c2]
if r1:
res -= table[r1-1][c2]
if c1:
res -= table[r2][c1-1]
if r1 ... | output | 1 | 61,892 | 15 | 123,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,893 | 15 | 123,786 |
Tags: dp, implementation
Correct Solution:
```
read = lambda: map(int, input().split())
h, w = read()
a = [input() for i in range(h)]
N = 501
vr = [[0] * N for i in range(N)]
hr = [[0] * N for i in range(N)]
for i in range(h):
for j in range(w):
vr[j + 1][i + 1] = vr[j][i + 1] + vr[j + 1][i] - vr[j][i]
... | output | 1 | 61,893 | 15 | 123,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,894 | 15 | 123,788 |
Tags: dp, implementation
Correct Solution:
```
# Description of the problem can be found at http://codeforces.com/problemset/problem/611/C
read = lambda: map(int, input().split())
h, w = read()
a = [input() for i in range(h)]
N = 501
vr = [[0] * N for i in range(N)]
hr = [[0] * N for i in range(N)]
for i in range(h):
... | output | 1 | 61,894 | 15 | 123,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cel... | instruction | 0 | 61,895 | 15 | 123,790 |
Tags: dp, implementation
Correct Solution:
```
def main():
h, w = map(int, input().split())
l = [[c == '.' for c in input()] for _ in range(h)]
ver = [[0] * (w + 1) for _ in range(h + 1)]
for y, aa, bb, l0, l1 in zip(range(h - 1), ver, ver[1:], l, l[1:]):
for x in range(w):
bb[x + 1]... | output | 1 | 61,895 | 15 | 123,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,896 | 15 | 123,792 |
Yes | output | 1 | 61,896 | 15 | 123,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,897 | 15 | 123,794 |
Yes | output | 1 | 61,897 | 15 | 123,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,898 | 15 | 123,796 |
Yes | output | 1 | 61,898 | 15 | 123,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,899 | 15 | 123,798 |
Yes | output | 1 | 61,899 | 15 | 123,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,900 | 15 | 123,800 |
No | output | 1 | 61,900 | 15 | 123,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,901 | 15 | 123,802 |
No | output | 1 | 61,901 | 15 | 123,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,902 | 15 | 123,804 |
No | output | 1 | 61,902 | 15 | 123,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.
Limak is a little polar bear who loves to play. He has recently got a recta... | instruction | 0 | 61,903 | 15 | 123,806 |
No | output | 1 | 61,903 | 15 | 123,807 |
Provide a correct Python 3 solution for this coding contest problem.
Description
F, who likes to dance, decided to practice a hardcore dance called JUMP STYLE at a certain dance hall.
The floor is tiled in an N × N grid. To support the dance practice, each tile has the coordinates of the tile to jump to the next ste... | instruction | 0 | 62,222 | 15 | 124,444 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
to = []
fr = [[] for _ in range(n * n)]
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j:2 * j + 2]
to.append(y * n + x)
fr[y * n + x].append(i * n + j)
order = []
... | output | 1 | 62,222 | 15 | 124,445 |
Provide a correct Python 3 solution for this coding contest problem.
Description
F, who likes to dance, decided to practice a hardcore dance called JUMP STYLE at a certain dance hall.
The floor is tiled in an N × N grid. To support the dance practice, each tile has the coordinates of the tile to jump to the next ste... | instruction | 0 | 62,223 | 15 | 124,446 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
to = []
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j:2 * j + 2]
to.append(y * n + x)
order = []
used = [False] * (n * n)
def dfs(x):
if used[x]:return
used[x... | output | 1 | 62,223 | 15 | 124,447 |
Provide a correct Python 3 solution for this coding contest problem.
Description
F, who likes to dance, decided to practice a hardcore dance called JUMP STYLE at a certain dance hall.
The floor is tiled in an N × N grid. To support the dance practice, each tile has the coordinates of the tile to jump to the next ste... | instruction | 0 | 62,224 | 15 | 124,448 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
to = []
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j:2 * j + 2]
to.append(y * n + x)
order = []
used = [False] * (n * n)
def dfs(x):
if used[x]:return
used[x... | output | 1 | 62,224 | 15 | 124,449 |
Provide a correct Python 3 solution for this coding contest problem.
Description
F, who likes to dance, decided to practice a hardcore dance called JUMP STYLE at a certain dance hall.
The floor is tiled in an N × N grid. To support the dance practice, each tile has the coordinates of the tile to jump to the next ste... | instruction | 0 | 62,225 | 15 | 124,450 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
to = []
fr = [[] for _ in range(n * n)]
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j:2 * j + 2]
to.append(y * n + x)
fr[y * n + x].append(i * n + j)
order = []
... | output | 1 | 62,225 | 15 | 124,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that the difference between easy and hard versions is that in hard version unavailable cells can become available again and in easy version can't. You can make hacks only if all versions ar... | instruction | 0 | 62,473 | 15 | 124,946 |
No | output | 1 | 62,473 | 15 | 124,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that the difference between easy and hard versions is that in hard version unavailable cells can become available again and in easy version can't. You can make hacks only if all versions ar... | instruction | 0 | 62,474 | 15 | 124,948 |
No | output | 1 | 62,474 | 15 | 124,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that the difference between easy and hard versions is that in hard version unavailable cells can become available again and in easy version can't. You can make hacks only if all versions ar... | instruction | 0 | 62,475 | 15 | 124,950 |
No | output | 1 | 62,475 | 15 | 124,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that the difference between easy and hard versions is that in hard version unavailable cells can become available again and in easy version can't. You can make hacks only if all versions ar... | instruction | 0 | 62,476 | 15 | 124,952 |
No | output | 1 | 62,476 | 15 | 124,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,704 | 15 | 125,408 |
Tags: brute force, geometry
Correct Solution:
```
import copy
import sys
def solve():
n = int(input())
for reg in range(n):
temp = help()
print(-1 if temp == 1000 else temp)
def help():
res = 1000
read = [list(map(int, input().split())) for _ in range(4)]
for _1 in range(4):
... | output | 1 | 62,704 | 15 | 125,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,705 | 15 | 125,410 |
Tags: brute force, geometry
Correct Solution:
```
#!/usr/bin/python3
from itertools import product, combinations
def process(case):
regiment = map(rotate, homes, positions, case)
return sum(case) if is_square(regiment) else float('inf')
def is_square(regiment):
dists = list(map(lambda arg: dist_sq(*arg... | output | 1 | 62,705 | 15 | 125,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,706 | 15 | 125,412 |
Tags: brute force, geometry
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt',... | output | 1 | 62,706 | 15 | 125,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,707 | 15 | 125,414 |
Tags: brute force, geometry
Correct Solution:
```
import math
import copy
def getRot(mPos):
x = mPos[0]
y = mPos[1]
aX = mPos[2]
aY = mPos[3]
oldX = x - aX
oldY = y - aY
newX = oldY
newY = oldX
newX *= -1
newX += aX
newY += aY
return([newX, newY])
de... | output | 1 | 62,707 | 15 | 125,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,708 | 15 | 125,416 |
Tags: brute force, geometry
Correct Solution:
```
#ROTATE IS PROBABLY BROKEN
def rotate(x,y,a,b):
x=x-a
y=y-b
new_y = x
new_x = -y
new_x=new_x+a
new_y=new_y+b
return[new_x,new_y]
def marmot_distance(x1,y1,x2,y2):
#distance between 2 pts
answer = pow(pow(x2 - x1, 2) + pow(y2 - y1, 2... | output | 1 | 62,708 | 15 | 125,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,709 | 15 | 125,418 |
Tags: brute force, geometry
Correct Solution:
```
def siblings(initial, root):
th = (initial[0] - root[0], initial[1] - root[1])
return [(root[0] + th[0], root[1] + th[1]),
(root[0] -th[1], root[1] + th[0]),
(root[0] - th[0], root[1] - th[1]),
(root[0] + th[1], root[1] - th[0... | output | 1 | 62,709 | 15 | 125,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,710 | 15 | 125,420 |
Tags: brute force, geometry
Correct Solution:
```
def rotate(i, j):
x, y, p, q = a[i]
for k in range(1, j+1):
x, y = p - (y - q), q + (x - p)
c[i] = x, y
def dist(i, j):
x, y = c[i]
p, q = c[j]
return (x - p) ** 2 + (y - q) ** 2
def check(move):
for i in range(4):
... | output | 1 | 62,710 | 15 | 125,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n) is placed at some position (xi, yi) in the Car... | instruction | 0 | 62,711 | 15 | 125,422 |
Tags: brute force, geometry
Correct Solution:
```
def r(t): t[0], t[1] = t[2] + t[3] - t[1], t[3] + t[0] - t[2]
f = [(0, 0), (1, 3), (2, 15), (3, 63)]
h = [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)]
g = lambda u, v: (u[0] - v[0]) ** 2 + (u[1] - v[1]) ** 2
for i in range(int(input())):
p = [list(map(int, input(... | output | 1 | 62,711 | 15 | 125,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,712 | 15 | 125,424 |
Yes | output | 1 | 62,712 | 15 | 125,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,713 | 15 | 125,426 |
Yes | output | 1 | 62,713 | 15 | 125,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,714 | 15 | 125,428 |
Yes | output | 1 | 62,714 | 15 | 125,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,715 | 15 | 125,430 |
Yes | output | 1 | 62,715 | 15 | 125,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,716 | 15 | 125,432 |
No | output | 1 | 62,716 | 15 | 125,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,717 | 15 | 125,434 |
No | output | 1 | 62,717 | 15 | 125,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,718 | 15 | 125,436 |
No | output | 1 | 62,718 | 15 | 125,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles.
Initially, each mole i (1 ≤ i ≤ 4n)... | instruction | 0 | 62,719 | 15 | 125,438 |
No | output | 1 | 62,719 | 15 | 125,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Wilbur the pig now wants to play with strings. He has found an n by m table consisting only of the digits from 0 to 9 where the rows are numbered 1 to n and the columns are numbered 1 to m. Wilb... | instruction | 0 | 62,733 | 15 | 125,466 |
No | output | 1 | 62,733 | 15 | 125,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a field, which is a rectangular table of size n × m. We assume that the field rows are numbered from 1 to n from top to bottom, and the field columns are numbered from 1 to m from l... | instruction | 0 | 63,421 | 15 | 126,842 |
No | output | 1 | 63,421 | 15 | 126,843 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid that consists of W \times H cells. The upper-left-most cell is (1, 1). You are standing on the cell of (1,1) and you are going to move to cell of (W, H). You can only move to adjacent lower-left, lower or lower-right cells.
There are... | instruction | 0 | 63,946 | 15 | 127,892 |
"Correct Solution:
```
from collections import defaultdict
import sys
readline = sys.stdin.readline
write = sys.stdout.write
MOD = 10**9 + 9
def matmul(N, A, B):
C = [[0]*N for i in range(N)]
for i in range(N):
for j in range(N):
C[i][j] = sum(A[i][k] * B[k][j] for k in range(N)) % MOD
... | output | 1 | 63,946 | 15 | 127,893 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid that consists of W \times H cells. The upper-left-most cell is (1, 1). You are standing on the cell of (1,1) and you are going to move to cell of (W, H). You can only move to adjacent lower-left, lower or lower-right cells.
There are... | instruction | 0 | 63,947 | 15 | 127,894 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+9
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 63,947 | 15 | 127,895 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are... | instruction | 0 | 64,274 | 15 | 128,548 |
Tags: implementation
Correct Solution:
```
#263A in codeforces
matrix = []
for _ in range(5):
matrix.append(list(map(int,input().split())))
for i in range(5):
flag = 0
for j in range(5):
if matrix[i][j] == 1:
flag=1
break
if flag == 1:
break
moves = abs(2-i)+abs(2-j)
print(moves)
``` | output | 1 | 64,274 | 15 | 128,549 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are... | instruction | 0 | 64,279 | 15 | 128,558 |
Tags: implementation
Correct Solution:
```
x = input().split()
y = input().split()
z = input().split()
w = input().split()
s = input().split()
count = 0
col = 0
def col_distance(r):
for index, xs in enumerate(r):
if xs == '1':
if index < 2:
return 2 - index
else:
... | output | 1 | 64,279 | 15 | 128,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from ... | instruction | 0 | 64,280 | 15 | 128,560 |
Yes | output | 1 | 64,280 | 15 | 128,561 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.