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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it?
The discotheque can be seen as an infinite xy-plane, in which t... | instruction | 0 | 83,897 | 3 | 167,794 |
Yes | output | 1 | 83,897 | 3 | 167,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it?
The discotheque can be seen as an infinite xy-plane, in which t... | instruction | 0 | 83,898 | 3 | 167,796 |
No | output | 1 | 83,898 | 3 | 167,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it?
The discotheque can be seen as an infinite xy-plane, in which t... | instruction | 0 | 83,899 | 3 | 167,798 |
No | output | 1 | 83,899 | 3 | 167,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it?
The discotheque can be seen as an infinite xy-plane, in which t... | instruction | 0 | 83,900 | 3 | 167,800 |
No | output | 1 | 83,900 | 3 | 167,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it?
The discotheque can be seen as an infinite xy-plane, in which t... | instruction | 0 | 83,901 | 3 | 167,802 |
No | output | 1 | 83,901 | 3 | 167,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several... | instruction | 0 | 83,912 | 3 | 167,824 |
No | output | 1 | 83,912 | 3 | 167,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several... | instruction | 0 | 83,913 | 3 | 167,826 |
No | output | 1 | 83,913 | 3 | 167,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several... | instruction | 0 | 83,914 | 3 | 167,828 |
No | output | 1 | 83,914 | 3 | 167,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several... | instruction | 0 | 83,915 | 3 | 167,830 |
No | output | 1 | 83,915 | 3 | 167,831 |
Provide a correct Python 3 solution for this coding contest problem.
She catched the thrown coin that draws parabolic curve with her sparkling fingers. She is an ESPer. Yes, she is an electro-master who has the third strongest power among more than one million ESPers in the city. Being flicked by her thumb, the coin i... | instruction | 0 | 84,147 | 3 | 168,294 |
"Correct Solution:
```
from sys import stdin
def solve():
file_input = stdin
while True:
D = float(file_input.readline())
if D == 0:
break
px, py, vx, vy = map(float, file_input.readline().split())
if px * vy - py * vx == 0:
OP = (px ** 2 + py ** 2) ** 0.... | output | 1 | 84,147 | 3 | 168,295 |
Provide a correct Python 3 solution for this coding contest problem.
She catched the thrown coin that draws parabolic curve with her sparkling fingers. She is an ESPer. Yes, she is an electro-master who has the third strongest power among more than one million ESPers in the city. Being flicked by her thumb, the coin i... | instruction | 0 | 84,148 | 3 | 168,296 |
"Correct Solution:
```
# AOJ 1053: Accelerated Railgun
# Python3 2018.7.7 bal4u
EPS = 1e-7
while True:
d = float(input())
if d == 0: break
px, py, vx, vy = map(float, input().split())
ans = d+1
dp = (px*px + py*py)**0.5
dv = (vx*vx + vy*vy)**0.5
x = (px*vx + py*vy)/(dp*dv)
if abs(x+1) <= EPS: ans = dp
elif ab... | output | 1 | 84,148 | 3 | 168,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
She catched the thrown coin that draws parabolic curve with her sparkling fingers. She is an ESPer. Yes, she is an electro-master who has the third strongest power among more than one million ES... | instruction | 0 | 84,149 | 3 | 168,298 |
No | output | 1 | 84,149 | 3 | 168,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
She catched the thrown coin that draws parabolic curve with her sparkling fingers. She is an ESPer. Yes, she is an electro-master who has the third strongest power among more than one million ES... | instruction | 0 | 84,150 | 3 | 168,300 |
No | output | 1 | 84,150 | 3 | 168,301 |
Provide a correct Python 3 solution for this coding contest problem.
A straight tunnel without branches is crowded with busy ants coming and going. Some ants walk left to right and others right to left. All ants walk at a constant speed of 1 cm/s. When two ants meet, they try to pass each other. However, some sections... | instruction | 0 | 84,156 | 3 | 168,312 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
LR = "LR".index
def solve(A, L):
K = len(A)
if K == 0:
return -1, -1, -1
T = []
v = -1; last = None
left = 0
for i in range(K):
di, pi, ki = A[i]
for j in range(i+1, K):
dj, pj, kj = A[j]
... | output | 1 | 84,156 | 3 | 168,313 |
Provide a correct Python 3 solution for this coding contest problem.
A straight tunnel without branches is crowded with busy ants coming and going. Some ants walk left to right and others right to left. All ants walk at a constant speed of 1 cm/s. When two ants meet, they try to pass each other. However, some sections... | instruction | 0 | 84,157 | 3 | 168,314 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [i... | output | 1 | 84,157 | 3 | 168,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,460 | 3 | 168,920 |
Tags: brute force, data structures, dp
Correct Solution:
```
from copy import deepcopy
MOD = int(10**9 + 7)
for _ in range(int(input())):
n, k = map(int, input().split())
if k == 1:
print(1)
continue
elif n == 1:
print(2)
continue
ans = n+1
dire = -1
a... | output | 1 | 84,460 | 3 | 168,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,461 | 3 | 168,922 |
Tags: brute force, data structures, dp
Correct Solution:
```
for _ in range(int(input())):
n,k=map(int,input().split())
MOD=1000000007
dp=[[0 for x in range(1010)] for y in range(1010)]
for l in range(k+1):
for m in range(n+1):
if l==1:
dp[l][m]=1
elif m==... | output | 1 | 84,461 | 3 | 168,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,462 | 3 | 168,924 |
Tags: brute force, data structures, dp
Correct Solution:
```
t = int(input())
#mat = [[0 for _ in range(1001)] for _ in range(1001)]
#
#for i in range(1, 1001):
# mat[i][0] = 1
#
#pref_ls = [0 for _ in range(1001)]
#
#for i in range(1, 1001):
# new_pref_ls = [1]
# for j in range(1, 1001):
# mat[i][j] =... | output | 1 | 84,462 | 3 | 168,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,463 | 3 | 168,926 |
Tags: brute force, data structures, dp
Correct Solution:
```
#!/usr/bin/env python3
# created : 2021
from sys import stdin
MOD = int(1e9+7)
def solve(tc):
n, k = map(int, stdin.readline().split())
if n == 1:
if k == 1:
print(1)
else:
print(2)
return
mem ... | output | 1 | 84,463 | 3 | 168,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,464 | 3 | 168,928 |
Tags: brute force, data structures, dp
Correct Solution:
```
# SHRi GANESHA author: Kunal Verma #
import os
import sys
from bisect import bisect_right
from collections import Counter, deque, defaultdict
from io import BytesIO, IOBase
from math import gcd, inf, sqrt, ceil, radians, cos, sin
def lcm(a, b):
return ... | output | 1 | 84,464 | 3 | 168,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,465 | 3 | 168,930 |
Tags: brute force, data structures, dp
Correct Solution:
```
from __future__ import division, print_function
import math
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writa... | output | 1 | 84,465 | 3 | 168,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,466 | 3 | 168,932 |
Tags: brute force, data structures, dp
Correct Solution:
```
mod=10**9+7
cas=int(input())
while cas:
cas-=1;
n,k=map(int,input().split())
dp=[1 for i in range(n)];
ans=1
for i in range(k-1):
tmp=0
for j in range(n):
ans=(ans+dp[j])%mod
if(i%2==0):
for ... | output | 1 | 84,466 | 3 | 168,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, every plane produces an identical copy of the par... | instruction | 0 | 84,467 | 3 | 168,934 |
Tags: brute force, data structures, dp
Correct Solution:
```
import sys
input = sys.stdin.readline
mod=10**9+7
t=int(input())
for tests in range(t):
n,k=map(int,input().split())
if k==1:
print(1)
continue
if n==1:
print(2)
continue
ANS=1
DP=[1]*n
for i in rang... | output | 1 | 84,467 | 3 | 168,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,468 | 3 | 168,936 |
Yes | output | 1 | 84,468 | 3 | 168,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,469 | 3 | 168,938 |
Yes | output | 1 | 84,469 | 3 | 168,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,470 | 3 | 168,940 |
Yes | output | 1 | 84,470 | 3 | 168,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,471 | 3 | 168,942 |
Yes | output | 1 | 84,471 | 3 | 168,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,472 | 3 | 168,944 |
No | output | 1 | 84,472 | 3 | 168,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,473 | 3 | 168,946 |
No | output | 1 | 84,473 | 3 | 168,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,474 | 3 | 168,948 |
No | output | 1 | 84,474 | 3 | 168,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes.
A particle can pass through a plane directly, however, ev... | instruction | 0 | 84,475 | 3 | 168,950 |
No | output | 1 | 84,475 | 3 | 168,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has nothing to do with Little Chris. It is about hill climbers instead (and Chris definitely isn't one).
There are n hills arranged on a line, each in the form of a vertical line s... | instruction | 0 | 84,551 | 3 | 169,102 |
No | output | 1 | 84,551 | 3 | 169,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has nothing to do with Little Chris. It is about hill climbers instead (and Chris definitely isn't one).
There are n hills arranged on a line, each in the form of a vertical line s... | instruction | 0 | 84,552 | 3 | 169,104 |
No | output | 1 | 84,552 | 3 | 169,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has nothing to do with Little Chris. It is about hill climbers instead (and Chris definitely isn't one).
There are n hills arranged on a line, each in the form of a vertical line s... | instruction | 0 | 84,553 | 3 | 169,106 |
No | output | 1 | 84,553 | 3 | 169,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem has nothing to do with Little Chris. It is about hill climbers instead (and Chris definitely isn't one).
There are n hills arranged on a line, each in the form of a vertical line s... | instruction | 0 | 84,554 | 3 | 169,108 |
No | output | 1 | 84,554 | 3 | 169,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Optimizing the amount of data transmitted via a network is an important and interesting part of developing any network application.
<image>
In one secret game developed deep in the ZeptoLab co... | instruction | 0 | 84,575 | 3 | 169,150 |
No | output | 1 | 84,575 | 3 | 169,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Optimizing the amount of data transmitted via a network is an important and interesting part of developing any network application.
<image>
In one secret game developed deep in the ZeptoLab co... | instruction | 0 | 84,576 | 3 | 169,152 |
No | output | 1 | 84,576 | 3 | 169,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Optimizing the amount of data transmitted via a network is an important and interesting part of developing any network application.
<image>
In one secret game developed deep in the ZeptoLab co... | instruction | 0 | 84,577 | 3 | 169,154 |
No | output | 1 | 84,577 | 3 | 169,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Optimizing the amount of data transmitted via a network is an important and interesting part of developing any network application.
<image>
In one secret game developed deep in the ZeptoLab co... | instruction | 0 | 84,578 | 3 | 169,156 |
No | output | 1 | 84,578 | 3 | 169,157 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who watched the neighbourhood day and night.
In c... | instruction | 0 | 84,614 | 3 | 169,228 |
Tags: data structures
Correct Solution:
```
#!/usr/bin/env python
def main():
n = int(input())
hill = tuple(map(int, input().split()))
pairs = 0
highest, at = max((h, k) for k, h in enumerate(hill))
last = highest
count = 0
previous = list()
push = previous.append
pop = previous... | output | 1 | 84,614 | 3 | 169,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,619 | 3 | 169,238 |
Yes | output | 1 | 84,619 | 3 | 169,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,620 | 3 | 169,240 |
Yes | output | 1 | 84,620 | 3 | 169,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,621 | 3 | 169,242 |
Yes | output | 1 | 84,621 | 3 | 169,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,622 | 3 | 169,244 |
Yes | output | 1 | 84,622 | 3 | 169,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,623 | 3 | 169,246 |
No | output | 1 | 84,623 | 3 | 169,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,624 | 3 | 169,248 |
No | output | 1 | 84,624 | 3 | 169,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,625 | 3 | 169,250 |
No | output | 1 | 84,625 | 3 | 169,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital was surrounded by n hills, forming a circle. On each hill there was a watchman, who... | instruction | 0 | 84,626 | 3 | 169,252 |
No | output | 1 | 84,626 | 3 | 169,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Developer Petr thinks that he invented a perpetual motion machine. Namely, he has a lot of elements, which work in the following way.
Each element has one controller that can be set to any non-... | instruction | 0 | 84,710 | 3 | 169,420 |
No | output | 1 | 84,710 | 3 | 169,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Developer Petr thinks that he invented a perpetual motion machine. Namely, he has a lot of elements, which work in the following way.
Each element has one controller that can be set to any non-... | instruction | 0 | 84,711 | 3 | 169,422 |
No | output | 1 | 84,711 | 3 | 169,423 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.