message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,636 | 8 | 15,272 |
Tags: implementation
Correct Solution:
```
a,b,c=input().split()
a,b,c=int(a),int(b),int(c)
v=[]
s=0
d={}
min=50
max=0
for i in range(c):
v.append(input().split())
for j in range(int(v[i][0]),int(v[i][1])+1):
if int(v[i][0])<min:
min=int(v[i][0])
if int(v[i][1])>max:
max=... | output | 1 | 7,636 | 8 | 15,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you can build a house with an integer height between... | instruction | 0 | 7,637 | 8 | 15,274 |
Tags: implementation
Correct Solution:
```
n, h, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(m)]
a.sort(key=lambda x: x[2])
count = 0
mest = 0
b = [0 for i in range(n)]
for i in range(len(a)):
for j in range(a[i][0] - 1, a[i][1]):
if b[j] == 0:
b[j] = 1
... | output | 1 | 7,637 | 8 | 15,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,638 | 8 | 15,276 |
Yes | output | 1 | 7,638 | 8 | 15,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,639 | 8 | 15,278 |
Yes | output | 1 | 7,639 | 8 | 15,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,640 | 8 | 15,280 |
Yes | output | 1 | 7,640 | 8 | 15,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,641 | 8 | 15,282 |
Yes | output | 1 | 7,641 | 8 | 15,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,642 | 8 | 15,284 |
No | output | 1 | 7,642 | 8 | 15,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,643 | 8 | 15,286 |
No | output | 1 | 7,643 | 8 | 15,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,644 | 8 | 15,288 |
No | output | 1 | 7,644 | 8 | 15,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are planning to build housing on a street. There are n spots available on the street on which you can build a house. The spots are labeled from 1 to n from left to right. In each spot, you c... | instruction | 0 | 7,645 | 8 | 15,290 |
No | output | 1 | 7,645 | 8 | 15,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,658 | 8 | 15,316 |
Yes | output | 1 | 7,658 | 8 | 15,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,659 | 8 | 15,318 |
Yes | output | 1 | 7,659 | 8 | 15,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,660 | 8 | 15,320 |
Yes | output | 1 | 7,660 | 8 | 15,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,661 | 8 | 15,322 |
Yes | output | 1 | 7,661 | 8 | 15,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,662 | 8 | 15,324 |
No | output | 1 | 7,662 | 8 | 15,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,663 | 8 | 15,326 |
No | output | 1 | 7,663 | 8 | 15,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,664 | 8 | 15,328 |
No | output | 1 | 7,664 | 8 | 15,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances β one from the left end, and another from the right end. When a cus... | instruction | 0 | 7,665 | 8 | 15,330 |
No | output | 1 | 7,665 | 8 | 15,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,751 | 8 | 15,502 |
Tags: greedy, implementation, sortings
Correct Solution:
```
for _ in range(int(input())):
n,k = input().split()
lis=list(map(int, input().split()))
lis.sort(reverse=True)
for i in range(1,int(k)+1):
if(i<int(n)):
lis[0]+=lis[i]
print(lis[0])
``` | output | 1 | 7,751 | 8 | 15,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,752 | 8 | 15,504 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
import math
from collections import *
from functools import reduce,cmp_to_key,lru_cache
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_si... | output | 1 | 7,752 | 8 | 15,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,753 | 8 | 15,506 |
Tags: greedy, implementation, sortings
Correct Solution:
```
import sys
import heapq
input = sys.stdin.readline
def main():
t = int(input())
for _ in range(t):
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort(reverse=True)
ans = 0
f... | output | 1 | 7,753 | 8 | 15,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,754 | 8 | 15,508 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from sys import stdin
def barrels(k, a):
score, *a = sorted(a)[::-1]
for i in range(k):
if i > len(a) - 1:
break
score += a[i]
print(score)
if __name__ == "__main__":
t = int(stdin.readline())
cases = []
... | output | 1 | 7,754 | 8 | 15,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,755 | 8 | 15,510 |
Tags: greedy, implementation, sortings
Correct Solution:
```
t = int(input())
for i in range(t):
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
s = 0
for j in range(n - k - 1, n):
s += a[j]
print(s)
``` | output | 1 | 7,755 | 8 | 15,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,756 | 8 | 15,512 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from sys import stdin, stdout
import math,sys,heapq
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import random
import bisect as bi
def yes():print('YES')
def no():print('NO')
if (pa... | output | 1 | 7,756 | 8 | 15,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,757 | 8 | 15,514 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from math import gcd
from sys import stdout,stdin
for _ in range(int(stdin.readline())):
n,k = map(int,input().split())
ls = [int(x) for x in input().split()]
ls = sorted(ls,reverse=True)
s =0
pref =[]
for i in ls:
s+=i
... | output | 1 | 7,757 | 8 | 15,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of pouring, you can choose two different barrels ... | instruction | 0 | 7,758 | 8 | 15,516 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from math import *
t=int(input())
while t:
t=t-1
n,k=map(int,input().split())
#n=int(input())
a=list(map(int,input().split()))
#
#s=input()
a.sort()
j=n-2
for i in range(k):
a[n-1]+=a[j]
j=j-1
p... | output | 1 | 7,758 | 8 | 15,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,759 | 8 | 15,518 |
Yes | output | 1 | 7,759 | 8 | 15,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,760 | 8 | 15,520 |
Yes | output | 1 | 7,760 | 8 | 15,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,761 | 8 | 15,522 |
Yes | output | 1 | 7,761 | 8 | 15,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,762 | 8 | 15,524 |
Yes | output | 1 | 7,762 | 8 | 15,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,763 | 8 | 15,526 |
No | output | 1 | 7,763 | 8 | 15,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,764 | 8 | 15,528 |
No | output | 1 | 7,764 | 8 | 15,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,765 | 8 | 15,530 |
No | output | 1 | 7,765 | 8 | 15,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n barrels lined up in a row, numbered from left to right from one. Initially, the i-th barrel contains a_i liters of water.
You can pour water from one barrel to another. In one act of... | instruction | 0 | 7,766 | 8 | 15,532 |
No | output | 1 | 7,766 | 8 | 15,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
An infinitely long railway has a train consisting of n cars, numbered from 1 to n (the numbers of all the cars are distinct) and positioned in arbitrary order. David Blaine wants to sort the railway cars in the order of increasing numbers. I... | instruction | 0 | 7,962 | 8 | 15,924 |
Tags: constructive algorithms, greedy
Correct Solution:
```
#!/usr/bin/env python3
# 606C_sort.py - Codeforces.com/problemset/problem/606/C by Sergey 2015
import unittest
import sys
###############################################################################
# Sort Class (Main Program)
############################... | output | 1 | 7,962 | 8 | 15,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.
There are N attendees... | instruction | 0 | 8,198 | 8 | 16,396 |
No | output | 1 | 8,198 | 8 | 16,397 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,530 | 8 | 17,060 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys
import collections as cc
import bisect as bi
I=lambda:list(map(int,input().split()))
cur=1
def f(x):
return x*(x+1)//2
ar=[f((2**i)-1) for i in range(1,32)]
for i in range(1,len(ar)):
ar[i]+=ar[i-1]
for tc... | output | 1 | 8,530 | 8 | 17,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,531 | 8 | 17,062 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
def sum_ab(a,b):
return int((a + b) / 2 * (b - a + 1))
for _ in range(int((input()))):
schody = int(input())
koszt = 1
cos = 1
pot = 2
x = 0
while schody >= koszt:
schody -= koszt
c... | output | 1 | 8,531 | 8 | 17,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,532 | 8 | 17,064 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
n = 10
ans = [1]
for i in range(1, 32):
ans.append(ans[-1]*2+(2**i)**2)
for i in range(1, len(ans)):
ans[i] = ans[i]+ans[i-1]
t = int(input())
for _ in range(t):
num = int(input())
j = 0
while num >= an... | output | 1 | 8,532 | 8 | 17,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,533 | 8 | 17,066 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
for _ in range(int(input())):
x=int(input())
i,curr=0,0
while True:
curr = 2*curr+1
val = (curr*(curr+1))//2
if x>=val:
x-=val
i+=1
else:break
print(i)
`... | output | 1 | 8,533 | 8 | 17,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,534 | 8 | 17,068 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
ar=[]
r=1
while(1):
x=(r*(r+1))//2
if(x>1e20):
break
ar.append(x)
r=r*2+1
t=int(input())
for a0 in range(t):
x=int(input())
r=0;
while(x>0):
r+=1
x-=ar[r]
print(r)
``` | output | 1 | 8,534 | 8 | 17,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,535 | 8 | 17,070 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
def main():
n = int(input())
m = 0
k = 2
while n >= 0:
n -= (k - 1) * ((k - 1)// 2 + 1)
k *= 2
if n < 0:
break
m += 1
print(m)
if __name__ == '__main__':
... | output | 1 | 8,535 | 8 | 17,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,536 | 8 | 17,072 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
import math
t = int(input())
while (t):
x = int(input())
cnt = 0
i = 1
while (True):
if (i*(i+1)//2 <= x):
cnt += 1
else:
break
x -= i*(i+1)//2
i = i*2 + 1
print(cnt)
t -= 1
``` | output | 1 | 8,536 | 8 | 17,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase is a squared figure that consists of square cel... | instruction | 0 | 8,537 | 8 | 17,074 |
Tags: brute force, constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
d... | output | 1 | 8,537 | 8 | 17,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase ... | instruction | 0 | 8,538 | 8 | 17,076 |
Yes | output | 1 | 8,538 | 8 | 17,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase ... | instruction | 0 | 8,539 | 8 | 17,078 |
Yes | output | 1 | 8,539 | 8 | 17,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase ... | instruction | 0 | 8,540 | 8 | 17,080 |
Yes | output | 1 | 8,540 | 8 | 17,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase ... | instruction | 0 | 8,541 | 8 | 17,082 |
Yes | output | 1 | 8,541 | 8 | 17,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase ... | instruction | 0 | 8,542 | 8 | 17,084 |
No | output | 1 | 8,542 | 8 | 17,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jett is tired after destroying the town and she wants to have a rest. She likes high places, that's why for having a rest she wants to get high and she decided to craft staircases.
A staircase ... | instruction | 0 | 8,543 | 8 | 17,086 |
No | output | 1 | 8,543 | 8 | 17,087 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.