message stringlengths 2 28.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 21 109k | cluster float64 7 7 | __index_level_0__ int64 42 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers from 1 to n from left to right.
Initiall... | instruction | 0 | 49,308 | 7 | 98,616 |
Tags: dp
Correct Solution:
```
INF = 10 ** 18
MX_SZ = 112
dp = [[[INF for k in range (MX_SZ)] for j in range (MX_SZ)] for i in range (MX_SZ)]
best = [[[(INF, INF) for k in range (MX_SZ)] for j in range (MX_SZ)] for i in range (MX_SZ)]
def read():
return [int(x) for x in input().split()]
n, m, k_res = read()
arr =... | output | 1 | 49,308 | 7 | 98,617 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers from 1 to n from left to right.
Initiall... | instruction | 0 | 49,309 | 7 | 98,618 |
Tags: dp
Correct Solution:
```
def main():
n, m, k = map(int, input().split())
c, *cc = (map(int, input().split()))
pp, *ppp = (list(map(int, input().split())) for _ in range(n))
inf = 2 ** 47
inf2 = inf * 2
nxt = [[0 if i == c - 1 else inf for i in range(m)] if c else pp]
for c, pp in zip(c... | output | 1 | 49,309 | 7 | 98,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,310 | 7 | 98,620 |
Yes | output | 1 | 49,310 | 7 | 98,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,311 | 7 | 98,622 |
Yes | output | 1 | 49,311 | 7 | 98,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,312 | 7 | 98,624 |
Yes | output | 1 | 49,312 | 7 | 98,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,313 | 7 | 98,626 |
Yes | output | 1 | 49,313 | 7 | 98,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,314 | 7 | 98,628 |
No | output | 1 | 49,314 | 7 | 98,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,315 | 7 | 98,630 |
No | output | 1 | 49,315 | 7 | 98,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,316 | 7 | 98,632 |
No | output | 1 | 49,316 | 7 | 98,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with int... | instruction | 0 | 49,317 | 7 | 98,634 |
No | output | 1 | 49,317 | 7 | 98,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a grid with N rows and N columns. The cell at the i-th row and j-th column is denoted (i, j).
Initially, M of the cells are painted black, and all other cells are white. Specifically, t... | instruction | 0 | 49,512 | 7 | 99,024 |
No | output | 1 | 49,512 | 7 | 99,025 |
Provide a correct Python 3 solution for this coding contest problem.
You were lucky enough to get a map just before entering the legendary magical mystery world. The map shows the whole area of your planned exploration, including several countries with complicated borders. The map is clearly drawn, but in sepia ink on... | instruction | 0 | 49,563 | 7 | 99,126 |
"Correct Solution:
```
def main():
while 1:
N = int(input())
if N == 0:
break
D = {}
G = [set() for i in range(N)]
cur = 0
K = []
PS = []
for i in range(N):
ps = []
s = input()
if s in D:
... | output | 1 | 49,563 | 7 | 99,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in order to hack this one.
There are n+1 distinct col... | instruction | 0 | 49,710 | 7 | 99,420 |
Tags: combinatorics, dfs and similar, dp
Correct Solution:
```
def main():
line = input().split()
n = int(line[0])
line = input().split()
v = [int(x) for x in line]
mod = 998244353
dp = [[1] * (n + 5) for i in range(n + 5)]
for sz in range(2, n + 1):
for lo in range(1, n - sz +... | output | 1 | 49,710 | 7 | 99,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in order to hack this one.
There are n+1 distinct col... | instruction | 0 | 49,711 | 7 | 99,422 |
Tags: combinatorics, dfs and similar, dp
Correct Solution:
```
n, m = map(int, input().split())
l = list(map(int, input().split()))
index = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
mini = 10000000000000
for j in range(i, n):
if l[j] < mini:
inde = j
mini = l[j]
index[i][j] = inde
prime =... | output | 1 | 49,711 | 7 | 99,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in order to hack this one.
There are n+1 distinct col... | instruction | 0 | 49,712 | 7 | 99,424 |
Tags: combinatorics, dfs and similar, dp
Correct Solution:
```
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
A=list(map(int,input().split()))
A=[a-1 for a in A]
MININDLIST=[[i]*m for i in range(m)]
for i in range(m):
MIN=A[i]
MININDNOW=i
for j in range(i,m):
if A[j]<MIN:
... | output | 1 | 49,712 | 7 | 99,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in order to hack this one.
There are n+1 distinct col... | instruction | 0 | 49,713 | 7 | 99,426 |
Tags: combinatorics, dfs and similar, dp
Correct Solution:
```
class SparseTable():
"""区間取得クエリをO(1)で答えるデータ構造をO(NlogN)で構築する
query(l, r): 区間[l, r)に対するクエリに答える
"""
def __init__(self, array, n):
n = len(array)
self.row_size = n.bit_length()
# log_tableを構築する
# log_table = [0, ... | output | 1 | 49,713 | 7 | 99,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in order to hack this one.
There are n+1 distinct col... | instruction | 0 | 49,714 | 7 | 99,428 |
Tags: combinatorics, dfs and similar, dp
Correct Solution:
```
from bisect import bisect_left as bl
from bisect import bisect_right as br
import heapq
import math
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353
def factors(n):return sorted(s... | output | 1 | 49,714 | 7 | 99,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in orde... | instruction | 0 | 49,715 | 7 | 99,430 |
No | output | 1 | 49,715 | 7 | 99,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in orde... | instruction | 0 | 49,716 | 7 | 99,432 |
No | output | 1 | 49,716 | 7 | 99,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in orde... | instruction | 0 | 49,717 | 7 | 99,434 |
No | output | 1 | 49,717 | 7 | 99,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the first subtask of problem F. The only differences between this and the second subtask are the constraints on the value of m and the time limit. You need to solve both subtasks in orde... | instruction | 0 | 49,718 | 7 | 99,436 |
No | output | 1 | 49,718 | 7 | 99,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store introduced a new service this year, called "Build ... | instruction | 0 | 49,787 | 7 | 99,574 |
Tags: math
Correct Solution:
```
for n in range(int(input())):
s=sorted(list(map(int,input().split())))
s.reverse()
if s[0]==s[1]==s[2]:
print('Yes')
elif s[0]-(s[1]+s[2])<=1 :
print('Yes')
else:
print('No')
``` | output | 1 | 49,787 | 7 | 99,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store introduced a new service this year, called "Build ... | instruction | 0 | 49,788 | 7 | 99,576 |
Tags: math
Correct Solution:
```
N = int(input())
cases = []
for _ in range(N):
case = [ int(x) for x in input().split() ]
cases.append(case)
def judge(case):
def get_max_and_sum(case):
a, b, c = case
if a > b and a > c:
return a, b + c
elif b > a and b > c:
... | output | 1 | 49,788 | 7 | 99,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store introduced a new service this year, called "Build ... | instruction | 0 | 49,791 | 7 | 99,582 |
Tags: math
Correct Solution:
```
#min of two should be less than or equal to half of third
for _ in range(int(input())):
a,b,c=sorted(map(int,input().split()))
if c<=a+b+1:
print("YES")
else:
print("NO")
``` | output | 1 | 49,791 | 7 | 99,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,792 | 7 | 99,584 |
Yes | output | 1 | 49,792 | 7 | 99,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,793 | 7 | 99,586 |
Yes | output | 1 | 49,793 | 7 | 99,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,794 | 7 | 99,588 |
Yes | output | 1 | 49,794 | 7 | 99,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,795 | 7 | 99,590 |
Yes | output | 1 | 49,795 | 7 | 99,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,796 | 7 | 99,592 |
No | output | 1 | 49,796 | 7 | 99,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,797 | 7 | 99,594 |
No | output | 1 | 49,797 | 7 | 99,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,798 | 7 | 99,596 |
No | output | 1 | 49,798 | 7 | 99,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.
The local store int... | instruction | 0 | 49,799 | 7 | 99,598 |
No | output | 1 | 49,799 | 7 | 99,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,876 | 7 | 99,752 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
for _ in range(int(input())):
input();n, m = map(int, input().split());a = [];flag = "YES"
for _ in range(m):b, c = map(int, input().split());a.append([c, b])
if m % 2:print("NO");continue
a.sort()
for x in range(0, m, 2)... | output | 1 | 49,876 | 7 | 99,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,877 | 7 | 99,754 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
import math
import sys
input=sys.stdin.readline
from collections import Counter, defaultdict, deque
def f(n,m, mp):
#mp = collections.OrderedDict(sorted(mp.items()))
#print(mp)
cap = 2*n - m
if cap%2 == 1:
return "N... | output | 1 | 49,877 | 7 | 99,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,878 | 7 | 99,756 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
in_length = int(input())
final_ouput = []
for i in range(in_length):
blank = input()
[length, num_obstructions] = input().split()
state_saver = dict()
h_positon_obstacles = []
for j in range(int(num_obstructions)):
[row... | output | 1 | 49,878 | 7 | 99,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,879 | 7 | 99,758 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
# Author: yumtam
# Created at: 2021-01-06 06:10
from itertools import groupby
def solve():
input()
n, m = map(int, input().split())
A = [[int(t) for t in input().split()] for _ in range(m)]
A.sort(key=lambda p: p[1])
... | output | 1 | 49,879 | 7 | 99,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,880 | 7 | 99,760 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
for _ in range(int(input())):
input()
n, m = map(int, input().split())
a = [tuple(map(int, input().split())) for _ in range(m)]
a.sort(key=lambda x: x[1])
l = [0, 0]
for r, x in... | output | 1 | 49,880 | 7 | 99,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,881 | 7 | 99,762 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
"""
pppppppppppppppppppp
ppppp ppppppppppppppppppp
ppppppp ppppppppppppppppppppp
pppppppp pppppppppppppppppppppp
pppp... | output | 1 | 49,881 | 7 | 99,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,882 | 7 | 99,764 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
import sys;z=sys.stdin.readline;w=lambda:map(int,z().split())
for _ in[8]*int(z()):
z();_,m=w();d=l=0
for x,y in sorted([*w()][::-1]for _ in [8]*m):
d+=(x+y)%2*2-1
if abs(d)>1 or(l==x and d):d=m
l=x
print('no'if d else'yes')
``` | output | 1 | 49,882 | 7 | 99,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following pr... | instruction | 0 | 49,883 | 7 | 99,766 |
Tags: brute force, dp, graph matchings, greedy, sortings
Correct Solution:
```
t = int(input())
for tt in range(t):
input()
n,m = map(int,input().split())
a = []
for i in range(m):
r,c = map(int,input().split())
a.append([c,r])
a.sort()
c = 0
bc,br = -1,-1
start = a[0][0... | output | 1 | 49,883 | 7 | 99,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,884 | 7 | 99,768 |
Yes | output | 1 | 49,884 | 7 | 99,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,885 | 7 | 99,770 |
Yes | output | 1 | 49,885 | 7 | 99,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,886 | 7 | 99,772 |
Yes | output | 1 | 49,886 | 7 | 99,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,887 | 7 | 99,774 |
Yes | output | 1 | 49,887 | 7 | 99,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,888 | 7 | 99,776 |
No | output | 1 | 49,888 | 7 | 99,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,889 | 7 | 99,778 |
No | output | 1 | 49,889 | 7 | 99,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,890 | 7 | 99,780 |
No | output | 1 | 49,890 | 7 | 99,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the Ne... | instruction | 0 | 49,891 | 7 | 99,782 |
No | output | 1 | 49,891 | 7 | 99,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a board represented as a grid with 2 × n cells.
The first k_1 cells on the first row and first k_2 cells on the second row are colored in white. All other cells are colored in black.
You have w white dominoes (2 × 1 tiles, both ce... | instruction | 0 | 49,892 | 7 | 99,784 |
Tags: combinatorics, constructive algorithms, math
Correct Solution:
```
t = int(input())
for _ in range(t):
n,k1,k2 = list(map(int , input().split()))
w,b = list(map(int , input().split()))
odd_w = w & 1
odd_b = b & 1
if odd_w ^ odd_w:
print('NO')
else:
whites = k1 + k2
... | output | 1 | 49,892 | 7 | 99,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a board represented as a grid with 2 × n cells.
The first k_1 cells on the first row and first k_2 cells on the second row are colored in white. All other cells are colored in black.
You have w white dominoes (2 × 1 tiles, both ce... | instruction | 0 | 49,893 | 7 | 99,786 |
Tags: combinatorics, constructive algorithms, math
Correct Solution:
```
T = int( input() )
for t in range(T):
(n, k1, k2) = [ int(i) for i in input().split(' ') ]
(w,b) = [ int(i) for i in input().split(' ') ]
wTot = int( (k1+k2)/2 )
bTot = int( ((2*n) - k1-k2 )/2 )
#print(n, k1, k2, w, b,... | output | 1 | 49,893 | 7 | 99,787 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.