message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 450 109k | cluster float64 2 2 | __index_level_0__ int64 900 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anvils come in different sizes and shapes. Quite o... | instruction | 0 | 104,977 | 2 | 209,954 |
Tags: math, probabilities
Correct Solution:
```
def li():
return list(map(int, input().split(" ")))
for _ in range(int(input())):
a, b=li()
if b != 0 and a != 0:
s = (max(0, a-4*b) + a)/2
s*=min((a/4), b)
ans = 1/2 + s/(2*a*b)
print("{:.8f}".format(ans))
elif b == 0:
print(1)
else:
pri... | output | 1 | 104,977 | 2 | 209,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anvils come in different sizes and shapes. Quite o... | instruction | 0 | 104,978 | 2 | 209,956 |
Tags: math, probabilities
Correct Solution:
```
for i in range(int(input())):
a, b = map(int, input().split(' '))
if b == 0:
print(1)
elif a == 0:
print(1/2)
else:
if 4*b<=a:
print(1-2*b*b/(2*a*b))
else:
print(1-((b+b-a/4)*a/2)/(2*a*b))
``` | output | 1 | 104,978 | 2 | 209,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,979 | 2 | 209,958 |
Yes | output | 1 | 104,979 | 2 | 209,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,980 | 2 | 209,960 |
Yes | output | 1 | 104,980 | 2 | 209,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,981 | 2 | 209,962 |
Yes | output | 1 | 104,981 | 2 | 209,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,982 | 2 | 209,964 |
Yes | output | 1 | 104,982 | 2 | 209,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,983 | 2 | 209,966 |
No | output | 1 | 104,983 | 2 | 209,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,984 | 2 | 209,968 |
No | output | 1 | 104,984 | 2 | 209,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,985 | 2 | 209,970 |
No | output | 1 | 104,985 | 2 | 209,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anv... | instruction | 0 | 104,986 | 2 | 209,972 |
No | output | 1 | 104,986 | 2 | 209,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Harry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was present earlier at 12 Grimmauld Place, the home of Sirius Black's mother. It was stolen from ther... | instruction | 0 | 105,003 | 2 | 210,006 |
No | output | 1 | 105,003 | 2 | 210,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remaining side is occupied by a long wall that is sp... | instruction | 0 | 105,019 | 2 | 210,038 |
Tags: binary search, data structures, greedy, two pointers
Correct Solution:
```
import sys
BORDER = 1 << 30
def build(x=0):
high = low = 0
i = 0
while x and i < 30:
if x & 1:
low += (1 << i)
x >>= 1
i += 1
i = 0
while x:
if x & 1:
high +=... | output | 1 | 105,019 | 2 | 210,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remaining side is occupied by a long wall that is sp... | instruction | 0 | 105,020 | 2 | 210,040 |
Tags: binary search, data structures, greedy, two pointers
Correct Solution:
```
import sys
border = 1 << 30
def build(x=0):
res = [0, 0]
i = 0
while x and i < 30:
if x & 1:
res[1] += (1 << i)
x >>= 1
i += 1
i = 0
while x:
if x & 1:
res[0]... | output | 1 | 105,020 | 2 | 210,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remai... | instruction | 0 | 105,021 | 2 | 210,042 |
No | output | 1 | 105,021 | 2 | 210,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remai... | instruction | 0 | 105,022 | 2 | 210,044 |
No | output | 1 | 105,022 | 2 | 210,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remai... | instruction | 0 | 105,023 | 2 | 210,046 |
No | output | 1 | 105,023 | 2 | 210,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remai... | instruction | 0 | 105,024 | 2 | 210,048 |
No | output | 1 | 105,024 | 2 | 210,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,428 | 2 | 212,856 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n, d, l = map(int, input().split())
x, y = (n + 1) // 2 - l * (n // 2), l * ((n + 1) // 2) - n // 2
if x > d or y < d: print(-1)
elif l == 1: print('1 ' * n)
else:
a, b = str(l) + ' ', '1 '
u, v = (d - x) // (l - 1), (d - x) % (l - 1)
p = (a + b) *... | output | 1 | 106,428 | 2 | 212,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,429 | 2 | 212,858 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n,d,l=list(map(int,input().split()))
a=[0]*n
for i in range(n):
if i==n-1:
a[i]=d
else:
if d>=l:
a[i]=l
d=l-d
elif d<1:
a[i]=1
d=-d+1
else:
a[i]=d+1
... | output | 1 | 106,429 | 2 | 212,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,430 | 2 | 212,860 |
Tags: constructive algorithms, greedy
Correct Solution:
```
nn=input()
a=[int(i) for i in nn.split()]
d=a[1]
l=a[2]
n=a[0]
oddn=int(n/2)+n%2
evenn=int(n/2)
a=[]
if d>(oddn*l-evenn) or d<(oddn-evenn*l):
print(-1)
else:
if n%2:
d-=1
for i in range(n):
a.append(int(1))
for i in range(n):
... | output | 1 | 106,430 | 2 | 212,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,431 | 2 | 212,862 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n,d,l=map(int,input().split())
ans=[]
for i in range(n-1):
if d<1:
ans.append(1)
d=1-d
else:
ans.append(l)
d=l-d
if 1<=d<=l:
print(*(ans+[d]))
else:
print(-1)
``` | output | 1 | 106,431 | 2 | 212,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,432 | 2 | 212,864 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n,d,l=map(int,input().split())
if d < (n-n//2) -(n//2)*l or d > (n-n//2)*l -(n//2):
print(-1)
else:
arr=[1]*n
sum1=l*(n-n//2)
sum2=n//2
for i in range(0,n,2):
arr[i]=l
i=0
j=1
while 1 :
if i<n:
if arr... | output | 1 | 106,432 | 2 | 212,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,433 | 2 | 212,866 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n, d, l = map(int, input().split())
m1 = (n // 2) * (1 - l)
m2 = (n // 2) * (l - 1)
if n % 2 != 0:
m1 += 1
m2 += l
if not (m1 <= d <= m2):
print(-1)
exit()
x = d - m1
res = [1 if i % 2 == 0 else l for i in range(n)]
i = 0
while x > 0:
if i ... | output | 1 | 106,433 | 2 | 212,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,434 | 2 | 212,868 |
Tags: constructive algorithms, greedy
Correct Solution:
```
r=[]
n,d,l=map(int,input().split())
for i in range(1,n):
k=1 if d<=0 else l
r.append(k)
d=k-d
if 1<=d<=l:print(*r+[d])
else:print(-1)
``` | output | 1 | 106,434 | 2 | 212,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. ... | instruction | 0 | 106,435 | 2 | 212,870 |
Tags: constructive algorithms, greedy
Correct Solution:
```
from sys import stdin,stdout
nmbr=lambda:int(stdin.readline())
lst = lambda: list(map(int, input().split()))
for _ in range(1):#nmbr():
n,d,mx=lst()
ans=[1]*n
sm=0
for i in range(n):
if i&1:sm-=ans[i]
else:sm+=ans[i]
p=0
... | output | 1 | 106,435 | 2 | 212,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,436 | 2 | 212,872 |
Yes | output | 1 | 106,436 | 2 | 212,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,437 | 2 | 212,874 |
Yes | output | 1 | 106,437 | 2 | 212,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,438 | 2 | 212,876 |
Yes | output | 1 | 106,438 | 2 | 212,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,439 | 2 | 212,878 |
Yes | output | 1 | 106,439 | 2 | 212,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,440 | 2 | 212,880 |
No | output | 1 | 106,440 | 2 | 212,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,441 | 2 | 212,882 |
No | output | 1 | 106,441 | 2 | 212,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,442 | 2 | 212,884 |
No | output | 1 | 106,442 | 2 | 212,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better ma... | instruction | 0 | 106,443 | 2 | 212,886 |
No | output | 1 | 106,443 | 2 | 212,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,737 | 2 | 213,474 |
Tags: brute force, games
Correct Solution:
```
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
res=[[max(a1*b1 for b1 in b)]for a1 in a]
res.sort()
print(res[-2][0])
``` | output | 1 | 106,737 | 2 | 213,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,738 | 2 | 213,476 |
Tags: brute force, games
Correct Solution:
```
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
print(min([max([max([a[j]*k for k in b]) for j in range(n) if j!=i]) for i in range(n)]))
``` | output | 1 | 106,738 | 2 | 213,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,739 | 2 | 213,478 |
Tags: brute force, games
Correct Solution:
```
m=[int(i) for i in input().split()]
a= [int(i) for i in input().split()]
b= [int(i) for i in input().split()]
r =[[max(ax*bx for bx in b)] for ax in a]
r.sort()
print (int(r[-2][0]))
``` | output | 1 | 106,739 | 2 | 213,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,740 | 2 | 213,480 |
Tags: brute force, games
Correct Solution:
```
def main():
n, m = [int(x) for x in input().split()]
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
vv = max(a[0] * b[0], a[-1]* b[0], a[0]*b[-1],a[-1]*b[-1])
if vv == a[0] * b[0] or vv == a[0]*b[-1]:
... | output | 1 | 106,740 | 2 | 213,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,741 | 2 | 213,482 |
Tags: brute force, games
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
N, M = map(int, input().split())
A = list(map(int, input().... | output | 1 | 106,741 | 2 | 213,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,742 | 2 | 213,484 |
Tags: brute force, games
Correct Solution:
```
def main():
n, m = list(map(int, input().split()))
t = list(map(int, input().split()))
b = list(map(int, input().split()))
maxs = []
for ex in range(len(t)):
maxs.append(max(x * y for i, x in enumerate(t) for y in b if i != ex))
print(min(ma... | output | 1 | 106,742 | 2 | 213,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,743 | 2 | 213,486 |
Tags: brute force, games
Correct Solution:
```
n,m = map(int,input().split())
l1 = [int(x) for x in input().split()]
l2 = [int(x) for x in input().split()]
r = [[max(a*b for b in l2)] for a in l1]
r.sort()
print(r[-2][0])
``` | output | 1 | 106,743 | 2 | 213,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of whi... | instruction | 0 | 106,744 | 2 | 213,488 |
Tags: brute force, games
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
def main():
n,m=m... | output | 1 | 106,744 | 2 | 213,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,745 | 2 | 213,490 |
Yes | output | 1 | 106,745 | 2 | 213,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,746 | 2 | 213,492 |
Yes | output | 1 | 106,746 | 2 | 213,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,747 | 2 | 213,494 |
Yes | output | 1 | 106,747 | 2 | 213,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,748 | 2 | 213,496 |
Yes | output | 1 | 106,748 | 2 | 213,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,749 | 2 | 213,498 |
No | output | 1 | 106,749 | 2 | 213,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,750 | 2 | 213,500 |
No | output | 1 | 106,750 | 2 | 213,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,751 | 2 | 213,502 |
No | output | 1 | 106,751 | 2 | 213,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with re... | instruction | 0 | 106,752 | 2 | 213,504 |
No | output | 1 | 106,752 | 2 | 213,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony.
<image>
A sequence of positive integers bi is harmony if and only if for every two ... | instruction | 0 | 107,336 | 2 | 214,672 |
No | output | 1 | 107,336 | 2 | 214,673 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.