message stringlengths 2 22.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 145 109k | cluster float64 9 9 | __index_level_0__ int64 290 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,643 | 9 | 123,286 |
Yes | output | 1 | 61,643 | 9 | 123,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,644 | 9 | 123,288 |
Yes | output | 1 | 61,644 | 9 | 123,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,645 | 9 | 123,290 |
Yes | output | 1 | 61,645 | 9 | 123,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,646 | 9 | 123,292 |
Yes | output | 1 | 61,646 | 9 | 123,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,647 | 9 | 123,294 |
No | output | 1 | 61,647 | 9 | 123,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,648 | 9 | 123,296 |
No | output | 1 | 61,648 | 9 | 123,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,649 | 9 | 123,298 |
No | output | 1 | 61,649 | 9 | 123,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cooki... | instruction | 0 | 61,650 | 9 | 123,300 |
No | output | 1 | 61,650 | 9 | 123,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,339 | 9 | 124,678 |
Tags: greedy, implementation, math
Correct Solution:
```
import collections
def solve():
N,M = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
A = [a%2 for a in A]
B = [b%2 for b in B]
cntA = collections.Counter(A)
cntB = collections.Counter(B)... | output | 1 | 62,339 | 9 | 124,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,340 | 9 | 124,680 |
Tags: greedy, implementation, math
Correct Solution:
```
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
odd,oddn = 0,0
even,eve =0,0
for i in range(m):
if b[i]%2:odd = odd + 1
else:even = even + 1
for j in range(n):
if a[j]%2:oddn = oddn + 1
else:eve... | output | 1 | 62,340 | 9 | 124,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,341 | 9 | 124,682 |
Tags: greedy, implementation, math
Correct Solution:
```
n, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = b = c = d = 0
for i in range(n):
if A[i] % 2 == 0:
a += 1
else:
b += 1
for i in range(m):
if B[i] % 2 == 0:
c += 1
else:
d += 1
print (mi... | output | 1 | 62,341 | 9 | 124,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,343 | 9 | 124,686 |
Tags: greedy, implementation, math
Correct Solution:
```
n, m = list(map(lambda x: int(x), input().split()))
Ai = list(map(lambda x: int(x), input().split()))
Bi = list(map(lambda x: int(x), input().split()))
Astats = [0, 0] #[odd, even]
Bstats = [0, 0]
for i in Ai:
if i%2 == 0: Astats[1] += 1
else: Astats[0] += 1... | output | 1 | 62,343 | 9 | 124,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,344 | 9 | 124,688 |
Tags: greedy, implementation, math
Correct Solution:
```
n = input()
lc = [int(i) for i in input().split()]
lk = [int(i) for i in input().split()]
co = 0
ce = 0
for i in lc:
if(i%2 == 0):
ce +=1
else:
co+=1
ko = 0
ke = 0
for i in lk:
if(i%2 == 0):
ke+=1
else:
ko+=1
pri... | output | 1 | 62,344 | 9 | 124,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,345 | 9 | 124,690 |
Tags: greedy, implementation, math
Correct Solution:
```
n,m=list(map(int,input().strip().split()))
a=list(map(int,input().strip().split()))
b=list(map(int,input().strip().split()))
c=0
d=0
e=0
f=0
for i in range(n):
if a[i]%2==0:
c=c+1
else:
d=d+1
for j in range(m):
if b[j]%2==0:
e... | output | 1 | 62,345 | 9 | 124,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer a_i written on it and the j-th key has an integer b_j on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to ope... | instruction | 0 | 62,346 | 9 | 124,692 |
Tags: greedy, implementation, math
Correct Solution:
```
n,m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
n = len(A)
m = len(B)
AA = [0,0];
BB = [0,0];
for i in A:
AA[i%2] +=1
for i in B:
BB[i%2] +=1
print( min(AA[0], BB[1]) + min(AA[1], BB[0]))
``` | output | 1 | 62,346 | 9 | 124,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may g... | instruction | 0 | 62,371 | 9 | 124,742 |
No | output | 1 | 62,371 | 9 | 124,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may g... | instruction | 0 | 62,372 | 9 | 124,744 |
No | output | 1 | 62,372 | 9 | 124,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may g... | instruction | 0 | 62,373 | 9 | 124,746 |
No | output | 1 | 62,373 | 9 | 124,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may g... | instruction | 0 | 62,374 | 9 | 124,748 |
No | output | 1 | 62,374 | 9 | 124,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,375 | 9 | 124,750 |
Tags: brute force, implementation
Correct Solution:
```
from itertools import combinations
l = [*map(int, input().split())]
print("Yes" if any(2 * sum(c) == sum(l) for x in [1, 2] for c in combinations(l, x)) else "No")
``` | output | 1 | 62,375 | 9 | 124,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,376 | 9 | 124,752 |
Tags: brute force, implementation
Correct Solution:
```
a = list(map(int, input().split()))
a.sort()
if a[0] + a[3] == a[1] + a[2]:
print("YES")
else:
if a[3] == a[0] + a[1] + a[2]:
print("YES")
else:
print("NO")
``` | output | 1 | 62,376 | 9 | 124,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,377 | 9 | 124,754 |
Tags: brute force, implementation
Correct Solution:
```
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import *
l = I()
s = sum(l)
ans = 'NO'
l.sort()
if 2*l[-1] == s:
ans = 'YES'
for i in range(4):
for j in range(4):
if i == j: continue
if 2*(l[i] + l[j]) == s:
ans = 'YES'
print(ans)
``` | output | 1 | 62,377 | 9 | 124,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,378 | 9 | 124,756 |
Tags: brute force, implementation
Correct Solution:
```
a = list(map(int, input().split()))
for i in range(2 ** 4):
s1 = 0
s2 = 0
for j in range(4):
if ((i >> j) & 1):
s1 += a[j]
else:
s2 += a[j]
if s1 == s2:
print("YES")
break
elif i == 2 ** ... | output | 1 | 62,378 | 9 | 124,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,379 | 9 | 124,758 |
Tags: brute force, implementation
Correct Solution:
```
a,b,c,d = map(int,input().split())
if a+c == b+d:
print('YES')
elif a+d == b+c:
print('YES')
elif a+b == c+d:
print('YES')
elif a+b+c == d:
print('YES')
elif a+c+d == b:
print('YES')
elif b+c+d == a:
print('YES')
elif a+b+d == c:
print... | output | 1 | 62,379 | 9 | 124,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,380 | 9 | 124,760 |
Tags: brute force, implementation
Correct Solution:
```
a = list(map(int,input('').split(' ')))
t = sum(a)
b = ['0001','0010','0011','0100','0101','0110','0111']
res = False
for s in b:
su = 0
for i in range(4):
if(s[i] == '1'):
su = su+a[i]
if(su == t/2):
res = True
brea... | output | 1 | 62,380 | 9 | 124,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,381 | 9 | 124,762 |
Tags: brute force, implementation
Correct Solution:
```
a,b,c,d=map(int,input().split())
l=[a,b,c,d]
l.sort()
if(l[3]+l[0]==l[2]+l[1]):
print("YES")
elif(l[3]==l[0]+l[2]+l[1]):
print("YES")
else:
print("NO")
``` | output | 1 | 62,381 | 9 | 124,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same a... | instruction | 0 | 62,382 | 9 | 124,764 |
Tags: brute force, implementation
Correct Solution:
```
array=list(map(int,input().split( )))
array.sort()
if array[-1]==sum(array[:3]) or array[0]+array[-1]==array[1]+array[2]:
print("YES")
else:
print("NO")
``` | output | 1 | 62,382 | 9 | 124,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,383 | 9 | 124,766 |
Yes | output | 1 | 62,383 | 9 | 124,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,384 | 9 | 124,768 |
Yes | output | 1 | 62,384 | 9 | 124,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,385 | 9 | 124,770 |
Yes | output | 1 | 62,385 | 9 | 124,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,386 | 9 | 124,772 |
Yes | output | 1 | 62,386 | 9 | 124,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,387 | 9 | 124,774 |
No | output | 1 | 62,387 | 9 | 124,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,388 | 9 | 124,776 |
No | output | 1 | 62,388 | 9 | 124,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,389 | 9 | 124,778 |
No | output | 1 | 62,389 | 9 | 124,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in ... | instruction | 0 | 62,390 | 9 | 124,780 |
No | output | 1 | 62,390 | 9 | 124,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,547 | 9 | 125,094 |
Tags: *special, implementation
Correct Solution:
```
a = list(map(int, input().split()))
cnt = 0
for i in range(len(a)):
cnt += i * a[i]
print(cnt)
``` | output | 1 | 62,547 | 9 | 125,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,548 | 9 | 125,096 |
Tags: *special, implementation
Correct Solution:
```
l1=list(map(int,input().split()))
s=0
for i in range(len(l1)):
s+=(l1[i]*i)
print(s)
``` | output | 1 | 62,548 | 9 | 125,097 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,549 | 9 | 125,098 |
Tags: *special, implementation
Correct Solution:
```
v, cnt = [int(i) for i in input().split()], 0
for i in range(1, len(v)):
cnt += i * v[i]
print(cnt)
``` | output | 1 | 62,549 | 9 | 125,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,550 | 9 | 125,100 |
Tags: *special, implementation
Correct Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import math
import os
import sys
from fractions import *
from sys import *
from io import BytesIO, IOBase
from itertools import *
from collections import *
# sys.setrecursionlimit(10**5)
if sys.... | output | 1 | 62,550 | 9 | 125,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,551 | 9 | 125,102 |
Tags: *special, implementation
Correct Solution:
```
# PRE-PROGRAM
inp = []
def read():
global inp
if not inp:
inp = list(map(int, input().split()))[::-1]
return inp.pop()
# INGREDIENTS
carrots = 2
calories = 0
chocolate_spread = 100 #g
pack_of_flour = 1
egg = 1
mixing_bowl = []
baking_dish = []
... | output | 1 | 62,551 | 9 | 125,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,552 | 9 | 125,104 |
Tags: *special, implementation
Correct Solution:
```
inp = []
inp = input().split()
inp = [int(i) for i in inp]
carrots = 2
calories = 0
choco = 100
flour = 1
egg = 1
bowl = []
dish = []
bowl.append(calories) # 1
carrots = inp[0] # 2
for i in range(1, carrots... | output | 1 | 62,552 | 9 | 125,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,553 | 9 | 125,106 |
Tags: *special, implementation
Correct Solution:
```
a = map(int, input().split())
j = 0
sum = 0
for i in a:
sum += i * j
j += 1
print(sum)
``` | output | 1 | 62,553 | 9 | 125,107 |
Provide tags and a correct Python 3 solution for this coding contest problem.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
2. Take carrots from refrigerator.
3. Chop ca... | instruction | 0 | 62,554 | 9 | 125,108 |
Tags: *special, implementation
Correct Solution:
```
cases=list(map(int,input().split()))
cnt=0
for i in range(1,len(cases)):
cnt+=i*cases[i]
print(cnt)
``` | output | 1 | 62,554 | 9 | 125,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,555 | 9 | 125,110 |
Yes | output | 1 | 62,555 | 9 | 125,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,556 | 9 | 125,112 |
Yes | output | 1 | 62,556 | 9 | 125,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,557 | 9 | 125,114 |
Yes | output | 1 | 62,557 | 9 | 125,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,558 | 9 | 125,116 |
Yes | output | 1 | 62,558 | 9 | 125,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,559 | 9 | 125,118 |
No | output | 1 | 62,559 | 9 | 125,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,560 | 9 | 125,120 |
No | output | 1 | 62,560 | 9 | 125,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How to make a cake you'll never eat.
Ingredients.
* 2 carrots
* 0 calories
* 100 g chocolate spread
* 1 pack of flour
* 1 egg
Method.
1. Put calories into the mixing bowl.
... | instruction | 0 | 62,561 | 9 | 125,122 |
No | output | 1 | 62,561 | 9 | 125,123 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.