message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
X
Output
Print the minimum prime number greater th... | instruction | 0 | 100,114 | 5 | 200,228 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
X = int(input())
Num = X
while any(Num%i==0 for i in range(2,Num)):
Num += 1
print(Num)
``` | output | 1 | 100,114 | 5 | 200,229 |
Provide a correct Python 3 solution for this coding contest problem.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
X
Output
Print the minimum prime number greater th... | instruction | 0 | 100,115 | 5 | 200,230 |
"Correct Solution:
```
x = int(input())-1
a=0
while a == 0:
a=1
x+=1
for i in range(2, x):
if x % i ==0:
a=0
break
print(x)
``` | output | 1 | 100,115 | 5 | 200,231 |
Provide a correct Python 3 solution for this coding contest problem.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
X
Output
Print the minimum prime number greater th... | instruction | 0 | 100,116 | 5 | 200,232 |
"Correct Solution:
```
x = int(input())
while True:
for i in range(2,int(x**0.5)+1):
if x%i==0:
x += 1
break
else:
print(x)
break
``` | output | 1 | 100,116 | 5 | 200,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,117 | 5 | 200,234 |
Yes | output | 1 | 100,117 | 5 | 200,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,118 | 5 | 200,236 |
Yes | output | 1 | 100,118 | 5 | 200,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,119 | 5 | 200,238 |
Yes | output | 1 | 100,119 | 5 | 200,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,120 | 5 | 200,240 |
Yes | output | 1 | 100,120 | 5 | 200,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,121 | 5 | 200,242 |
No | output | 1 | 100,121 | 5 | 200,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,122 | 5 | 200,244 |
No | output | 1 | 100,122 | 5 | 200,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,123 | 5 | 200,246 |
No | output | 1 | 100,123 | 5 | 200,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the minimum prime number greater than or equal to X.
Constraints
* 2 \le X \le 10^5
* All values in input are integers.
Input
Input is given from Standard Input in the following format:... | instruction | 0 | 100,124 | 5 | 200,248 |
No | output | 1 | 100,124 | 5 | 200,249 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, poss... | instruction | 0 | 100,126 | 5 | 200,252 |
"Correct Solution:
```
N, K = map(int, input().split())
A = list(map(int, input().split()))
Asum = sum(A)
div = set()
for i in range(1, int(Asum ** 0.5 + 0.5) + 1):
if Asum % i == 0:
div.add(i)
div.add(Asum//i)
ans = 1
for d in div:
R = [a % d for a in A]
R.sort()
r = sum(R) // d
l... | output | 1 | 100,126 | 5 | 200,253 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, poss... | instruction | 0 | 100,127 | 5 | 200,254 |
"Correct Solution:
```
n,k,*a=map(int,open(0).read().split())
s=sum(a)
b=[]
for i in range(1,int(s**.5)+1):b+=[s//i,i]*(s%i<1)
m=1
for i in b:c=sorted(j%i for j in a);m=max(m,i*(sum(c[:-sum(c)//i])<=k))
print(m)
``` | output | 1 | 100,127 | 5 | 200,255 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, poss... | instruction | 0 | 100,128 | 5 | 200,256 |
"Correct Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
m=sum(a)
cd=set(())
for i in range(1,int(m**0.5)+2):
if m%i==0:
cd.add(i)
cd.add(m//i)
cd=list(cd)
cd.sort(reverse=True)
def func(x):
r=[ai%x for ai in a]
r.sort()
tmp=0
sr=[0]
for ri in r:
tmp+=ri
sr.append... | output | 1 | 100,128 | 5 | 200,257 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, poss... | instruction | 0 | 100,131 | 5 | 200,262 |
"Correct Solution:
```
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
candidate=set()
result=0
x=1
while x**2<=(sum(a)+1):
if sum(a)%x==0:
candidate.add(x)
candidate.add(int(sum(a)/x))
x+=1
# print(candidate)
for i in candidate:
b=[0]*len(a)
for j in range(len(a)):
b[j]=int(a[j]%i)
b... | output | 1 | 100,131 | 5 | 200,263 |
Provide a correct Python 3 solution for this coding contest problem.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, poss... | instruction | 0 | 100,132 | 5 | 200,264 |
"Correct Solution:
```
n,k = map(int, input().split())
a = list(map(int, input().split()))
t = sum(a)
r = set()
r.add(t)
for i in range(2,int(t**0.5)+2):
if t%i == 0:
r.add(i)
r.add(t//i)
ans = 1
for i in r:
f = [x%i for x in a]
f.sort()
if sum(f[:-sum(f)//i]) <= k:
ans = max(ans... | output | 1 | 100,132 | 5 | 200,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each betwe... | instruction | 0 | 100,135 | 5 | 200,270 |
Yes | output | 1 | 100,135 | 5 | 200,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each betwe... | instruction | 0 | 100,136 | 5 | 200,272 |
Yes | output | 1 | 100,136 | 5 | 200,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a sequence of N integers: A_1, A_2, \cdots, A_N.
You can perform the following operation between 0 and K times (inclusive):
* Choose two integers i and j such that i \neq j, each betwe... | instruction | 0 | 100,138 | 5 | 200,276 |
No | output | 1 | 100,138 | 5 | 200,277 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,193 | 5 | 200,386 |
"Correct Solution:
```
import sys
def solve():
a = int(input())
b = int(input())
if a == b:
print(1)
return
t = a ^ b
N = bitlen(t)
a = a & (2**N - 1)
b = b & (2**N - 1)
blen = bitlen(b)
sb = b & (2**(blen - 1) - 1)
sblen = bitlen(sb)
s = 2**sblen - 1
... | output | 1 | 100,193 | 5 | 200,387 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,194 | 5 | 200,388 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
def calc(A, B):
if A == B:
return 1
for i in range(61, -1, -1):
if A&(1<<i) and B&(1<<i):
A ^= 1<<i
B ^= 1<<i
if not A&(1<<i) and B&(1<<i):
break
Bd = B ^ (1<<(B.bit_length())-1)... | output | 1 | 100,194 | 5 | 200,389 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,195 | 5 | 200,390 |
"Correct Solution:
```
import math
A = int(input())
B = int(input())
if B < A: A,B = B,A
if A == B:
print(1)
else:
t = int(math.floor(math.log2(B)))
while (A & 2**t) == (B & 2**t):
if A & 2**t:
A -= 2**t
B -= 2**t
t-=1
ans = 2**t - A # [A,2^t-1]
... | output | 1 | 100,195 | 5 | 200,391 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,196 | 5 | 200,392 |
"Correct Solution:
```
import sys
def solve():
a = int(input())
b = int(input())
if a == b:
print(1)
return
t = a ^ b
N = len(bin(t)) - 2
t = 1 << N
a = a & (t - 1)
b = b & (t - 1)
blen = len(bin(b)) - 2
sb = b & (2**(blen - 1) - 1)
if sb == 0:
... | output | 1 | 100,196 | 5 | 200,393 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,197 | 5 | 200,394 |
"Correct Solution:
```
a=int(input())
b=int(input())
if a==b:
print(1)
exit()
abin=bin(a)[2:]
bbin=bin(b)[2:]
la=len(abin)
lb=len(bbin)
if la==lb:
while abin[0]==bbin[0]:
abin=abin[1:]
bbin=bbin[1:]
while len(abin)>1 and abin[0]=="0":
abin=abin[1:]
cbin=bbin[1:]
while cbin and cbin[0]=="0":
cbin=c... | output | 1 | 100,197 | 5 | 200,395 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,198 | 5 | 200,396 |
"Correct Solution:
```
# D
res = 0
A = int(input())
B = int(input())
def pow2_floor_log2(x):
res = 1
while res*2 <= x:
res *= 2
return res
if A == B:
res += 1
while A < B:
# find log2A and log2B
C = pow2_floor_log2(B)
if A < C:
# A to C
res += C - A
if... | output | 1 | 100,198 | 5 | 200,397 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,199 | 5 | 200,398 |
"Correct Solution:
```
def solve(a, b):
if a == b:
return 1
f = 1 << 60
r = 0
while f:
if r == 0 and b & f and a & f == 0:
r = f
elif r > 0 and b & f:
k = f << 1
break
f >>= 1
else:
k = 1
a &= r - 1
if k > a:
... | output | 1 | 100,199 | 5 | 200,399 |
Provide a correct Python 3 solution for this coding contest problem.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Constraints
* 1 ≤ A ≤ B < 2^{60}
* A and B are integers.
In... | instruction | 0 | 100,200 | 5 | 200,400 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
from functools import lru_cache
A = int(readline())
B = int(readline())
@lru_cache(None)
def can_make(A,B):
# [A,B] の元のorで、{B} 以外の方法でBを作れるかどうか。たいていTrue
if A == B:
return False
if B%2 == 0:
retur... | output | 1 | 100,200 | 5 | 200,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Const... | instruction | 0 | 100,201 | 5 | 200,402 |
Yes | output | 1 | 100,201 | 5 | 200,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Const... | instruction | 0 | 100,202 | 5 | 200,404 |
Yes | output | 1 | 100,202 | 5 | 200,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Const... | instruction | 0 | 100,203 | 5 | 200,406 |
No | output | 1 | 100,203 | 5 | 200,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Const... | instruction | 0 | 100,204 | 5 | 200,408 |
No | output | 1 | 100,204 | 5 | 200,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Const... | instruction | 0 | 100,205 | 5 | 200,410 |
No | output | 1 | 100,205 | 5 | 200,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nukes has an integer that can be represented as the bitwise OR of one or more integers between A and B (inclusive). How many possible candidates of the value of Nukes's integer there are?
Const... | instruction | 0 | 100,206 | 5 | 200,412 |
No | output | 1 | 100,206 | 5 | 200,413 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
2 2 2 0 0 0 5
Output
1 3 3 1 0 | instruction | 0 | 100,287 | 5 | 200,574 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
X, Y, Z, A, B, C, N = map(int, readline().split())
S = [0]*max(2*(X+Y+Z+1), 2*N+2)
for k in range(N):
S[k] = k*(k+1)//2
for k in range(N, X+Y+Z+1):
S[k] = k*(k+1)//2 + S[k-N]
def c... | output | 1 | 100,287 | 5 | 200,575 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,303 | 5 | 200,606 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
n, q = map(int, input().split())
INF = 2**31-1
LV = (n-1).bit_length()
N0 = 2**LV
data = [INF]*(2*N0)
lazy = [None]*(2*N0)
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N0) >> 1
lc = 0 if l & 1 else (L & -L).bit_lengt... | output | 1 | 100,303 | 5 | 200,607 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,304 | 5 | 200,608 |
"Correct Solution:
```
import math
class SegmentTree:
__slots__ = ["rank", "elem_size", "tree_size", "tree", "lazy", "default_value"]
def __init__(self, a: list, default: int):
self.default_value = default
real_size = len(a)
self.rank = math.ceil(math.log2(real_size))
self.ele... | output | 1 | 100,304 | 5 | 200,609 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,305 | 5 | 200,610 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
N, Q = map(int, input().split())
INF = 2**31-1
LV = (N-1).bit_length()
N0 = 2**LV
data = [INF]*(2*N0)
lazy = [None]*(2*N0)
def gindex(l, r):
L = l + N0; R = r + N0
lm = (L // (L & -L)) >> 1
rm = (R // (R & -R)) >> 1
... | output | 1 | 100,305 | 5 | 200,611 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,306 | 5 | 200,612 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
def gindex(l,r):
L,R=l+N0,r+N0
lm=L//(L&-L)>>1
rm=R//(R&-R)>>1
while L<R:
if R<=rm:
yield R
if L<=lm:
yield L
L>>=1
R>>=1
while L:
yield L
L>>=1
def propagates(*ids):
... | output | 1 | 100,306 | 5 | 200,613 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,307 | 5 | 200,614 |
"Correct Solution:
```
import math
from collections import deque
class SegmentTree:
__slots__ = ["rank", "elem_size", "tree_size", "tree", "lazy", "default_value"]
def __init__(self, a: list, default: int):
self.default_value = default
real_size = len(a)
self.rank = math.ceil(math.log... | output | 1 | 100,307 | 5 | 200,615 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,308 | 5 | 200,616 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
N, Q = map(int, input().split())
INF = 2**31-1
LV = (N-1).bit_length()
N0 = 2**LV
data = [INF]*(2*N0)
lazy = [None]*(2*N0)
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N0) >> 1
lc = 0 if l & 1 else (L & -L).bit_lengt... | output | 1 | 100,308 | 5 | 200,617 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,309 | 5 | 200,618 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N,Q=map(int,input().split())
seg_el=1<<(N.bit_length()) # Segment treeの台の要素数
SEG=[(1<<31)-1]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
LAZY=[None]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
def indexes(L,R):
INDLIST=[]... | output | 1 | 100,309 | 5 | 200,619 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.
Note that the initial values o... | instruction | 0 | 100,310 | 5 | 200,620 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in ran... | output | 1 | 100,310 | 5 | 200,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,311 | 5 | 200,622 |
Yes | output | 1 | 100,311 | 5 | 200,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,312 | 5 | 200,624 |
Yes | output | 1 | 100,312 | 5 | 200,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,313 | 5 | 200,626 |
Yes | output | 1 | 100,313 | 5 | 200,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,314 | 5 | 200,628 |
Yes | output | 1 | 100,314 | 5 | 200,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,315 | 5 | 200,630 |
No | output | 1 | 100,315 | 5 | 200,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,316 | 5 | 200,632 |
No | output | 1 | 100,316 | 5 | 200,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,317 | 5 | 200,634 |
No | output | 1 | 100,317 | 5 | 200,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:
* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element... | instruction | 0 | 100,318 | 5 | 200,636 |
No | output | 1 | 100,318 | 5 | 200,637 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.