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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Twilight Sparkle once got a crystal from the Crystal Mine. A crystal of size n (n is odd; n > 1) is an n × n matrix with a diamond inscribed into it.
You are given an odd integer n. You need to... | instruction | 0 | 13,670 | 7 | 27,340 |
No | output | 1 | 13,670 | 7 | 27,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,706 | 7 | 27,412 |
Tags: brute force, math
Correct Solution:
```
__author__ = 'MoonBall'
import sys
# sys.stdin = open('data/D.in', 'r')
T = 1
def process():
ans = []
N = int(input())
for i in range(1, 3000000):
a = N + i * (i - 1) * (i + 1) // 6
j, mod = divmod(a, i * (i + 1) // 2)
if i > j: break
... | output | 1 | 13,706 | 7 | 27,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,707 | 7 | 27,414 |
Tags: brute force, math
Correct Solution:
```
n,i,t,r=int(input()),0,0,[]
while n>=0:
i+=1
n-=i*i
t+=i
m=n//t+i
r+=[(m,i),(i,m)][m==i:]*(n%t==0<=n)
for p in[(len(r),'')]+sorted(r):print("%d %s"%p)
``` | output | 1 | 13,707 | 7 | 27,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,708 | 7 | 27,416 |
Tags: brute force, math
Correct Solution:
```
from collections import Counter
def mp(): return map(int,input().split())
def lt(): return list(map(int,input().split()))
def pt(x): print(x)
def ip(): return input()
def it(): return int(input())
def sl(x): return [t for t in x]
def spl(x): return x.split()
def aj(li... | output | 1 | 13,708 | 7 | 27,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,709 | 7 | 27,418 |
Tags: brute force, math
Correct Solution:
```
__author__ = 'MoonBall'
import sys
# sys.stdin = open('data/D.in', 'r')
T = 1
def process():
ans = []
N = int(input())
for i in range(1, N + 1):
a = N + i * (i - 1) * (i + 1) // 6
j, mod = divmod(a, i * (i + 1) // 2)
if i > j: break
... | output | 1 | 13,709 | 7 | 27,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,710 | 7 | 27,420 |
Tags: brute force, math
Correct Solution:
```
s = int(input())
"""
nm + (n-1)(m-1) + ...
nm + nm -(n+m) + 1
6x
= 6mn*n - 3*(n-1)n(n+m) + (n-1)*n*(2n-1)
6x - n*(n+1)*(2n+1)+3*(n-1)n*n = (6n*n - 3*(n-1)*n)*m
"""
a, b = [], []
for n in range(1,1450000):
u = 6*s - n*(n-1)*(n+n-1)+3*(n-1)*n*n
v = 6*n*n - 3*(n-1)*n
... | output | 1 | 13,710 | 7 | 27,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,711 | 7 | 27,422 |
Tags: brute force, math
Correct Solution:
```
x = int(input()) * 6
n, equ, ans = 0, False, []
while True:
n += 1
if n * (n + 1) * (2 * n - 1) > x:
break
if x % n != 0:
continue
if x % (n + 1) != 0:
continue
m = x // n // (n + 1) + n - 1
if m % 3 != 0:
continue
m = m // 3
if n <= m:
ans.append((n, m))
... | output | 1 | 13,711 | 7 | 27,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example,... | instruction | 0 | 13,712 | 7 | 27,424 |
Tags: brute force, math
Correct Solution:
```
def main():
x = int(input())
l = squares(x)
last = l[len(l) - 1]
if last[0] != last[1]:
print(2 * len(l))
else:
print(2 * len(l) - 1)
for pair in l:
print(pair[0], pair[1])
if last[0] != last[1]:
for pair in l[::-1]:
print(pair[1], pair[0])
else:
revL =... | output | 1 | 13,712 | 7 | 27,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,713 | 7 | 27,426 |
Yes | output | 1 | 13,713 | 7 | 27,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,714 | 7 | 27,428 |
Yes | output | 1 | 13,714 | 7 | 27,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,715 | 7 | 27,430 |
Yes | output | 1 | 13,715 | 7 | 27,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,716 | 7 | 27,432 |
Yes | output | 1 | 13,716 | 7 | 27,433 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,717 | 7 | 27,434 |
No | output | 1 | 13,717 | 7 | 27,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,718 | 7 | 27,436 |
No | output | 1 | 13,718 | 7 | 27,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,719 | 7 | 27,438 |
No | output | 1 | 13,719 | 7 | 27,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,720 | 7 | 27,440 |
No | output | 1 | 13,720 | 7 | 27,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table c... | instruction | 0 | 13,721 | 7 | 27,442 |
No | output | 1 | 13,721 | 7 | 27,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,800 | 7 | 27,600 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
from collections import deque
n = int(input())
g = []
visited = []
color = []
max_child_color = []
parent = []
def initialize():
for i in range(n+10):
g.append([])
visited.append(False)
color.append(0)
max_child_col... | output | 1 | 13,800 | 7 | 27,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,801 | 7 | 27,602 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
import sys
sys.setrecursionlimit(200000)
n = int(input())
arr = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
arr[a - 1].append(b - 1)
arr[b - 1].append(a - 1)
s = max([len(p) for p in arr]) + 1
print(s)
co... | output | 1 | 13,801 | 7 | 27,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,802 | 7 | 27,604 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
import collections
def doit():
N = int(input())
graph = dict()
for n in range(N) :
graph[n] = list()
for n in range(N - 1):
a, b = map(int, input().split())
graph[a-1].append(b-1)
graph[b-1].append(a-1)
... | output | 1 | 13,802 | 7 | 27,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,803 | 7 | 27,606 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
###### ### ####### ####### ## # ##### ### #####
# # # # # # # # # # # # # ###
# # # # # # # # # # # # # #... | output | 1 | 13,803 | 7 | 27,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,804 | 7 | 27,608 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
from collections import deque
n = int(input())
dic = {}
for i in range(n):
dic[i]=[]
for i in range(n-1):
a,b = map(int,input().split())
dic[a-1].append(b-1)
dic[b-1].append(a-1)
color = {}
prevcolor = {}
color[0] = 1
prevcolor[0] = 1
lis = deque()
... | output | 1 | 13,804 | 7 | 27,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,805 | 7 | 27,610 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
from sys import stdin
from collections import deque
def main():
n = int(input()) + 1
g = [[] for _ in range(n)]
for s in stdin.read().splitlines():
u, v = map(int, s.split())
g[u].append(v)
g[v].append(u)
cc, pa... | output | 1 | 13,805 | 7 | 27,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,806 | 7 | 27,612 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
from collections import deque
n = int(input())
ans = [0]*n
g = [[]for _ in range(n)]
for _ in range(n - 1):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
g[v].append(u)
col = 1
q = deque()
vis = [False]*n
q.append((0, 0))... | output | 1 | 13,806 | 7 | 27,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is ... | instruction | 0 | 13,807 | 7 | 27,614 |
Tags: dfs and similar, graphs, greedy, trees
Correct Solution:
```
from collections import defaultdict,deque
class Graph:
def __init__(self,n):
self.graph = defaultdict(list)
self.parentColor = [-1] * (n+1)
self.color = [-1] * (n+1)
self.visited = [False] * (n+1)
self.n = n
... | output | 1 | 13,807 | 7 | 27,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,808 | 7 | 27,616 |
Yes | output | 1 | 13,808 | 7 | 27,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,809 | 7 | 27,618 |
Yes | output | 1 | 13,809 | 7 | 27,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,810 | 7 | 27,620 |
Yes | output | 1 | 13,810 | 7 | 27,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,811 | 7 | 27,622 |
Yes | output | 1 | 13,811 | 7 | 27,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,812 | 7 | 27,624 |
No | output | 1 | 13,812 | 7 | 27,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,813 | 7 | 27,626 |
No | output | 1 | 13,813 | 7 | 27,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,814 | 7 | 27,628 |
No | output | 1 | 13,814 | 7 | 27,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.
The park consists of n squares connected with (n - 1) bidire... | instruction | 0 | 13,815 | 7 | 27,630 |
No | output | 1 | 13,815 | 7 | 27,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,170 | 7 | 28,340 |
Tags: brute force, implementation, math
Correct Solution:
```
import sys
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
y,b,r = get_ints()
for i in range(r,0,-1):
if... | output | 1 | 14,170 | 7 | 28,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,171 | 7 | 28,342 |
Tags: brute force, implementation, math
Correct Solution:
```
a = input()
a = a.split()
x= int(a[0])
y=int(a[1])
z=int(a[2])
m=x
n=y-1
o=z-2
print (min(m, n, o)*3+3)
``` | output | 1 | 14,171 | 7 | 28,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,172 | 7 | 28,344 |
Tags: brute force, implementation, math
Correct Solution:
```
import sys
y,b,r = map(int, input().split())
ans = 0
for i in range(1,y+1):
if b > i and r > i + 1:
ans = max(ans, 3 * i + 3)
print(ans)
``` | output | 1 | 14,172 | 7 | 28,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,173 | 7 | 28,346 |
Tags: brute force, implementation, math
Correct Solution:
```
import math
y, b, r = [int(s) for s in input().split(" ")]
ans = 0
for i in range(1, y+1):
if i+1 > b:
break
if i+2 > r:
break
ans = 3*i + 3
print(ans)
``` | output | 1 | 14,173 | 7 | 28,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,174 | 7 | 28,348 |
Tags: brute force, implementation, math
Correct Solution:
```
a,b,c=map(int,input().split())
if b>=c-1:
if a>=c-2:
print((c*3)-3)
else:
print(a*3+3)
else:
if a>=b-1:
print(b*3)
else:
print(a*3+3)
``` | output | 1 | 14,174 | 7 | 28,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,175 | 7 | 28,350 |
Tags: brute force, implementation, math
Correct Solution:
```
max_y, max_b, max_r= map(int, input().split(" "))
y = min(max_y, max_b-1, max_r-2)
b = y + 1
r = y + 2
print(y+b+r)
``` | output | 1 | 14,175 | 7 | 28,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,176 | 7 | 28,352 |
Tags: brute force, implementation, math
Correct Solution:
```
aa = [int(x) for x in input().split()]
y = aa[0]
b = aa[1]
r = aa[2]
max = 0
if y + 1 <= b and y + 2 <= r:
max = y + y + 1 + y + 2
elif b - 1 <= y and b + 1 <= r:
max = b - 1 + b + b + 1
else:
max = r + r - 1 + r - 2
print(max)
``` | output | 1 | 14,176 | 7 | 28,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and r red ornaments.
In Bob's opinion, a Christmas... | instruction | 0 | 14,177 | 7 | 28,354 |
Tags: brute force, implementation, math
Correct Solution:
```
y, b, r = map(int, input().split())
ans = 6
for i in range(1, 100):
if y > i and b > i + 1 and r > i + 2:
ans += 3
else:
break
print(ans)
``` | output | 1 | 14,177 | 7 | 28,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,178 | 7 | 28,356 |
Yes | output | 1 | 14,178 | 7 | 28,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,179 | 7 | 28,358 |
Yes | output | 1 | 14,179 | 7 | 28,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,180 | 7 | 28,360 |
Yes | output | 1 | 14,180 | 7 | 28,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,181 | 7 | 28,362 |
Yes | output | 1 | 14,181 | 7 | 28,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,182 | 7 | 28,364 |
No | output | 1 | 14,182 | 7 | 28,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,183 | 7 | 28,366 |
No | output | 1 | 14,183 | 7 | 28,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,184 | 7 | 28,368 |
No | output | 1 | 14,184 | 7 | 28,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are decorating a Christmas Tree.
Alice wants only 3 types of ornaments to be used on the Christmas Tree: yellow, blue and red. They have y yellow ornaments, b blue ornaments and ... | instruction | 0 | 14,185 | 7 | 28,370 |
No | output | 1 | 14,185 | 7 | 28,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a square grid of size n × n. Some cells are colored in black, all others are colored in white. In one operation you can select some rectangle and color all its cells in white. It costs min(h, w) to color a rectangle of size h × w. Y... | instruction | 0 | 14,227 | 7 | 28,454 |
Tags: flows, graph matchings, graphs
Correct Solution:
```
import sys
from collections import defaultdict
class MaxFlow(object):
def __init__(self):
self.edges = defaultdict(lambda: defaultdict(lambda: 0))
def add_edge(self, u, v, capacity=float('inf')):
self.edges[u][v] = capacity
def bf... | output | 1 | 14,227 | 7 | 28,455 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.