message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could caus... | instruction | 0 | 12,716 | 3 | 25,432 |
Tags: math, number theory
Correct Solution:
```
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buff... | output | 1 | 12,716 | 3 | 25,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could caus... | instruction | 0 | 12,717 | 3 | 25,434 |
Tags: math, number theory
Correct Solution:
```
import sys
input=sys.stdin.readline
from math import gcd
n,k=map(int,input().split())
a=[[] for i in range(n+1)] # have primes of i
active=[0]*(n+1)
act={}
for i in range(2,n+1):
if not a[i]:
act[i]=0
for j in range(i,n+1,i):
a[j].append(i)
for _ in range(... | output | 1 | 12,717 | 3 | 25,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could caus... | instruction | 0 | 12,718 | 3 | 25,436 |
Tags: math, number theory
Correct Solution:
```
import random, math, sys
from copy import deepcopy as dc
from bisect import bisect_left, bisect_right
from collections import Counter
input = sys.stdin.readline
# Function to call the actual solution
def solution(li, n, m):
s = [[] for i in range(n)]
for j in range(2... | output | 1 | 12,718 | 3 | 25,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could caus... | instruction | 0 | 12,719 | 3 | 25,438 |
Tags: math, number theory
Correct Solution:
```
from sys import stdin
import math
n, k = map(int, stdin.readline().rstrip().split(" "))
a = [[] for i in range(n+1)]
act = {}
active = [0]*(n+1)
for i in range(2,n+1):
if not a[i]:
act[i]=0
for j in range(i,n+1,i):
a[j].append(i)
stori... | output | 1 | 12,719 | 3 | 25,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could caus... | instruction | 0 | 12,720 | 3 | 25,440 |
Tags: math, number theory
Correct Solution:
```
MAXN = 100005
pr = [0] * MAXN
n, m = map(int, input().split())
for i in range(2, n + 1, 2):
pr[i] = 2
for i in range(3, n + 1, 2):
if not pr[i]:
j = i
while j <= n:
if not pr[j]:
pr[j] = i
j += i
answer = ... | output | 1 | 12,720 | 3 | 25,441 |
Provide tags and a correct Python 3 solution for this coding contest problem.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could caus... | instruction | 0 | 12,721 | 3 | 25,442 |
Tags: math, number theory
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
... | output | 1 | 12,721 | 3 | 25,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activat... | instruction | 0 | 12,722 | 3 | 25,444 |
Yes | output | 1 | 12,722 | 3 | 25,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activat... | instruction | 0 | 12,723 | 3 | 25,446 |
Yes | output | 1 | 12,723 | 3 | 25,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activat... | instruction | 0 | 12,724 | 3 | 25,448 |
No | output | 1 | 12,724 | 3 | 25,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activat... | instruction | 0 | 12,725 | 3 | 25,450 |
No | output | 1 | 12,725 | 3 | 25,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activat... | instruction | 0 | 12,726 | 3 | 25,452 |
No | output | 1 | 12,726 | 3 | 25,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activat... | instruction | 0 | 12,727 | 3 | 25,454 |
No | output | 1 | 12,727 | 3 | 25,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,947 | 3 | 25,894 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
import math
ax,ay,bx,by,tx,ty = map(float,input().split(" "))
n = int(input())
dis = 0.0
a1Dis = 100000000000.0**2
a2Dis = 100000000000.0**2
b1Dis = 100000000000.0**2
b2Dis = 100000000000.0**2
a1=0
b1=0
rec=0.0
for i in range(n):
x,y = map(float,input... | output | 1 | 12,947 | 3 | 25,895 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,948 | 3 | 25,896 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
import math
ax, ay, bx, by, tx, ty = [int(coord) for coord in input().split()]
n = int(input())
x ,y = [], []
minDis = 0
diff1 = []
diff2 = []
for i in range(n):
xi, yi = [int(coord) for coord in input().split()]
x.append(xi)
y.... | output | 1 | 12,948 | 3 | 25,897 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,949 | 3 | 25,898 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
ax, ay, bx, by, tx, ty = map(int, input().split())
n = int(input())
X = [0] * n
Y = [0] * n
T = [0.0] * n
res = 0.0
for i in range(n):
X[i], Y[i] = map(int, input().split())
T[i] = ((X[i] - tx) ** 2 + (Y[i] - ty) ** 2) ** 0.5
res += T[i] * 2... | output | 1 | 12,949 | 3 | 25,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,950 | 3 | 25,900 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
import math
R = lambda: map(int, input().split())
ax, ay, bx, by, tx, ty = R()
n = int(input())
dp = [[0] * (n + 1) for i in range(4)]
for i in range(n):
x, y = R()
da, db, dt = ((x - ax) ** 2 + (y - ay) ** 2) ** 0.5, ((x - bx) ** 2 + (y - by) ** ... | output | 1 | 12,950 | 3 | 25,901 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,951 | 3 | 25,902 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)
ax, ay, bx, by, tx, ty = map(int, input().split())
n = int(input())
p = [tuple(int(x) for x in input().split()) for _ in range(n)]
da = [(dist(x[0], x[1], ax, ... | output | 1 | 12,951 | 3 | 25,903 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,952 | 3 | 25,904 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
from math import *
ax, ay, bx, by, cx, cy = map(lambda t: int(t), input().split())
n = int(input())
dist = 0
maxv = [[-inf, -inf], [-inf, -inf]]
index = [[0,0], [0,0]]
def update(d, idx, p):
global maxv, index
if d > maxv[p][0]:
maxv[p][... | output | 1 | 12,952 | 3 | 25,905 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,953 | 3 | 25,906 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
from math import *
ax, ay, bx, by, cx, cy = [int(t) for t in input().split()]
n = int(input())
dist = 0
maxv = [[-inf, -inf], [-inf, -inf]]
index = [[0,0], [0,0]]
def update(d, idx, p):
global maxv, index
if d > maxv[p][0]:
maxv[p][1] = ... | output | 1 | 12,953 | 3 | 25,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as coordinate plane. There are n bottles on the gr... | instruction | 0 | 12,954 | 3 | 25,908 |
Tags: dp, geometry, greedy, implementation
Correct Solution:
```
import math
def dist(x1, y1, x2, y2):
res = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)
res = math.sqrt(res)
return res
ax, ay, bx, by, tx, ty = list(map(int, input().split()))
n = int(input())
ans = 0
bottles = [(0, 0) for i in range(n)... | output | 1 | 12,954 | 3 | 25,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,955 | 3 | 25,910 |
Yes | output | 1 | 12,955 | 3 | 25,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,956 | 3 | 25,912 |
Yes | output | 1 | 12,956 | 3 | 25,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,957 | 3 | 25,914 |
Yes | output | 1 | 12,957 | 3 | 25,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,958 | 3 | 25,916 |
Yes | output | 1 | 12,958 | 3 | 25,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,959 | 3 | 25,918 |
No | output | 1 | 12,959 | 3 | 25,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,960 | 3 | 25,920 |
No | output | 1 | 12,960 | 3 | 25,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,961 | 3 | 25,922 |
No | output | 1 | 12,961 | 3 | 25,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground and put them into a recycling bin.
We can think Central Perk as ... | instruction | 0 | 12,962 | 3 | 25,924 |
No | output | 1 | 12,962 | 3 | 25,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two neighbours, Alan and Bob, live in the city, where there are three buildings only: a cinema, a shop and the house, where they live. The rest is a big asphalt square.
Once they went to the c... | instruction | 0 | 13,055 | 3 | 26,110 |
No | output | 1 | 13,055 | 3 | 26,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two neighbours, Alan and Bob, live in the city, where there are three buildings only: a cinema, a shop and the house, where they live. The rest is a big asphalt square.
Once they went to the c... | instruction | 0 | 13,056 | 3 | 26,112 |
No | output | 1 | 13,056 | 3 | 26,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two neighbours, Alan and Bob, live in the city, where there are three buildings only: a cinema, a shop and the house, where they live. The rest is a big asphalt square.
Once they went to the c... | instruction | 0 | 13,057 | 3 | 26,114 |
No | output | 1 | 13,057 | 3 | 26,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,323 | 3 | 26,646 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
n, y1 = map(int, input().split())
a = list(map(int, input().split()))
m, y2 = map(int, input().split())
b = list(map(int, input().split()))
a_st, b_st = dict(), dict()
osn = 2 ** 30
k_a, k_b = set(), set()
for el in a:
try:
a_st[el ... | output | 1 | 13,323 | 3 | 26,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,324 | 3 | 26,648 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
#coding:utf-8
n, _ = map (int, input().strip ().split ())
a = list (map (int, input().strip ().split ()))
m, _ = map (int, input().strip ().split ())
b = list (map (int, input().strip ().split ()))
def solve (T):
global a, b
d = dict()
for i... | output | 1 | 13,324 | 3 | 26,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,325 | 3 | 26,650 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
n, y1 = map(int, input().split())
a = list(map(int, input().split()))
m, y2 = map(int, input().split())
b = list(map(int, input().split()))
a_st, b_st = dict(), dict()
osn = 2 ** 32
k_a, k_b = set(), set()
for el in a:
try:
a_st[el ... | output | 1 | 13,325 | 3 | 26,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,326 | 3 | 26,652 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
n, y1 = map(int, input().split())
a = list(map(int, input().split()))
m, y2 = map(int, input().split())
b = list(map(int, input().split()))
ans = 2
for i in range(30):
step = (2 << i)
half = (step >> 1)
counts = dict()
for x in a:
rem =... | output | 1 | 13,326 | 3 | 26,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,327 | 3 | 26,654 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
n, y1 = map(int, input().split())
a = list(map(int, input().split()))
m, y2 = map(int, input().split())
b = list(map(int, input().split()))
a_st, b_st = dict(), dict()
osn = 2 ** 29
k_a, k_b = set(), set()
for el in a:
try:
a_st[el ... | output | 1 | 13,327 | 3 | 26,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,328 | 3 | 26,656 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
n,w56=map(int,input().split())
if(n==1):
x=[int(input())]
else:
x=[int(i) for i in input().split()]
k,w90=map(int,input().split())
if(k==1):
y=[int(input())]
else:
y=[int(i) for i in input().split()]
t=0
import collections
for i i... | output | 1 | 13,328 | 3 | 26,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,329 | 3 | 26,658 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
x,y = map(int,input().split())
a = list(map(int,input().split()))
o,p = map(int,input().split())
b = list(map(int,input().split()))
ans = 0
from collections import defaultdict
for i in range(34):
fac = 2**i
fac2 = fac*2
if i == 3... | output | 1 | 13,329 | 3 | 26,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube.
You are going to emit a laser ray in the tub... | instruction | 0 | 13,330 | 3 | 26,660 |
Tags: data structures, divide and conquer, dp, math
Correct Solution:
```
n, y1 = map(int, input().split())
a = list(map(int, input().split()))
m, y2 = map(int, input().split())
b = list(map(int, input().split()))
ans = 2
for i in range(31):
step = (2 << i)
half = (step >> 1)
counts = dict()
for x in a:
rem =... | output | 1 | 13,330 | 3 | 26,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube... | instruction | 0 | 13,331 | 3 | 26,662 |
No | output | 1 | 13,331 | 3 | 26,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube... | instruction | 0 | 13,332 | 3 | 26,664 |
No | output | 1 | 13,332 | 3 | 26,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube... | instruction | 0 | 13,333 | 3 | 26,666 |
No | output | 1 | 13,333 | 3 | 26,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a tube which is reflective inside represented as two non-coinciding, but parallel to Ox lines. Each line has some special integer points — positions of sensors on sides of the tube... | instruction | 0 | 13,334 | 3 | 26,668 |
No | output | 1 | 13,334 | 3 | 26,669 |
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.
In good old times dwarves tried to develop extrasensory abilities:
* Exactly n dwarves entered completely dark cave.
* Each dwarf received a hat — white or... | instruction | 0 | 13,335 | 3 | 26,670 |
No | output | 1 | 13,335 | 3 | 26,671 |
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.
In good old times dwarves tried to develop extrasensory abilities:
* Exactly n dwarves entered completely dark cave.
* Each dwarf received a hat — white or... | instruction | 0 | 13,336 | 3 | 26,672 |
No | output | 1 | 13,336 | 3 | 26,673 |
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.
In good old times dwarves tried to develop extrasensory abilities:
* Exactly n dwarves entered completely dark cave.
* Each dwarf received a hat — white or... | instruction | 0 | 13,337 | 3 | 26,674 |
No | output | 1 | 13,337 | 3 | 26,675 |
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.
In good old times dwarves tried to develop extrasensory abilities:
* Exactly n dwarves entered completely dark cave.
* Each dwarf received a hat — white or... | instruction | 0 | 13,338 | 3 | 26,676 |
No | output | 1 | 13,338 | 3 | 26,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | instruction | 0 | 13,485 | 3 | 26,970 |
Tags: data structures, sortings
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
# from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('inp... | output | 1 | 13,485 | 3 | 26,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | instruction | 0 | 13,486 | 3 | 26,972 |
Tags: data structures, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r"... | output | 1 | 13,486 | 3 | 26,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
During one of the space missions, humans have found an evidence of previous life at one of the planets. They were lucky enough to find a book with birth and death years of each individual that had been living at this planet. What's interesti... | instruction | 0 | 13,487 | 3 | 26,974 |
Tags: data structures, sortings
Correct Solution:
```
from sys import stdout, stdin, setrecursionlimit
from io import BytesIO, IOBase
from collections import *
from itertools import *
from random import *
from bisect import *
from string import *
from queue import *
from heapq import *
from math import *
from re impor... | output | 1 | 13,487 | 3 | 26,975 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.