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 a correct Python 3 solution for this coding contest problem.
Problem
Gaccho owns a field separated by W horizontal x H vertical squares. The cell in the x-th column and the y-th row is called the cell (x, y). Only one plant with a height of 0 cm is planted on the land of some trout, and nothing is planted on ... | instruction | 0 | 6,535 | 15 | 13,070 |
"Correct Solution:
```
# AOJ 1587: Plants
# Python3 2018.7.13 bal4u
hi = [[0 for j in range(51)] for i in range(51)]
W, H, T = map(int, input().split())
P = int(input())
for i in range(P):
x, y, t = map(int, input().split())
hi[x][y] += 1
ans = 0;
for y in range(H):
v = list(map(int, input().split()))
for x in ran... | output | 1 | 6,535 | 15 | 13,071 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,540 | 15 | 13,080 |
"Correct Solution:
```
#!/usr/bin/python3
from heapq import heappush, heappop
solution = [i + 1 for i in range(15)] + [0]
sol_idx = (15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
MAX_DEPTH = 45
count = 0
neighbor = (
(1, 4),
(0, 2, 5),
(1, 6, 3),
(2, 7),
(0, 5, 8),
(1, 4, 6, 9),
(2, ... | output | 1 | 6,540 | 15 | 13,081 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,541 | 15 | 13,082 |
"Correct Solution:
```
from heapq import heappop, heappush
from functools import lru_cache
@lru_cache(maxsize=None)
def manhattan(size, i, n):
if n == 0:
return 0
else:
dn, mn = divmod(n-1, size)
di, mi = divmod(i, size)
return abs(dn-di) + abs(mn-mi)
class Board:
__sl... | output | 1 | 6,541 | 15 | 13,083 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,542 | 15 | 13,084 |
"Correct Solution:
```
from sys import stdin
readline = stdin.readline
GOAL = [i for i in range(1, 16)] + [0]
MAX_DEPTH = 45 # 80
count = 0
# ??£??\?????????
adjacent = (
(1, 4), # 0
(0, 2, 5), # 1
(1, 6, 3), # 2
(2, 7), # 3
(0, 5, 8), # 4
(1, 4, 6, 9), ... | output | 1 | 6,542 | 15 | 13,085 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,543 | 15 | 13,086 |
"Correct Solution:
```
from heapq import heappop, heappush
manhattan = (
(0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6),
(1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4, 4, 3, 4, 5),
(2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3, 5, 4, 3, 4),
(3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2, 6, 5, 4, 3),
(1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3,... | output | 1 | 6,543 | 15 | 13,087 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,544 | 15 | 13,088 |
"Correct Solution:
```
from heapq import heappop, heappush
manhattan = (
(0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6),
(1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4, 4, 3, 4, 5),
(2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3, 5, 4, 3, 4),
(3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2, 6, 5, 4, 3),
(1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3,... | output | 1 | 6,544 | 15 | 13,089 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,545 | 15 | 13,090 |
"Correct Solution:
```
from sys import stdin
from heapq import heappush, heappop
solution = [i for i in range(1, 16)] + [0]
sol_idx = (15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
MAX_DEPTH = 45
count = 0
neighbor = (
(1, 4),
(0, 2, 5),
(1, 6, 3),
(2, 7),
(0, 5, 8),
(1, 4, 6, 9),
(2... | output | 1 | 6,545 | 15 | 13,091 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,546 | 15 | 13,092 |
"Correct Solution:
```
distance = (
(),
(0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6),
(1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4, 4, 3, 4, 5),
(2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3, 5, 4, 3, 4),
(3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2, 6, 5, 4, 3),
(1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5),
(2... | output | 1 | 6,546 | 15 | 13,093 |
Provide a correct Python 3 solution for this coding contest problem.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0... | instruction | 0 | 6,547 | 15 | 13,094 |
"Correct Solution:
```
board = [int(s) for _ in range(4) for s in input().split()]
move_piece = [None]* 46
GOAL = list(range(1,16)) + [0]
def create_adjacent(h, w):
adjacent = [[] for _ in range(h*w)]
for i in range(h * w):
if i % w != w-1:
adjacent[i].append(i+1)
if i % w != 0:
adjacent[i].ap... | output | 1 | 6,547 | 15 | 13,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,548 | 15 | 13,096 |
Yes | output | 1 | 6,548 | 15 | 13,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,549 | 15 | 13,098 |
Yes | output | 1 | 6,549 | 15 | 13,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,550 | 15 | 13,100 |
Yes | output | 1 | 6,550 | 15 | 13,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,551 | 15 | 13,102 |
Yes | output | 1 | 6,551 | 15 | 13,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,552 | 15 | 13,104 |
No | output | 1 | 6,552 | 15 | 13,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,553 | 15 | 13,106 |
No | output | 1 | 6,553 | 15 | 13,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,554 | 15 | 13,108 |
No | output | 1 | 6,554 | 15 | 13,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by... | instruction | 0 | 6,555 | 15 | 13,110 |
No | output | 1 | 6,555 | 15 | 13,111 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,679 | 15 | 13,358 |
Tags: greedy
Correct Solution:
```
from sys import stdin,stdout
for i in stdin:
n,m,d=list(map(int,i.strip().split()))
break
for i in stdin:
C=list(map(int,i.strip().split()))
break
if sum(C) + (d-1)*(m+1)<n:
stdout.write('NO\n')
else:
stdout.write('YES\n')
L=[]
k=n-sum(C)
i=1
wh... | output | 1 | 6,679 | 15 | 13,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,680 | 15 | 13,360 |
Tags: greedy
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sat Feb 22 19:56:29 2020
@author: dennis
"""
import atexit
import io
import sys
_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER
... | output | 1 | 6,680 | 15 | 13,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,681 | 15 | 13,362 |
Tags: greedy
Correct Solution:
```
n,m,d = map(int,input().split())
c = list(map(int,input().split()))
sc = sum(c)
if sc + (len(c)+ 1) * (d - 1) < n:
print("NO")
else:
print("YES")
ko = n - sc
for i in range(m):
if ko != 0:
if ko >= d - 1:
print("0 " * (d -1 ), end = ... | output | 1 | 6,681 | 15 | 13,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,682 | 15 | 13,364 |
Tags: greedy
Correct Solution:
```
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int,minp().split())
def solve():
n, m, d = mints()
a = list(mints())
b = [0]*m
s = sum(a)
p = 0
for i in range(m):
b[i] = p + d
p = p + d + a[i] - 1
if ... | output | 1 | 6,682 | 15 | 13,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,683 | 15 | 13,366 |
Tags: greedy
Correct Solution:
```
n,m,d=map(int,input().split())
arr=list(map(int,input().split()))
if((m+1)*(d-1)>=(n-sum(arr))):
print("YES")
water=n-sum(arr)
ans=[]
co=0
for i in arr:
co+=1
if(water>d-1):
jump=d-1
water-=jump
else:
jum... | output | 1 | 6,683 | 15 | 13,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,684 | 15 | 13,368 |
Tags: greedy
Correct Solution:
```
n, m, d = map(int, input().split())
d -= 1
C = list(map(int, input().split()))
h = n - sum(C)
kek = []
for i in range(m):
if h >= d:
kek += [0] * d + [i + 1] * C[i]
h -= d
else:
kek += [0] * h + [i + 1] * C[i]
h = 0
if h > d:
print('NO')
els... | output | 1 | 6,684 | 15 | 13,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,685 | 15 | 13,370 |
Tags: greedy
Correct Solution:
```
n, m, d = map(int, input().split())
c= [int(x) for x in input().split()]
s = sum(c)
# m + 1 intervals
# n -s number of cells
#print(m+1, n -s)
if (n - s ) / (m+1) > d- 1:
print("NO")
else:
print("YES")
r = []
cells = n - s
for i, p in enumerate(c, start=1):
... | output | 1 | 6,685 | 15 | 13,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n + 1). There are also m wooden platforms on a ri... | instruction | 0 | 6,686 | 15 | 13,372 |
Tags: greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
N, M, D = map(int, input().split())
C = list(map(int, input().split()))
L = sum(C)+(M+1)*(D-1)
if L < N:
print('NO')
else:
print('YES')
rem = L - N
water = []
for i in range(M+1):
if rem >= D-1:
water.appe... | output | 1 | 6,686 | 15 | 13,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,687 | 15 | 13,374 |
Yes | output | 1 | 6,687 | 15 | 13,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,688 | 15 | 13,376 |
Yes | output | 1 | 6,688 | 15 | 13,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,689 | 15 | 13,378 |
Yes | output | 1 | 6,689 | 15 | 13,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,690 | 15 | 13,380 |
Yes | output | 1 | 6,690 | 15 | 13,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,691 | 15 | 13,382 |
No | output | 1 | 6,691 | 15 | 13,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,692 | 15 | 13,384 |
No | output | 1 | 6,692 | 15 | 13,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,693 | 15 | 13,386 |
No | output | 1 | 6,693 | 15 | 13,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n + 1 (more formally, the river can be represented as a sequence of n + 2 cells numbered from 0 to n ... | instruction | 0 | 6,694 | 15 | 13,388 |
No | output | 1 | 6,694 | 15 | 13,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,810 | 15 | 13,620 |
Tags: brute force, geometry, greedy
Correct Solution:
```
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
xs=[]
ys=[]
for ii in range(n):
x,y=map(int,input().split())
xs.append(x)
ys.append(y)
#print(xs)
#print(ys)
done=False
for i in ran... | output | 1 | 6,810 | 15 | 13,621 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,811 | 15 | 13,622 |
Tags: brute force, geometry, greedy
Correct Solution:
```
import math
for _ in range(int(input())):
n,k=map(int,input().split())
l=[]
for __ in range(n):
x,y=map(int,input().split())
l.append([x,y])
c=0
cc=0
#print(l,len(l),n)
for i in rang... | output | 1 | 6,811 | 15 | 13,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,812 | 15 | 13,624 |
Tags: brute force, geometry, greedy
Correct Solution:
```
t = int(input())
for i in range(t):
n,k = map(int,input().split())
L = []
for j in range(n):
x,y = map(int,input().split())
L.append([x,y])
mn = 0
ok = False
for i in range(n):
mn = 0
for j in ran... | output | 1 | 6,812 | 15 | 13,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,813 | 15 | 13,626 |
Tags: brute force, geometry, greedy
Correct Solution:
```
import io
import os
from collections import Counter, defaultdict, deque
def solve(N, K, balls):
for x1, y1 in balls:
bad = False
for x2, y2 in balls:
if x1 == x2 and y1 == y2:
continue
if abs(x1 - x2... | output | 1 | 6,813 | 15 | 13,627 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,814 | 15 | 13,628 |
Tags: brute force, geometry, greedy
Correct Solution:
```
import sys
import os
from io import BytesIO, IOBase
#Fast IO Region
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or ... | output | 1 | 6,814 | 15 | 13,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,815 | 15 | 13,630 |
Tags: brute force, geometry, greedy
Correct Solution:
```
t=int(input())
for s in range(t):
n,k=map(int,input().split())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
flag=0
for i in range(0,n):
c=0
for j in range(0,n):
if(abs(l... | output | 1 | 6,815 | 15 | 13,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,816 | 15 | 13,632 |
Tags: brute force, geometry, greedy
Correct Solution:
```
from os import path
import sys
# mod = int(1e9 + 7)
# import re # can use multiple splits
from math import ceil, floor,gcd,log
from collections import defaultdict , Counter
# from bisect import bisect_left, bisect_right
#popping from the end is less taxing,sinc... | output | 1 | 6,816 | 15 | 13,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls... | instruction | 0 | 6,817 | 15 | 13,634 |
Tags: brute force, geometry, greedy
Correct Solution:
```
t= int(input())
for _ in range(t):
n, k = map(int, input().split())
XY = []
for i in range(n):
x,y = map(int, input().split())
XY.append((x, y))
flag = False
for i in range(n):
xi, yi = XY[i]
for j in range(n):... | output | 1 | 6,817 | 15 | 13,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,818 | 15 | 13,636 |
Yes | output | 1 | 6,818 | 15 | 13,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,819 | 15 | 13,638 |
Yes | output | 1 | 6,819 | 15 | 13,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,820 | 15 | 13,640 |
Yes | output | 1 | 6,820 | 15 | 13,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,821 | 15 | 13,642 |
Yes | output | 1 | 6,821 | 15 | 13,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,822 | 15 | 13,644 |
No | output | 1 | 6,822 | 15 | 13,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,823 | 15 | 13,646 |
No | output | 1 | 6,823 | 15 | 13,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,824 | 15 | 13,648 |
No | output | 1 | 6,824 | 15 | 13,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n distinct points (x_1, y_1),…,(x_n,y_n) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it's charg... | instruction | 0 | 6,825 | 15 | 13,650 |
No | output | 1 | 6,825 | 15 | 13,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom really likes candies and doesn't like spiders as they frequently steal candies. One day Om Nom fancied a walk in a park. Unfortunately, the park has some spiders and Om Nom doesn't want to see them at all.
<image>
The park can be re... | instruction | 0 | 7,009 | 15 | 14,018 |
Tags: implementation, math
Correct Solution:
```
n,m,k=[int(x) for x in input().split()]
park=[input() for i in range(n)]
answers=[0]*m
for inot in range(n):
for j in range(m):
if park[inot][j]!='.':
i=(j,inot,park[inot][j])
if i[2]=='R':
if i[0]+i[1]<m:
... | output | 1 | 7,009 | 15 | 14,019 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.