message stringlengths 2 67k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 463 109k | cluster float64 19 19 | __index_level_0__ int64 926 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
John and his imaginary friend play a game. There are n lamps arranged in a circle. Lamps are numbered 1 through n in clockwise order, that is, lamps i and i + 1 are adjacent for any i = 1, …, n - 1, and also ... | instruction | 0 | 9,260 | 19 | 18,520 |
Tags: games, implementation, interactive, math
Correct Solution:
```
from sys import exit
from traceback import format_exc
def main():
n = int(input())
if n < 4:
print(0, flush=True)
return
on = [False] * n
def query(ll):
res = 0
pvals = [i+1 for i in ll]
print(l... | output | 1 | 9,260 | 19 | 18,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
John and his imaginary friend play a game. There are n lamps arranged in a circle. Lamps are numbered 1 through n in clockwise order, that is, lamps i and i + 1 ... | instruction | 0 | 9,261 | 19 | 18,522 |
No | output | 1 | 9,261 | 19 | 18,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
John and his imaginary friend play a game. There are n lamps arranged in a circle. Lamps are numbered 1 through n in clockwise order, that is, lamps i and i + 1 ... | instruction | 0 | 9,262 | 19 | 18,524 |
No | output | 1 | 9,262 | 19 | 18,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
John and his imaginary friend play a game. There are n lamps arranged in a circle. Lamps are numbered 1 through n in clockwise order, that is, lamps i and i + 1 ... | instruction | 0 | 9,263 | 19 | 18,526 |
No | output | 1 | 9,263 | 19 | 18,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
John and his imaginary friend play a game. There are n lamps arranged in a circle. Lamps are numbered 1 through n in clockwise order, that is, lamps i and i + 1 ... | instruction | 0 | 9,264 | 19 | 18,528 |
No | output | 1 | 9,264 | 19 | 18,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of them. Each word consists of 2·n binary characte... | instruction | 0 | 9,398 | 19 | 18,796 |
Tags: games, greedy
Correct Solution:
```
#!/usr/bin/python3
n = int(input())
s = list(input())
l = list(input())
a = len([_ for _ in zip(s, l) if _ == ('1', '1')])
b = len([_ for _ in zip(s, l) if _ == ('1', '0')])
c = len([_ for _ in zip(s, l) if _ == ('0', '1')])
f = b + (a + 1) // 2
s = c + a // 2
if f > s:
pr... | output | 1 | 9,398 | 19 | 18,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of ... | instruction | 0 | 9,399 | 19 | 18,798 |
No | output | 1 | 9,399 | 19 | 18,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya and Vasya are inventing a new game that requires a rectangular board and one chess piece. At the beginning of the game the piece stands in the upper-left corner of the board. Two players m... | instruction | 0 | 9,419 | 19 | 18,838 |
No | output | 1 | 9,419 | 19 | 18,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya and Vasya are inventing a new game that requires a rectangular board and one chess piece. At the beginning of the game the piece stands in the upper-left corner of the board. Two players m... | instruction | 0 | 9,420 | 19 | 18,840 |
No | output | 1 | 9,420 | 19 | 18,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n boxes with colored balls on the table. Colors are numbered from 1 to n. i-th box contains ai balls, all of which have color i. You have to write a program that will divide all balls into sets such that:
* each ball belongs to ... | instruction | 0 | 9,568 | 19 | 19,136 |
Tags: greedy, math, number theory
Correct Solution:
```
# Returns the number of coins that is necessary for paying the amount
# with the two types of coins that have value of coin and coin + 1
def pay(coin, amount):
if amount // coin < amount % coin:
return -1;
if amount < coin * (coin + 1):
ret... | output | 1 | 9,568 | 19 | 19,137 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,845 | 19 | 19,690 |
"Correct Solution:
```
from functools import lru_cache
digits = list(map(lambda x: str(x),range(1,10)))
@lru_cache(maxsize=None)
def check(s,n):
return ' '.join([s]*n)
def down(x):
x = list(x[::-1])
while '0' in x:
x.remove('0')
x.append('#')
return x
def main(n):
data = '\... | output | 1 | 9,845 | 19 | 19,691 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,846 | 19 | 19,692 |
"Correct Solution:
```
def fall(S,H):
for h in range(H-1):
for i in range(5):
if S[h][i]=="0":
S[h][i] = S[h+1][i]
S[h+1][i] = "0"
return S
while True:
H = int(input())
if H==0:
break
S = [list(input().split()) for i in range(H)]
S = S[... | output | 1 | 9,846 | 19 | 19,693 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,847 | 19 | 19,694 |
"Correct Solution:
```
while True:
H = int(input())
if H==0:
exit()
board = [[0]*5 for _ in range(H+1)]
for i in range(1,H+1):
board[i] = list(map(int, input().split()))
board = board[::-1]
change = True
score = 0
while change==True:
change = False
for i i... | output | 1 | 9,847 | 19 | 19,695 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,848 | 19 | 19,696 |
"Correct Solution:
```
H = int(input())
while H:
Ali = [list(map(int,input().split())) for _ in range(H)]
score = 0
while True:
sc = score
for i in range(H):
Row = Ali[i]
#5つ
if Row[0] == Row[1] == Row[2] == Row[3] == Row[4]:
score += Row[0]*5
Ali[i][0] = Ali[i][1] = Ali... | output | 1 | 9,848 | 19 | 19,697 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,849 | 19 | 19,698 |
"Correct Solution:
```
from itertools import groupby
def main():
while True:
h = int(input())
w = 5
if h == 0: break
field = []
for i in range(h):
field.append(list(map(int,input().split())))
score = 0
while True:
scoreinc =... | output | 1 | 9,849 | 19 | 19,699 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,850 | 19 | 19,700 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [li... | output | 1 | 9,850 | 19 | 19,701 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,851 | 19 | 19,702 |
"Correct Solution:
```
while True:
h = int(input())
if h==0:
break
puyo = [list(map(int, input().split())) for _ in range(h)]
p = 0
fin = 0
turn = 1
while fin==0:
#[print(*puyo[i]) for i in range(h)]
fin = 1
for i in range(h):
cnt = 1
... | output | 1 | 9,851 | 19 | 19,703 |
Provide a correct Python 3 solution for this coding contest problem.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one of 1 through 9, is placed in each of the cells. When thr... | instruction | 0 | 9,852 | 19 | 19,704 |
"Correct Solution:
```
W = 5
def calc_score(ban, score):
add_score = 0
after_ban = []
H = len(ban)
for h in range(H):
row = []
cnt = 1
cur = ban[h][0]
for w in range(1, W):
if cur == ban[h][w]:
cnt += 1
else:
row.ap... | output | 1 | 9,852 | 19 | 19,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,853 | 19 | 19,706 |
Yes | output | 1 | 9,853 | 19 | 19,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,854 | 19 | 19,708 |
Yes | output | 1 | 9,854 | 19 | 19,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,855 | 19 | 19,710 |
Yes | output | 1 | 9,855 | 19 | 19,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,856 | 19 | 19,712 |
Yes | output | 1 | 9,856 | 19 | 19,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,857 | 19 | 19,714 |
No | output | 1 | 9,857 | 19 | 19,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,858 | 19 | 19,716 |
No | output | 1 | 9,858 | 19 | 19,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,859 | 19 | 19,718 |
No | output | 1 | 9,859 | 19 | 19,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chain Disappearance Puzzle
We are playing a puzzle. An upright board with H rows by 5 columns of cells, as shown in the figure below, is used in this puzzle. A stone engraved with a digit, one ... | instruction | 0 | 9,860 | 19 | 19,720 |
No | output | 1 | 9,860 | 19 | 19,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,107 | 19 | 20,214 |
Tags: bitmasks, brute force
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
s = set(list(map(int, input().split())))
p=-1
for i in range(1,1025):
for x in s:
if x^i not in s:
break
else:
p=i
if p!=-1:
... | output | 1 | 10,107 | 19 | 20,215 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,108 | 19 | 20,216 |
Tags: bitmasks, brute force
Correct Solution:
```
for test in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
b=a.copy()
b.sort()
ans=-1
if b[0]==0:
for i in range(1,n):
temp=[]
for j in range(n):
temp.append(a[j]^b[i])
if set(temp)==set(a):
ans=b[i]
break
print(ans)
... | output | 1 | 10,108 | 19 | 20,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,109 | 19 | 20,218 |
Tags: bitmasks, brute force
Correct Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import ceil, floor, gcd, sqrt, trunc, inf
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, perm... | output | 1 | 10,109 | 19 | 20,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,110 | 19 | 20,220 |
Tags: bitmasks, brute force
Correct Solution:
```
import math
t = int(input())
for _ in range(t):
n = int(input())
setList = [int(var) for var in input().split()]
origSet = set(setList)
flag = True
for k in range(1, 1025):
visited = set()
for var in setList:
# print(var, ... | output | 1 | 10,110 | 19 | 20,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,111 | 19 | 20,222 |
Tags: bitmasks, brute force
Correct Solution:
```
''' ## ## ####### # # ######
## ## ## ## ### ##
## ## ## # # # ##
######### ####### # # ## '''
import sys
import math
# sys.setrecursionlimit(10**6)
def get_ints(): return map(int, input().strip().split... | output | 1 | 10,111 | 19 | 20,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,112 | 19 | 20,224 |
Tags: bitmasks, brute force
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
a = set(map(int, input().split()))
ans = 0
for i in range(1024):
s = a.copy()
ok = True
while len(s) != 0:
e = s.pop()
if e^i... | output | 1 | 10,112 | 19 | 20,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,113 | 19 | 20,226 |
Tags: bitmasks, brute force
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
S = list(map(int, input().split(' ')))
done = False
for k in range(1,1024):
s = set(S)
while len(s) > 0:
x = s.pop()
if (k^x) not in s:
s.add(x)
... | output | 1 | 10,113 | 19 | 20,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,114 | 19 | 20,228 |
Tags: bitmasks, brute force
Correct Solution:
```
t=int(input())
import math
for _ in range(t):
n=int(input())
s=set([int(x) for x in input().split()])
if (n==1):
print(-1)
continue
m=2**(int(math.log2(max(s)))+1)-1
ans = 0
k=1
while (k<=m and ans==0):
s2=set()
... | output | 1 | 10,114 | 19 | 20,229 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is unaware that combining these two activities can ... | instruction | 0 | 10,115 | 19 | 20,230 |
Tags: bitmasks, brute force
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
from fractions import gcd
raw_input = stdin.readline
pr = stdout.write
mod=10**9+7
def ni():
return int(raw_input())
def li():
return m... | output | 1 | 10,115 | 19 | 20,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,116 | 19 | 20,232 |
Yes | output | 1 | 10,116 | 19 | 20,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,117 | 19 | 20,234 |
Yes | output | 1 | 10,117 | 19 | 20,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,118 | 19 | 20,236 |
Yes | output | 1 | 10,118 | 19 | 20,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,119 | 19 | 20,238 |
Yes | output | 1 | 10,119 | 19 | 20,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,120 | 19 | 20,240 |
No | output | 1 | 10,120 | 19 | 20,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,121 | 19 | 20,242 |
No | output | 1 | 10,121 | 19 | 20,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,122 | 19 | 20,244 |
No | output | 1 | 10,122 | 19 | 20,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Among Johnny's numerous hobbies, there are two seemingly harmless ones: applying bitwise operations and sneaking into his dad's office. As it is usually the case with small children, Johnny is u... | instruction | 0 | 10,123 | 19 | 20,246 |
No | output | 1 | 10,123 | 19 | 20,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and ... | instruction | 0 | 10,229 | 19 | 20,458 |
No | output | 1 | 10,229 | 19 | 20,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and ... | instruction | 0 | 10,230 | 19 | 20,460 |
No | output | 1 | 10,230 | 19 | 20,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and ... | instruction | 0 | 10,231 | 19 | 20,462 |
No | output | 1 | 10,231 | 19 | 20,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and ... | instruction | 0 | 10,232 | 19 | 20,464 |
No | output | 1 | 10,232 | 19 | 20,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has unusual memory constraint.
At evening, Igor and Zhenya the financiers became boring, so they decided to play a game. They prepared n papers with the income of some company for ... | instruction | 0 | 10,425 | 19 | 20,850 |
No | output | 1 | 10,425 | 19 | 20,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has unusual memory constraint.
At evening, Igor and Zhenya the financiers became boring, so they decided to play a game. They prepared n papers with the income of some company for ... | instruction | 0 | 10,426 | 19 | 20,852 |
No | output | 1 | 10,426 | 19 | 20,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has unusual memory constraint.
At evening, Igor and Zhenya the financiers became boring, so they decided to play a game. They prepared n papers with the income of some company for ... | instruction | 0 | 10,427 | 19 | 20,854 |
No | output | 1 | 10,427 | 19 | 20,855 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.