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 |
|---|---|---|---|---|---|
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 | 77,844 | 15 | 155,688 |
Yes | output | 1 | 77,844 | 15 | 155,689 |
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 | 77,845 | 15 | 155,690 |
Yes | output | 1 | 77,845 | 15 | 155,691 |
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 | 77,846 | 15 | 155,692 |
Yes | output | 1 | 77,846 | 15 | 155,693 |
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 | 77,847 | 15 | 155,694 |
Yes | output | 1 | 77,847 | 15 | 155,695 |
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 | 77,848 | 15 | 155,696 |
No | output | 1 | 77,848 | 15 | 155,697 |
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 | 77,849 | 15 | 155,698 |
No | output | 1 | 77,849 | 15 | 155,699 |
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 | 77,850 | 15 | 155,700 |
No | output | 1 | 77,850 | 15 | 155,701 |
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 | 77,851 | 15 | 155,702 |
No | output | 1 | 77,851 | 15 | 155,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,983 | 15 | 155,966 |
Tags: implementation
Correct Solution:
```
n=int(input())
a = [int(x) for x in input().split()]
a.sort()
a1=0
a2=0
for i in range(0,int(n/2)):
a1+=abs(a[i]-(i*2+1))
a2+=abs(a[i]-i*2-2)
print(min(a1,a2))
``` | output | 1 | 77,983 | 15 | 155,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,984 | 15 | 155,968 |
Tags: implementation
Correct Solution:
```
#vladprog
n=int(input())
r1,r2=0,0
p=list(map(int,input().split()))
p.sort()
for i in range(n//2):
r1+=abs(2*i+1-p[i])
r2+=abs(2*i+2-p[i])
print(min(r1,r2))
``` | output | 1 | 77,984 | 15 | 155,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,985 | 15 | 155,970 |
Tags: implementation
Correct Solution:
```
def get_ints():
return list(map(int, input().split()))
N = int(input())
a = get_ints()
a = sorted(a)
g = sum([abs(a[i]-(2*i+1)) for i in range(N//2)])
h = sum([abs(a[i]-(2*i+2)) for i in range(N//2)])
print(min(g,h))
``` | output | 1 | 77,985 | 15 | 155,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,986 | 15 | 155,972 |
Tags: implementation
Correct Solution:
```
n = int(input())
p = list(sorted(map(int, input().split())))
s1 = s2 = 0
for i in range(n // 2):
k = 1 + i * 2
s1 += abs(p[i] - k)
s2 += abs(p[i] - k - 1)
print(min(s1, s2))
``` | output | 1 | 77,986 | 15 | 155,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,987 | 15 | 155,974 |
Tags: implementation
Correct Solution:
```
n = int(input())
p = sorted(map(int, input().split()))
ans1 = 0
ans2 = 0
for i, j in enumerate(p):
ans1 += abs((1 + i*2) - j)
ans2 += abs((2 + i*2) - j)
print (min(ans1, ans2))
``` | output | 1 | 77,987 | 15 | 155,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,988 | 15 | 155,976 |
Tags: implementation
Correct Solution:
```
n = int(input())
p = list(map(int, input().split()))
white = [x for x in range(1, n+1, 2)]
black = [x for x in range(2, n+1, 2)]
p.sort()
ws = sum([abs(white[i]-p[i]) for i in range(n//2)])
bs = sum([abs(black[i]-p[i]) for i in range(n//2)])
print(min(ws, bs))
``` | output | 1 | 77,988 | 15 | 155,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,989 | 15 | 155,978 |
Tags: implementation
Correct Solution:
```
import copy
def chess_min_mov(n, positions):
black_moves = 0
black_positions = copy.copy(positions)
for index in range(1, n+1, 2):
black_moves += abs(index-black_positions.pop(0))
white_moves = 0
for index in range(2, n+1, 2):
white_moves +... | output | 1 | 77,989 | 15 | 155,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is kn... | instruction | 0 | 77,990 | 15 | 155,980 |
Tags: implementation
Correct Solution:
```
n=int(input())
pos=list(map(int,input().split()))
pos.sort()
bsum=sum([abs(pos[i]-2*i-1) for i in range(int(n/2))])
wsum=sum([abs(pos[i]-2*i-2) for i in range(int(n/2))])
print (min(bsum,wsum))
``` | output | 1 | 77,990 | 15 | 155,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,991 | 15 | 155,982 |
Yes | output | 1 | 77,991 | 15 | 155,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,992 | 15 | 155,984 |
Yes | output | 1 | 77,992 | 15 | 155,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,993 | 15 | 155,986 |
Yes | output | 1 | 77,993 | 15 | 155,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,994 | 15 | 155,988 |
Yes | output | 1 | 77,994 | 15 | 155,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,995 | 15 | 155,990 |
No | output | 1 | 77,995 | 15 | 155,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,996 | 15 | 155,992 |
No | output | 1 | 77,996 | 15 | 155,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,997 | 15 | 155,994 |
No | output | 1 | 77,997 | 15 | 155,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell ... | instruction | 0 | 77,998 | 15 | 155,996 |
No | output | 1 | 77,998 | 15 | 155,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,413 | 15 | 156,826 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
from collections import deque
n, m = map(int, input().split())
a = []
for _ in range(n):
a.append(input())
# n = 1000
# m = 1000
# a = [['#'] * m for _ in range(n)]
used = [[False] * m for _ in range(n)]
used_row = [False] * n
used... | output | 1 | 78,413 | 15 | 156,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,414 | 15 | 156,828 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def print_table(title, table):
print(title)
for row in table:
print(list(map(int, row)))
def val... | output | 1 | 78,414 | 15 | 156,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,415 | 15 | 156,830 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
def print(val):
sys.stdout.write(str(val) + '\n')
from collections import deque
def find_components(node,graph,n,m,visited):
queue = deque([node])
while queue:
node = queue[-1]
... | output | 1 | 78,415 | 15 | 156,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,416 | 15 | 156,832 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
try:
step=[[0,1],[0,-1],[-1,0],[1,0]]
n,m=list(map(int,input().split()))
vis=[[0 for i in range(1005)] for j in range(1005)]
s=[]
for i in range(n):s.append(input())
def check(i,j):
return i>=0 and i<n and... | output | 1 | 78,416 | 15 | 156,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,417 | 15 | 156,834 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
from sys import exit
n, m = map(int, input().split())
a = [tuple(input()) for i in range(n)]
whiteline = False
whilecolumne = False
howmany = 0
ar = [[0] * m for i in range(n)]
for x in range(n):
lastelem = '.'
shag = 0
for y ... | output | 1 | 78,417 | 15 | 156,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,418 | 15 | 156,836 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
# stdin = open("input.txt","r")
# stdout = open("output.txt","w")
n,m = stdin.readline().strip().split(' ')
n,m = int(n),int(m)
mtr=[]
for i in range(n):
mtr.app... | output | 1 | 78,418 | 15 | 156,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,419 | 15 | 156,838 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
n, m = map(int, input().split())
a = []
for _ in range(n):
a.append(input())
# n = 1000
# m = 1000
# a = [['#'] * m for _ in range(n)]
used = [[False] * m for _ in range(n)]
used_row = [False] * n
used_col = [False] * m
def build(i... | output | 1 | 78,419 | 15 | 156,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,420 | 15 | 156,840 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
from sys import stdin
input=lambda : stdin.readline().strip()
from math import ceil,sqrt,factorial,gcd
def check(z):
c=0
for i in range(len(z)):
if z[i]=='#':
if c==0:
c+=1
else:
if z[i-1]!='#':
return False
return... | output | 1 | 78,420 | 15 | 156,841 |
Provide tags and a correct Python 2 solution for this coding contest problem.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't care.
There is an n× m grid. Initially, you may... | instruction | 0 | 78,421 | 15 | 156,842 |
Tags: constructive algorithms, dfs and similar, dsu, graphs
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def fun(x):
return 1*(x=='#')
def in_num():
return int(raw_... | output | 1 | 78,421 | 15 | 156,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,422 | 15 | 156,844 |
Yes | output | 1 | 78,422 | 15 | 156,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,423 | 15 | 156,846 |
Yes | output | 1 | 78,423 | 15 | 156,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,424 | 15 | 156,848 |
Yes | output | 1 | 78,424 | 15 | 156,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,425 | 15 | 156,850 |
Yes | output | 1 | 78,425 | 15 | 156,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,426 | 15 | 156,852 |
No | output | 1 | 78,426 | 15 | 156,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,427 | 15 | 156,854 |
No | output | 1 | 78,427 | 15 | 156,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,428 | 15 | 156,856 |
No | output | 1 | 78,428 | 15 | 156,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,429 | 15 | 156,858 |
No | output | 1 | 78,429 | 15 | 156,859 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monopole magnet is a magnet that only has one pole, either north or south. They don't actually exist since real magnets have two poles, but this is a programming contest problem, so we don't c... | instruction | 0 | 78,430 | 15 | 156,860 |
No | output | 1 | 78,430 | 15 | 156,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Having learned (not without some help from the Codeforces participants) to play the card game from the previous round optimally, Shrek and Donkey (as you may remember, they too live now in the Kingdom of Far Far Away) have decided to quit th... | instruction | 0 | 78,480 | 15 | 156,960 |
Tags: games
Correct Solution:
```
def get(a):
global m
R = -1
G = -1
mi = -1
for i in range(m):
if a[i] == '-':
mi = i
elif a[i] == "R":
R = i
else:
G = i
return G, R, mi
n, m, k = map(int, input().split())
draw = [0, 0]
t = []
for i ... | output | 1 | 78,480 | 15 | 156,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inna loves sweets very much. That's why she decided to play a game called "Sweet Matrix".
Inna sees an n × m matrix and k candies. We'll index the matrix rows from 1 to n and the matrix columns from 1 to m. We'll represent the cell in the i... | instruction | 0 | 78,614 | 15 | 157,228 |
Tags: constructive algorithms
Correct Solution:
```
def getCells(n, m, k):
penalty = 0
cells = []
for l in range(2,n+m+1):
iLeft = 1 if l-1 <= m else l-m
iRight = n if l-n > 0 else l-1
for i in range(iLeft, iRight+1):
j = l-i
penalty += l-1
cells.a... | output | 1 | 78,614 | 15 | 157,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inna loves sweets very much. That's why she decided to play a game called "Sweet Matrix".
Inna sees an n × m matrix and k candies. We'll index the matrix rows from 1 to n and the matrix columns from 1 to m. We'll represent the cell in the i... | instruction | 0 | 78,615 | 15 | 157,230 |
Tags: constructive algorithms
Correct Solution:
```
string = input()
l = string.split(" ")
n, m, k = int(l[0]),int(l[1]),int(l[2])
l = [{(1,1),}]
count = 1
In = 0
while count < k:
s = set()
for i in l[In]:
x = i[0]+1
y = i[1]
if x<=n and y<=m:
t = [0,0]
t[0],t[1] = x, y
s.add(tuple(t))
x = i[0]
y =... | output | 1 | 78,615 | 15 | 157,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inna loves sweets very much. That's why she decided to play a game called "Sweet Matrix".
Inna sees an n × m matrix and k candies. We'll index the matrix rows from 1 to n and the matrix columns... | instruction | 0 | 78,616 | 15 | 157,232 |
No | output | 1 | 78,616 | 15 | 157,233 |
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,686 | 15 | 157,372 |
Tags: games, greedy, implementation, math
Correct Solution:
```
x1, y1, x2, y2 = map(int, input().split())
if (x1 > x2 or y1 > y2) and x1 + y1 > max(x2, y2):
print("Vasiliy")
else:
print("Polycarp")
``` | output | 1 | 78,686 | 15 | 157,373 |
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,687 | 15 | 157,374 |
Tags: games, greedy, implementation, math
Correct Solution:
```
x1, y1, x2, y2 = map(int, input().split())
print("Polycarp" if ((x2 >= x1 and y2 >= y1) or (max(x2, y2) >= x1 + y1)) else "Vasiliy")
``` | output | 1 | 78,687 | 15 | 157,375 |
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,688 | 15 | 157,376 |
Tags: games, greedy, implementation, math
Correct Solution:
```
px, py, vx, vy = map(int, input().split())
if (px <= vx and py <= vy) or px+py <= max(vx, vy):
print("Polycarp")
else:
print("Vasiliy")
``` | output | 1 | 78,688 | 15 | 157,377 |
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,689 | 15 | 157,378 |
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')
# Made By Mostafa_Khaled
``` | output | 1 | 78,689 | 15 | 157,379 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.