message stringlengths 2 433k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 113 108k | cluster float64 12 12 | __index_level_0__ int64 226 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,230 | 12 | 160,460 |
No | output | 1 | 80,230 | 12 | 160,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,231 | 12 | 160,462 |
No | output | 1 | 80,231 | 12 | 160,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,232 | 12 | 160,464 |
No | output | 1 | 80,232 | 12 | 160,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,249 | 12 | 160,498 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
RI = lambda : [int(x) for x in input().split()]
rw = lambda : [input().strip()]
n=int(input())
l=RI()
stack=[]
index_stack=-1
maxo=0
i=0
while(i<n):
if(index_stack==-1 or stack[index_stack]>l[i]):
stack.append(l[i])
index_st... | output | 1 | 80,249 | 12 | 160,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,250 | 12 | 160,500 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
# https://codeforces.com/problemset/problem/281/D
def solve(array):
st = []
res = array[0] ^ array[1]
for i in range(n):
while(len(st) > 0 and array[i] >= st[-1]):
st.pop()
st.append(array[i])
if l... | output | 1 | 80,250 | 12 | 160,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,251 | 12 | 160,502 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
from sys import stdin
ip = stdin.readline
ip()
a = list(map(int, ip().split()))
stk = []
ans = 0
for i in a:
while stk:
ans = max(ans, stk[-1]^i)
if stk[-1]>i: break
stk.pop()
stk.append(i)
print(ans)
``` | output | 1 | 80,251 | 12 | 160,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,252 | 12 | 160,504 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
n = int(input())
li = [int(x) for x in input().split()]
monD = []
ans = 0
for i, j in zip( li, range( 0, len(li) ) ):
if j == 0:
monD.append(i)
else:
#print(monD, "adsd", monD[-1])
fl = 1
if monD[-1] > i:
ans = max(ans, i ^ monD[-1]... | output | 1 | 80,252 | 12 | 160,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,253 | 12 | 160,506 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
def max_ex(nums):
maximum = float('-inf')
stack=[]
for i in range(len(nums)):
if not stack:
stack.append(nums[i])
else:
while stack and stack[-1]<nums[i]:
maximum = max(maximum, stack[-1]^nums[i])
stack.pop()
if stack:
... | output | 1 | 80,253 | 12 | 160,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,254 | 12 | 160,508 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
n=int(input())
l=[int(i) for i in input().split()]
ans=0
stack=[]
for i in range(n):
while len(stack)!=0:
if l[i]>stack[len(stack)-1]:
ans=max(ans,l[i]^stack[len(stack)-1])
stack.pop()
else:
... | output | 1 | 80,254 | 12 | 160,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,255 | 12 | 160,510 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
n = int(input())
s = list(map(int,input().split()))
stack = []
ans = 0
for i in s:
while stack and stack[-1]<i:
t = stack.pop()
ans = max(ans,t^i)
stack.append(i)
if stack[0]!=stack[-1]:
ans = max(ans,stack[-1]... | output | 1 | 80,255 | 12 | 160,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: <image>.
The lucky nu... | instruction | 0 | 80,256 | 12 | 160,512 |
Tags: data structures, implementation, two pointers
Correct Solution:
```
from collections import deque
def ngr(a,n):
s=deque()
q=deque()
l=[]
for j in range(n-1,-1,-1):
if len(s)==0:
s.append(a[j])
else:
while len(s)!=0 and s[len(s)-1]<=a[j]:
... | output | 1 | 80,256 | 12 | 160,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,257 | 12 | 160,514 |
Yes | output | 1 | 80,257 | 12 | 160,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,258 | 12 | 160,516 |
Yes | output | 1 | 80,258 | 12 | 160,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,259 | 12 | 160,518 |
Yes | output | 1 | 80,259 | 12 | 160,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,260 | 12 | 160,520 |
Yes | output | 1 | 80,260 | 12 | 160,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,261 | 12 | 160,522 |
No | output | 1 | 80,261 | 12 | 160,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,262 | 12 | 160,524 |
No | output | 1 | 80,262 | 12 | 160,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,263 | 12 | 160,526 |
No | output | 1 | 80,263 | 12 | 160,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the fol... | instruction | 0 | 80,264 | 12 | 160,528 |
No | output | 1 | 80,264 | 12 | 160,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,265 | 12 | 160,530 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations ... | output | 1 | 80,265 | 12 | 160,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,266 | 12 | 160,532 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n = int(input())
if n % 2 == 0:
print(-1)
else:
print(*range(n))
print(*range(n))
print(*((i + i) % n for i in range(n)))
``` | output | 1 | 80,266 | 12 | 160,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,267 | 12 | 160,534 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n=int(input())
if n%2:
a=[i for i in range(n)]
b=[i for i in range(n)]
c=[(a[i]+b[i])%n for i in range(n)]
print(*a)
print(*b)
print(*c)
else:
print(-1)
``` | output | 1 | 80,267 | 12 | 160,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,268 | 12 | 160,536 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n = int(input())
if n % 2 == 0:
print(-1)
else:
print(*range(n))
print(*range(n))
print(*map(lambda x: x * 2 % n, range(n)))
``` | output | 1 | 80,268 | 12 | 160,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,269 | 12 | 160,538 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n = int(input())
if n % 2 == 1:
for i in range(n):
print(i, end=" ")
print()
for i in range(n):
print((i + 1)%n, end=" ")
print()
for i in range(n):
print((i + (i + 1)%n)%n, end=" ")
else:
print(-1)... | output | 1 | 80,269 | 12 | 160,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,270 | 12 | 160,540 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n=int(input())
a,b=[],[]
c=[]
if(n%2!=0):
for i in range(n):
a+=[i]
b+=[i]
c.append((a[i]+b[i])%n)
print(*a)
print(*b)
print(*c)
else:
print(-1)
``` | output | 1 | 80,270 | 12 | 160,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,271 | 12 | 160,542 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n = int(input())
if n % 2 == 0:
print('-1')
else:
a = range(n)
print(' '.join(map(str, a)))
print(' '.join(map(str, a)))
print(' '.join(map(lambda x: str((x[0] + x[1]) % n), zip(a, a))))
``` | output | 1 | 80,271 | 12 | 160,543 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] ... | instruction | 0 | 80,272 | 12 | 160,544 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
n = int(input())
if n % 2 == 0:
print(-1)
else:
lista = list(range(n))
saida = list(map(lambda x: (2*x)%n, lista))
print(' '.join(map(str, lista)))
print(' '.join(map(str, lista)))
print(' '.join(map(str, saida)))
``` | output | 1 | 80,272 | 12 | 160,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,273 | 12 | 160,546 |
Yes | output | 1 | 80,273 | 12 | 160,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,274 | 12 | 160,548 |
Yes | output | 1 | 80,274 | 12 | 160,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,275 | 12 | 160,550 |
Yes | output | 1 | 80,275 | 12 | 160,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,276 | 12 | 160,552 |
Yes | output | 1 | 80,276 | 12 | 160,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,277 | 12 | 160,554 |
No | output | 1 | 80,277 | 12 | 160,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,278 | 12 | 160,556 |
No | output | 1 | 80,278 | 12 | 160,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,279 | 12 | 160,558 |
No | output | 1 | 80,279 | 12 | 160,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation ... | instruction | 0 | 80,280 | 12 | 160,560 |
No | output | 1 | 80,280 | 12 | 160,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that the memory limit in this problem is less than usual.
Let's consider an array consisting of positive integers, some positions of which contain gaps.
We have a collection of numbers th... | instruction | 0 | 80,420 | 12 | 160,840 |
No | output | 1 | 80,420 | 12 | 160,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that the memory limit in this problem is less than usual.
Let's consider an array consisting of positive integers, some positions of which contain gaps.
We have a collection of numbers th... | instruction | 0 | 80,421 | 12 | 160,842 |
No | output | 1 | 80,421 | 12 | 160,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
a is an array of n positive integers, all of which are not greater than n.
You have to process q queries to this array. Each query is represented by two numbers p and k. Several operations are performed in each query; each operation changes... | instruction | 0 | 80,504 | 12 | 161,008 |
Tags: brute force, data structures, dp
Correct Solution:
```
import sys
n = int(sys.stdin.buffer.readline().decode('utf-8'))
a = [0] + list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))
q = int(sys.stdin.buffer.readline().decode('utf-8'))
dp_size = 200
dp = [[1]*(n+1) for _ in range(dp_size+1)]
for k... | output | 1 | 80,504 | 12 | 161,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
a is an array of n positive integers, all of which are not greater than n.
You have to process q queries to this array. Each query is represented by two numbers p and k. Several operations are performed in each query; each operation changes... | instruction | 0 | 80,505 | 12 | 161,010 |
Tags: brute force, data structures, dp
Correct Solution:
```
from sys import stdin, stdout, setrecursionlimit
input = stdin.readline
# import string
# characters = string.ascii_lowercase
# digits = string.digits
# setrecursionlimit(int(1e5))
# dir = [-1,0,1,0,-1]
# moves = 'NESW'
inf = float('inf')
from functools impor... | output | 1 | 80,505 | 12 | 161,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,526 | 12 | 161,052 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
import sys
import random
n, start, x = map(int, input().split())
visited = [False] * (n + 2)
left = 2000
print("? " + str(start))
left -= 1
sys.stdout.flush()
data = []
val, nex = map(int, input().split())
data.append((val, nex))
visited[start] = T... | output | 1 | 80,526 | 12 | 161,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,527 | 12 | 161,054 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
from random import sample
SIZE = 950
def R():
return map(int, input().split())
def ask(i):
print('?', i, flush=True)
v, nxt = R()
if v < 0:
exit()
return v, nxt
def ans(v):
print('!', v)
exit()
n, s, x = R()
v, ... | output | 1 | 80,527 | 12 | 161,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,528 | 12 | 161,056 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
import random
import sys
random.seed(a=5000)
n,start,x=map(int,input().split())
visited=[0]*(n+1)
bestans=10**10
tmp=0
bestbefore=start
out=['?',str(start)]
print(' '.join(out),flush=True)
value,next=map(int,input().split())
bestbeforeval=value
if valu... | output | 1 | 80,528 | 12 | 161,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,529 | 12 | 161,058 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
from sys import stdout
import random
n, start, x = map(int, input().split())
not_vis = set(range(1, n+1))
print('? ' + str(start))
stdout.flush()
val, nxt = map(int, input().split())
vis = set([start])
while 1:
if nxt == -1 and val == -1:
... | output | 1 | 80,529 | 12 | 161,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,530 | 12 | 161,060 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
from random import sample
def R():
return map(int, input().split())
def ask(i):
print('?', i, flush=True)
v, nxt = R()
if v < 0:
exit()
return v, nxt
def ans(v):
print('!', v)
exit()
n, s, x = R()
d = [None] * (n... | output | 1 | 80,530 | 12 | 161,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,531 | 12 | 161,062 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
import sys
n, start, x = map(int, input().split())
C = min(n, 998)
def get(i):
sys.stdout.write("? %d\n" % i)
sys.stdout.flush()
return list(map(int, sys.stdin.readline().split()))
def answer(a):
print("! %d" % a)
exit(0)
m = ge... | output | 1 | 80,531 | 12 | 161,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,532 | 12 | 161,064 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
from random import sample
from sys import stdout
read=lambda :map(int,input().split())
def ask(x):
print('? {}'.format(x))
stdout.flush()
return tuple(read())
def answer(x):
print('! {}'.format(x))
stdout.flush()
exit(0)
n,st,x=read()
a=[ask... | output | 1 | 80,532 | 12 | 161,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formally, there is a singly liked list built on an arr... | instruction | 0 | 80,533 | 12 | 161,066 |
Tags: brute force, interactive, probabilities
Correct Solution:
```
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
"""
created by shhuan at 2017/10/20 11:12
"""
N, X, S = map(int, input().split())
print("?", X)
V, ni = map(in... | output | 1 | 80,533 | 12 | 161,067 |
Provide a correct Python 3 solution for this coding contest problem.
We will define the median of a sequence b of length M, as follows:
* Let b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding ... | instruction | 0 | 80,670 | 12 | 161,340 |
"Correct Solution:
```
def cumsum(li):
ret = []
sum = 0
for i in li:
sum += i
ret.append(sum)
return ret
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __init__(self, size):
"""
:param int size:
"""
self._bit = [0 for _ in r... | output | 1 | 80,670 | 12 | 161,341 |
Provide a correct Python 3 solution for this coding contest problem.
We will define the median of a sequence b of length M, as follows:
* Let b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding ... | instruction | 0 | 80,671 | 12 | 161,342 |
"Correct Solution:
```
import math
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | output | 1 | 80,671 | 12 | 161,343 |
Provide a correct Python 3 solution for this coding contest problem.
We will define the median of a sequence b of length M, as follows:
* Let b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding ... | instruction | 0 | 80,672 | 12 | 161,344 |
"Correct Solution:
```
n = int(input())
A = list(map(int, input().split()))
def search(x):
b = n
r = 0
y = 0
D = [0]*(2*n+1)
for i in range(n):
D[b] += 1
if A[i] < x:
r += D[b]
b += 1
else:
b -= 1
r -= D[b]
y += r
... | output | 1 | 80,672 | 12 | 161,345 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.