message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,266 | 3 | 28,532 |
Tags: implementation, math
Correct Solution:
```
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.wr... | output | 1 | 14,266 | 3 | 28,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,267 | 3 | 28,534 |
Tags: implementation, math
Correct Solution:
```
def ifp(s):
flag = 1
for i in mat:
if s in i:
flag = 0
break
if flag:
return False
return True
def check3():
if "A" in mat[0] or "A" in mat[-1]:
return True
flag1 = 0
flag2 = 0
for i in range(r):
if mat[i][0]=="A":
flag1 = 1
if mat[i][-1]=="A"... | output | 1 | 14,267 | 3 | 28,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,268 | 3 | 28,536 |
Tags: implementation, math
Correct Solution:
```
from sys import stdin
def check(lst, c):
ans = True
for i in range(len(lst)):
if lst[i][c] == 'P':
ans = False
break
return ans
def check1(lst, c):
ans = False
for i in range(len(lst)):
if lst[i][c] == 'A':
... | output | 1 | 14,268 | 3 | 28,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,269 | 3 | 28,538 |
Tags: implementation, math
Correct Solution:
```
from sys import stdin
for case in range(int(stdin.readline())):
r,c = [int(x) for x in stdin.readline().split()]
grid = []
for x in range(r):
grid.append(stdin.readline().strip())
mortal = True
for x in grid:
if 'A' in x:
... | output | 1 | 14,269 | 3 | 28,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,270 | 3 | 28,540 |
Tags: implementation, math
Correct Solution:
```
import sys
def solve(g, r, c):
total = sum(sum(row) for row in g)
if total == r*c:
return 0
if total == 0:
return "MORTAL"
if all(g[0]) or all(g[-1]):
return 1
if all(g[i][0] for i in range(r)) or all(g[i][-1] fo... | output | 1 | 14,270 | 3 | 28,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,271 | 3 | 28,542 |
Tags: implementation, math
Correct Solution:
```
from sys import stdin, stdout
if __name__ == '__main__':
t = int(stdin.readline())
for k in range(t):
rc = list(map(int, stdin.readline().split()))
r = rc[0]
c = rc[1]
b = False
allA = True
corner = False
... | output | 1 | 14,271 | 3 | 28,543 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 14,272 | 3 | 28,544 |
Tags: implementation, math
Correct Solution:
```
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
a=aaa=aa=0
r,c = map(int, stdin.readline().split())
x=[0 for _ in range(c)]
y=[0 for _ in range(r)]
for j in range(r):
b =stdin.readline()
if (j=... | output | 1 | 14,272 | 3 | 28,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,273 | 3 | 28,546 |
Yes | output | 1 | 14,273 | 3 | 28,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,274 | 3 | 28,548 |
Yes | output | 1 | 14,274 | 3 | 28,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,275 | 3 | 28,550 |
Yes | output | 1 | 14,275 | 3 | 28,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,276 | 3 | 28,552 |
Yes | output | 1 | 14,276 | 3 | 28,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,277 | 3 | 28,554 |
No | output | 1 | 14,277 | 3 | 28,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,278 | 3 | 28,556 |
No | output | 1 | 14,278 | 3 | 28,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,279 | 3 | 28,558 |
No | output | 1 | 14,279 | 3 | 28,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r Γ c grid. Each cell on the grid represents a country. ... | instruction | 0 | 14,280 | 3 | 28,560 |
No | output | 1 | 14,280 | 3 | 28,561 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,417 | 3 | 28,834 |
Tags: binary search
Correct Solution:
```
I=lambda:map(int,input().split())
n,c=I()
a,b=[],[]
for _ in range(n):x,y=I();a.append(x);b.append(y)
f=lambda x:sum(1+a[i]*x//b[i]for i in range(n))
l=-1
r=10**9
while l<r-1:
m=(l+r)//2
if f(m)<c:l=m
else:r=m
L=r
l=-1
r=10**9
while l<r-1:
m=(l+r)//2
if f(m)<=c:l=m
else:r... | output | 1 | 14,417 | 3 | 28,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,418 | 3 | 28,836 |
Tags: binary search
Correct Solution:
```
def f(x, t):
y = x
while sum((y * a) // b for a, b in t) < c: y += 1000000
while y - x > 1:
z = (x + y) // 2
d = sum((z * a) // b for a, b in t)
if d < c: x = z
else: y = z
return y
n, c = map(int, input().split())
c -= n
t =... | output | 1 | 14,418 | 3 | 28,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,419 | 3 | 28,838 |
Tags: binary search
Correct Solution:
```
I=lambda:map(int,input().split())
n,c=I()
a,b=[],[]
for _ in range(n):x,y=I();a.append(x);b.append(y)
if max(a)==0:print([0,-1][n==c]);exit()
def f(x):
r=0
for i in range(n):
r+=1+a[i]*x//b[i]
if r>c:break
return r
l=-1
r=10**18
while l<r-1:
m=(l+r)//2
if f(m)<c:l=m
e... | output | 1 | 14,419 | 3 | 28,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,420 | 3 | 28,840 |
Tags: binary search
Correct Solution:
```
a=[]
b=[]
n=0
def cal(x):
p=0
global n,a,b
for i in range(n):
p+=((a[i]*x)//b[i])
return p
n,c=map(int,input().split())
c-=n
if c < 0:
print(0)
exit(0)
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
L=1
R=10**18
lower=R+1
while L<=R :
m=(L+R)>>... | output | 1 | 14,420 | 3 | 28,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,421 | 3 | 28,842 |
Tags: binary search
Correct Solution:
```
n,c = map(int,input().split())
from sys import stdin
lst,q = [],0
for i in range(n):
a,b = map(int,stdin.readline().split())
lst.append([a,b])
q=max(q,b*c)
def cout(x):
res=n
for i,item in enumerate(lst):
y,z=item[0],item[1]
res+=(x*y//z)
... | output | 1 | 14,421 | 3 | 28,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,422 | 3 | 28,844 |
Tags: binary search
Correct Solution:
```
n,c = map(int,input().split())
from sys import stdin
lst,q,zero = [],0,0
for i in range(n):
a,b = map(int,stdin.readline().split())
lst.append([a,b])
q=max(q,b*c)
if a==0:zero+=1
def cout(x):
res=n
for i,item in enumerate(lst):
y,z=item[0],item[1... | output | 1 | 14,422 | 3 | 28,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,423 | 3 | 28,846 |
Tags: binary search
Correct Solution:
```
n, c = map(int, input().split())
a = []
b = []
for i in range(n):
aa, bb = map(int, input().split())
a.append(aa)
b.append(bb)
def all_zero():
for aa in a:
if aa > 0: return False
return True
def days(x):
c = 0
for aa, bb in zip(a, b):
... | output | 1 | 14,423 | 3 | 28,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tourist is allowed to bring to the planet, and bi i... | instruction | 0 | 14,424 | 3 | 28,848 |
Tags: binary search
Correct Solution:
```
input=__import__('sys').stdin.readline
def check(x):
tmp=0
for i in range(n):
tmp+=(1 + (lis[i][0]*x)//lis[i][1])
return tmp
def zer(lis):
for i in lis:
if i[0]>0:
return False
return True
n,c = map(int,input().split())
lis... | output | 1 | 14,424 | 3 | 28,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,425 | 3 | 28,850 |
Yes | output | 1 | 14,425 | 3 | 28,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,426 | 3 | 28,852 |
Yes | output | 1 | 14,426 | 3 | 28,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,427 | 3 | 28,854 |
Yes | output | 1 | 14,427 | 3 | 28,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,428 | 3 | 28,856 |
Yes | output | 1 | 14,428 | 3 | 28,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,429 | 3 | 28,858 |
No | output | 1 | 14,429 | 3 | 28,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,430 | 3 | 28,860 |
No | output | 1 | 14,430 | 3 | 28,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,431 | 3 | 28,862 |
No | output | 1 | 14,431 | 3 | 28,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY plans a space travel on an ultramodern spaceship. During the voyage he plans to visit n planets. For planet i ai is the maximum number of suitcases that an alien tour... | instruction | 0 | 14,432 | 3 | 28,864 |
No | output | 1 | 14,432 | 3 | 28,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,449 | 3 | 28,898 |
Tags: data structures, implementation
Correct Solution:
```
from sys import stdin, stdout
n,m,k = map(int, stdin.readline().split())
g = [stdin.readline().split() for i in range(n)]
r = [i for i in range(n+1)]
c = [i for i in range(m+1)]
ans = []
for i in range(k):
t,x,y = stdin.readline().split()
x,y = int(... | output | 1 | 14,449 | 3 | 28,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,450 | 3 | 28,900 |
Tags: data structures, implementation
Correct Solution:
```
n,m,k=map(int,input().split())
a=[input().split() for _ in ' '*n]
r={str(i):i-1 for i in range(1,n+1)}
c={str(i):i-1 for i in range(1,m+1)}
ans=[]
for _ in range(k):
ch,x,y=input().split()
if ch=='c':
c[x],c[y]=c[y],c[x]
elif ch=='r':
... | output | 1 | 14,450 | 3 | 28,901 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,451 | 3 | 28,902 |
Tags: data structures, implementation
Correct Solution:
```
n, m, k = map(int, input().split())
R = {str(i): i - 1 for i in range(n+1)}
C = {str(i): i - 1 for i in range(m+1)}
ans = []
l = [input().split() for i in range(n)]
for i in range(k):
q, x, y = input().split()
if q == 'c':
C[x], C[y] = C[y], C[... | output | 1 | 14,451 | 3 | 28,903 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,452 | 3 | 28,904 |
Tags: data structures, implementation
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in ... | output | 1 | 14,452 | 3 | 28,905 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,453 | 3 | 28,906 |
Tags: data structures, implementation
Correct Solution:
```
from sys import stdout, stdin, setrecursionlimit
from io import BytesIO, IOBase
from collections import *
from itertools import *
# from random import *
from bisect import *
from string import *
from queue import *
from heapq import *
from math import *
from ... | output | 1 | 14,453 | 3 | 28,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,454 | 3 | 28,908 |
Tags: data structures, implementation
Correct Solution:
```
n,m,k=list(map(int,input().split()))
matrix=[input().split() for i in range(n)]
row=[i for i in range(n)]
col=[i for i in range(m)]
ans=[]
for i in range(k):
s,x,y=input().split()
x,y=int(x)-1,int(y)-1
if s=="c":
col[x],col[y]=col[y],col[x]
elif s=="r":... | output | 1 | 14,454 | 3 | 28,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,455 | 3 | 28,910 |
Tags: data structures, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
n ,m ,k = map(int ,input().split())
row ,col ,Data,ans = [], [],[],[]
for i in range(n):
row.append(i)
a = list(input().split())
Data.append(a)
for i in range(m):
col.append(i)
for _ in range(k):
s ,x ,... | output | 1 | 14,455 | 3 | 28,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement.
UCDHP stores some secret information abou... | instruction | 0 | 14,456 | 3 | 28,912 |
Tags: data structures, implementation
Correct Solution:
```
z=input().split()
n=int(z[0])
m=int(z[1])
k=int(z[2])
m_chis=[]
m_chis=[input().split() for i in range(n)]
row=[i for i in range(n)]
col=[i for i in range(m)]
otvet=[]
for i in range(k):
v=input().split()
x=int(v[1])-1
y=int(v[2])-1
if v[0]=... | output | 1 | 14,456 | 3 | 28,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,457 | 3 | 28,914 |
Yes | output | 1 | 14,457 | 3 | 28,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,458 | 3 | 28,916 |
Yes | output | 1 | 14,458 | 3 | 28,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,459 | 3 | 28,918 |
Yes | output | 1 | 14,459 | 3 | 28,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,460 | 3 | 28,920 |
Yes | output | 1 | 14,460 | 3 | 28,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,461 | 3 | 28,922 |
No | output | 1 | 14,461 | 3 | 28,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,462 | 3 | 28,924 |
No | output | 1 | 14,462 | 3 | 28,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,463 | 3 | 28,926 |
No | output | 1 | 14,463 | 3 | 28,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this moveme... | instruction | 0 | 14,464 | 3 | 28,928 |
No | output | 1 | 14,464 | 3 | 28,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Shuseki Islands are an archipelago of 30001 small islands in the Yutampo Sea. The islands are evenly spaced along a line, numbered from 0 to 30000 from the west to the east. These islands ar... | instruction | 0 | 14,592 | 3 | 29,184 |
No | output | 1 | 14,592 | 3 | 29,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Shuseki Islands are an archipelago of 30001 small islands in the Yutampo Sea. The islands are evenly spaced along a line, numbered from 0 to 30000 from the west to the east. These islands ar... | instruction | 0 | 14,593 | 3 | 29,186 |
No | output | 1 | 14,593 | 3 | 29,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Shuseki Islands are an archipelago of 30001 small islands in the Yutampo Sea. The islands are evenly spaced along a line, numbered from 0 to 30000 from the west to the east. These islands ar... | instruction | 0 | 14,594 | 3 | 29,188 |
No | output | 1 | 14,594 | 3 | 29,189 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.