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.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessboard, you can assign the coordinates (r,c), whe... | instruction | 0 | 10,820 | 15 | 21,640 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
x, y = list(map(int, input().split(" ")))
n1 = abs(x-1) + abs(y-1)
n2 = abs(x-n) + abs(y-n)
if n1 > n2:
print("Black")
else:
print("White")
``` | output | 1 | 10,820 | 15 | 21,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessboard, you can assign the coordinates (r,c), whe... | instruction | 0 | 10,821 | 15 | 21,642 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
(x,y)=map(int,input().split())
if ((x-1)+(y-1))>((n-x)+(n-y)):
print("Black")
else:
print("White")
``` | output | 1 | 10,821 | 15 | 21,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessboard, you can assign the coordinates (r,c), whe... | instruction | 0 | 10,822 | 15 | 21,644 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
x, y = map(int, input().split())
w = max(abs(x-1), abs(y-1))
b = max(abs(x-n), abs(y-n))
if b < w:
print("Black")
else:
print("White")
``` | output | 1 | 10,822 | 15 | 21,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,823 | 15 | 21,646 |
Yes | output | 1 | 10,823 | 15 | 21,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,824 | 15 | 21,648 |
Yes | output | 1 | 10,824 | 15 | 21,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,825 | 15 | 21,650 |
Yes | output | 1 | 10,825 | 15 | 21,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,826 | 15 | 21,652 |
Yes | output | 1 | 10,826 | 15 | 21,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,827 | 15 | 21,654 |
No | output | 1 | 10,827 | 15 | 21,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,828 | 15 | 21,656 |
No | output | 1 | 10,828 | 15 | 21,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,829 | 15 | 21,658 |
No | output | 1 | 10,829 | 15 | 21,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a chessboard with a width of n and a height of n, rows are numbered from bottom to top from 1 to n, columns are numbered from left to right from 1 to n. Therefore, for each cell of the chessb... | instruction | 0 | 10,830 | 15 | 21,660 |
No | output | 1 | 10,830 | 15 | 21,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,006 | 15 | 22,012 |
Tags: binary search, implementation
Correct Solution:
```
def valid(n, m, x, y):
return x >= 1 and x <= n and y >= 1 and y <= m
def binary_search(n, m, x, y, dx, dy):
l, r = 0, n+m+5
while (l+1 < r):
mid = l+r >> 1
if (valid(n, m, x + mid*dx, y + mid*dy)):
l = mid
el... | output | 1 | 11,006 | 15 | 22,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,007 | 15 | 22,014 |
Tags: binary search, implementation
Correct Solution:
```
import re
import itertools
from collections import Counter
class Task:
n, m = 0, 0
start, end = 0, 0
vectors = []
answer = 0
def getData(self):
self.n, self.m = [int(x) for x in input().split(' ')]
self.start, self.end = [i... | output | 1 | 11,007 | 15 | 22,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,008 | 15 | 22,016 |
Tags: binary search, implementation
Correct Solution:
```
from sys import stdin, stdout
def main():
n,m = map(int, stdin.readline().split())
xc, yc = map(int, stdin.readline().split())
k = int(stdin.readline())
total = 0
for _ in range(k):
dx, dy = map(int, stdin.readline().split(... | output | 1 | 11,008 | 15 | 22,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,009 | 15 | 22,018 |
Tags: binary search, implementation
Correct Solution:
```
R = lambda: map(int, input().split())
n, m = R()
x0, y0 = R()
k = int(input())
xys = [list(R()) for i in range(k)]
res = 0
for dx, dy in xys:
l, r = 0, max(n, m) + 7
while l < r:
mm = (l + r + 1) // 2
xx, yy = x0 + mm * dx, y0 + mm * dy
... | output | 1 | 11,009 | 15 | 22,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,010 | 15 | 22,020 |
Tags: binary search, implementation
Correct Solution:
```
# ip = open("testdata.txt", "r")
# def input():
# return ip.readline().strip()
n, m = map(int, input().split())
x0, y0 = map(int, input().split())
k = int(input())
total = 0
for i in range(k):
dx, dy = map(int, input().split())
if dx >= 0:
s1 = (n - x... | output | 1 | 11,010 | 15 | 22,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,011 | 15 | 22,022 |
Tags: binary search, implementation
Correct Solution:
```
n,m = list(map(int,input().split()))
curx,cury = list(map(int,input().split()))
k = int(input())
ans = 0
for i in range(k):
x,y = list(map(int,input().split()))
sx,sy = 1<<30,1<<30
if x<0:
sx = (curx-1)//abs(x)
if x>0:
sx = (n-cur... | output | 1 | 11,011 | 15 | 22,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,012 | 15 | 22,024 |
Tags: binary search, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""Steps.ipynb
Automatically generated by Colaboratory.
Original file is located at
https://colab.research.google.com/drive/15H6TXUKZ_A8CXwh0JHcGO43Z6QgCkYWd
"""
def readln(): return tuple(map(int, input().split()))
n, m = readln... | output | 1 | 11,012 | 15 | 22,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play touch and run with himself. You may ask: "How di... | instruction | 0 | 11,013 | 15 | 22,026 |
Tags: binary search, implementation
Correct Solution:
```
x,y=map(eval,input().split())
x0,y0=map(eval,input().split())
n=eval(input())
d=[]
num=0
for i in range(n):
d.append(list(map(eval,input().split())))
for i in d:
if i[0]>0 and i[1]>0:
a=min((x-x0)//i[0],(y-y0)//i[1])
elif i[0]==0 and i[1]>0:
... | output | 1 | 11,013 | 15 | 22,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,014 | 15 | 22,028 |
Yes | output | 1 | 11,014 | 15 | 22,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,015 | 15 | 22,030 |
Yes | output | 1 | 11,015 | 15 | 22,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,016 | 15 | 22,032 |
Yes | output | 1 | 11,016 | 15 | 22,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,017 | 15 | 22,034 |
Yes | output | 1 | 11,017 | 15 | 22,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,018 | 15 | 22,036 |
No | output | 1 | 11,018 | 15 | 22,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,019 | 15 | 22,038 |
No | output | 1 | 11,019 | 15 | 22,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,020 | 15 | 22,040 |
No | output | 1 | 11,020 | 15 | 22,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya went out for a walk in the yard but there weren't any of his friends outside and he had no one to play touch and run. But the boy didn't lose the high spirits and decided to play t... | instruction | 0 | 11,021 | 15 | 22,042 |
No | output | 1 | 11,021 | 15 | 22,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,037 | 15 | 22,074 |
Tags: brute force, implementation
Correct Solution:
```
n, m = map(int, input().split())
arr = [[0] * (n+4) for _ in range(n+4)]
for c in range(m):
x, y = map(int, input().split())
for i in range(x, x + 3):
for j in range(y, y + 3):
arr[i][j] += 1
if arr[i][j] == 9:
... | output | 1 | 11,037 | 15 | 22,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,038 | 15 | 22,076 |
Tags: brute force, implementation
Correct Solution:
```
a,b=map(int,input().split())
z=[[0]*(a+4) for i in range(a+4)]
def gh(i,j):
for i1 in range(i-2,i+1):
for j1 in range(j-2,j+1):
if i1<1 or j1<1:continue
ok=True
for i2 in range(i1,i1+3):
for j2 in ran... | output | 1 | 11,038 | 15 | 22,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,039 | 15 | 22,078 |
Tags: brute force, implementation
Correct Solution:
```
n,m = map(int,input().split())
grid = [[0 for i in range(n)] for j in range(n)]
for tc in range(m):
r,c = map(int,input().split())
r -= 1
c -= 1
ok = False
for i in range(r-1,r+2):
for j in range(c-1,c+2):
# print(i,j)
... | output | 1 | 11,039 | 15 | 22,079 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,040 | 15 | 22,080 |
Tags: brute force, implementation
Correct Solution:
```
from sys import stdin
a,b=map(int,stdin.readline().split())
z=[[0]*(a+4) for i in range(a+4)]
def gh(i,j):
for i1 in range(i-2,i+1):
for j1 in range(j-2,j+1):
if i1<1 or j1<1:continue
ok=True
for i2 in range(i1,i1+3)... | output | 1 | 11,040 | 15 | 22,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,041 | 15 | 22,082 |
Tags: brute force, implementation
Correct Solution:
```
def f():
n, m = map(int, input().split())
p = [[0] * (n + 2) for i in range(n + 2)]
for k in range(m):
x, y = map(int, input().split())
for i in range(x - 1, x + 2):
for j in range(y - 1, y + 2):
if p[i][j] =... | output | 1 | 11,041 | 15 | 22,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,042 | 15 | 22,084 |
Tags: brute force, implementation
Correct Solution:
```
def f():
n, m = map(int, input().split())
p = [[0] * (n + 2) for i in range(n + 2)]
for k in range(m):
x, y = map(int, input().split())
for i in range(x - 1, x + 2):
for j in range(y - 1, y + 2):
if p[... | output | 1 | 11,042 | 15 | 22,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,043 | 15 | 22,086 |
Tags: brute force, implementation
Correct Solution:
```
import math
from sys import stdin
from math import ceil
import sys
if __name__ == '__main__':
numbers = list(map(int, input().split()))
n = numbers[0]
m = numbers[1]
moves = [[0] * (n + 4) for _ in range(n + 4)]
for i in range(m):
list... | output | 1 | 11,043 | 15 | 22,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n cells. After that, he started to paint the white ... | instruction | 0 | 11,044 | 15 | 22,088 |
Tags: brute force, implementation
Correct Solution:
```
R=lambda:map(int,input().split())
n,m=R()
if n<3 or m<9:
print(-1)
exit()
a=[[0]*(n-2) for i in range(n-2)]
for i in range(1,m+1):
x,y=R()
x-=1
y-=1
for x0 in range(x-2,x+1):
for y0 in range(y-2,y+1):
if x0<0 or y0<0 or ... | output | 1 | 11,044 | 15 | 22,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n ce... | instruction | 0 | 11,045 | 15 | 22,090 |
Yes | output | 1 | 11,045 | 15 | 22,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n ce... | instruction | 0 | 11,046 | 15 | 22,092 |
Yes | output | 1 | 11,046 | 15 | 22,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n ce... | instruction | 0 | 11,047 | 15 | 22,094 |
Yes | output | 1 | 11,047 | 15 | 22,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n ce... | instruction | 0 | 11,048 | 15 | 22,096 |
Yes | output | 1 | 11,048 | 15 | 22,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n ce... | instruction | 0 | 11,049 | 15 | 22,098 |
No | output | 1 | 11,049 | 15 | 22,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One not particularly beautiful evening Valera got very bored. To amuse himself a little bit, he found the following game.
He took a checkered white square piece of paper, consisting of n Γ n ce... | instruction | 0 | 11,050 | 15 | 22,100 |
No | output | 1 | 11,050 | 15 | 22,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,161 | 15 | 22,322 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
import math
from collections import *
from functools import reduce,cmp_to_key,lru_cache
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_siz... | output | 1 | 11,161 | 15 | 22,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,162 | 15 | 22,324 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
import sys
from math import gcd
from collections import defaultdict as dd
input=sys.stdin.readline
n=int(input())
l=list(map(int,input().split()))
c=list(map(int,input().split()))
dp=dict()
for i in range(n):
if dp.get(l[i]):
dp[l[i]]=min(dp[l[i]],... | output | 1 | 11,162 | 15 | 22,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,163 | 15 | 22,326 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
import math
g=0
n=int(input())
b=list(map(int,input().split()))
c=list(map(int,input().split()))
dp=dict()
dp[0]=0
s=set([0])
for i in range(n):
for j in s:
g=math.gcd(j,b[i])
if g in dp:
dp[g]=min(dp[g],dp[j]+c[i])
else... | output | 1 | 11,163 | 15 | 22,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,164 | 15 | 22,328 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
from col... | output | 1 | 11,164 | 15 | 22,329 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,165 | 15 | 22,330 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
def main():
input()
acc = {0: 0}
for p, c in zip(list(map(int, input().split())),
list(map(int, input().split()))):
adds = []
for b, u in acc.items():
a = p
while b:
a, b =... | output | 1 | 11,165 | 15 | 22,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,166 | 15 | 22,332 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
from collections import defaultdict
from math import gcd
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
dp = defaultdict(lambda: float("inf"))
for a, b in zip(A, B):
dp[a] = min(dp[a], b)
for d in dp.copy():
... | output | 1 | 11,166 | 15 | 22,333 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,167 | 15 | 22,334 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
n = int(input())
l = [int(x) for x in input().split()]
c = [int(x) for x in input().split()]
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
gcds = {0: 0}
for i in range(n):
adds = {}
for g in gcds.keys():
... | output | 1 | 11,167 | 15 | 22,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length... | instruction | 0 | 11,168 | 15 | 22,336 |
Tags: bitmasks, brute force, dp, math
Correct Solution:
```
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
#... | output | 1 | 11,168 | 15 | 22,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are a... | instruction | 0 | 11,169 | 15 | 22,338 |
Yes | output | 1 | 11,169 | 15 | 22,339 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.