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.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. Each country has a dominant religion. There are... | instruction | 0 | 97,993 | 3 | 195,986 |
Tags: implementation, math
Correct Solution:
```
import sys
# inf = open('input.txt', 'r')
# reader = (line.rstrip() for line in inf)
reader = (line.rstrip() for line in sys.stdin)
n = int(next(reader))
for _ in range(n):
r, c = [int(x) for x in next(reader).split()]
turns = float('inf')
cols = [[] for j... | output | 1 | 97,993 | 3 | 195,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 97,994 | 3 | 195,988 |
Yes | output | 1 | 97,994 | 3 | 195,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 97,995 | 3 | 195,990 |
Yes | output | 1 | 97,995 | 3 | 195,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 97,996 | 3 | 195,992 |
Yes | output | 1 | 97,996 | 3 | 195,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 97,997 | 3 | 195,994 |
Yes | output | 1 | 97,997 | 3 | 195,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 97,998 | 3 | 195,996 |
No | output | 1 | 97,998 | 3 | 195,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 97,999 | 3 | 195,998 |
No | output | 1 | 97,999 | 3 | 195,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 98,000 | 3 | 196,000 |
No | output | 1 | 98,000 | 3 | 196,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a r × c grid. Each cell on the grid represents a country. ... | instruction | 0 | 98,001 | 3 | 196,002 |
No | output | 1 | 98,001 | 3 | 196,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,010 | 3 | 196,020 |
Yes | output | 1 | 98,010 | 3 | 196,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,011 | 3 | 196,022 |
Yes | output | 1 | 98,011 | 3 | 196,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,012 | 3 | 196,024 |
Yes | output | 1 | 98,012 | 3 | 196,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,013 | 3 | 196,026 |
Yes | output | 1 | 98,013 | 3 | 196,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,014 | 3 | 196,028 |
No | output | 1 | 98,014 | 3 | 196,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,015 | 3 | 196,030 |
No | output | 1 | 98,015 | 3 | 196,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,016 | 3 | 196,032 |
No | output | 1 | 98,016 | 3 | 196,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bashar was practicing for the national programming contest. Because of sitting too much in front of the computer without doing physical movements and eating a lot Bashar became much fatter. Bash... | instruction | 0 | 98,017 | 3 | 196,034 |
No | output | 1 | 98,017 | 3 | 196,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"Eat a beaver, save a tree!" — That will be the motto of ecologists' urgent meeting in Beaverley Hills.
And the whole point is that the population of beavers on the Earth has reached incredible... | instruction | 0 | 98,329 | 3 | 196,658 |
No | output | 1 | 98,329 | 3 | 196,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,330 | 3 | 196,660 |
Tags: dp, implementation
Correct Solution:
```
import sys
from collections import defaultdict
input=sys.stdin.readline
n,q,c=map(int,input().split())
d=defaultdict(lambda:[0]*11)
for _ in range(n):
x,y,s=map(int,input().split())
if (x,y) not in d:
d[(x,y)]=[0]*11
d[(x,y)][s]+=1
g=[[[0]*11 for i in range(101)] for... | output | 1 | 98,330 | 3 | 196,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,331 | 3 | 196,662 |
Tags: dp, implementation
Correct Solution:
```
import sys
input=sys.stdin.readline
n,q,c=map(int,input().split())
g=[[[0]*11 for i in range(101)] for i in range(101)]
for _ in range(n):
x,y,s=map(int,input().split())
g[x][y][s]+=1
for i in range(1,101):
for j in range(1,101):
for k in range(11):
g[i][j][k]+=g[i... | output | 1 | 98,331 | 3 | 196,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,332 | 3 | 196,664 |
Tags: dp, implementation
Correct Solution:
```
n,q,c = map(int,input().split())
sky = [[[0] * 11 for j in range(101)] for i in range(101)]
c += 1
for i in range(n):
x,y,s = map(int,input().split())
sky[y][x][s % c] += 1
for k in range(11):
i = 1
while i < 101:
j = 1
while j < 101:
... | output | 1 | 98,332 | 3 | 196,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,333 | 3 | 196,666 |
Tags: dp, implementation
Correct Solution:
```
"""
Author : Arif Ahmad
Date :
Algo :
Difficulty :
"""
from sys import stdin, stdout
def main():
n, q, c = [int(_) for _ in stdin.readline().strip().split()]
g = [[[0 for i in range(102)] for j in range(102)] for k in range(... | output | 1 | 98,333 | 3 | 196,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,334 | 3 | 196,668 |
Tags: dp, implementation
Correct Solution:
```
def fun(n,q,c,stars,querry):
m=100
precom=[[[0]*m for _ in range(m)] for _ in range(c+1)]
for x,y,p in stars:
for i in range(c+1):
temp=(p+i)%(c+1)
precom[i][x-1][y-1]+=temp
for k in range(c+1):
for i in range(0,m):
... | output | 1 | 98,334 | 3 | 196,669 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,335 | 3 | 196,670 |
Tags: dp, implementation
Correct Solution:
```
###### ### ####### ####### ## # ##### ### #####
# # # # # # # # # # # # # ###
# # # # # # # # # # # # # ###
###### #####... | output | 1 | 98,335 | 3 | 196,671 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,336 | 3 | 196,672 |
Tags: dp, implementation
Correct Solution:
```
import sys
from collections import defaultdict
input=sys.stdin.readline
n,q,c=map(int,input().split())
d=defaultdict(lambda:[0]*11)
for _ in range(n):
x,y,s=map(int,input().split())
if (x,y) not in d:
d[(x,y)]=[0]*11
d[(x,y)][s]+=1
g=[[[0]*11 for i in range(101)] for... | output | 1 | 98,336 | 3 | 196,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment ... | instruction | 0 | 98,337 | 3 | 196,674 |
Tags: dp, implementation
Correct Solution:
```
import sys
from bisect import bisect_left, bisect_right
n, q, c = list(map(int, input().split()))
values = [[[0 for _ in range(11)] for _ in range(0, 101)] for _ in range(0, 101)]
# print(dp)
for i in range(n):
x, y, s = list(map(int, sys.stdin.readline().split()))
... | output | 1 | 98,337 | 3 | 196,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,338 | 3 | 196,676 |
Yes | output | 1 | 98,338 | 3 | 196,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,339 | 3 | 196,678 |
Yes | output | 1 | 98,339 | 3 | 196,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,340 | 3 | 196,680 |
Yes | output | 1 | 98,340 | 3 | 196,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,341 | 3 | 196,682 |
Yes | output | 1 | 98,341 | 3 | 196,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,342 | 3 | 196,684 |
No | output | 1 | 98,342 | 3 | 196,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,343 | 3 | 196,686 |
No | output | 1 | 98,343 | 3 | 196,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,344 | 3 | 196,688 |
No | output | 1 | 98,344 | 3 | 196,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si... | instruction | 0 | 98,345 | 3 | 196,690 |
No | output | 1 | 98,345 | 3 | 196,691 |
Provide a correct Python 3 solution for this coding contest problem.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many enemy tanks and they could not call a rescue herio. So,... | instruction | 0 | 98,529 | 3 | 197,058 |
"Correct Solution:
```
from collections import deque
while 1:
N = int(input())
if N == 0:
break
G = [[] for i in range(N)]
for i in range(N-1):
a, b, t = map(int, input().split())
a -= 1; b -= 1
G[a].append((b, t))
G[b].append((a, t))
D = [-1]*N; P = [0]*N
... | output | 1 | 98,529 | 3 | 197,059 |
Provide a correct Python 3 solution for this coding contest problem.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many enemy tanks and they could not call a rescue herio. So,... | instruction | 0 | 98,530 | 3 | 197,060 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
edges = [[] for _ in range(n)]
for _ in range(n - 1):
a, b, t = map(int, input().split())
a -= 1
b -= 1
edges[a].append([b, t])
edges[b].append([a, t])
used = [False] * n
is_leaf = [False]... | output | 1 | 98,530 | 3 | 197,061 |
Provide a correct Python 3 solution for this coding contest problem.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many enemy tanks and they could not call a rescue herio. So,... | instruction | 0 | 98,531 | 3 | 197,062 |
"Correct Solution:
```
while 1:
N = int(input())
if N == 0:break
R = [[0 for i in range(N+1)] for i in range(N+1)]
def dfs_max(cur, pre):
_max = -R[cur][pre]
for i in range(N+1):
if R[cur][i] > 0 and i != pre:
_max = max(_max, dfs_max(i, cur) + R[cur][i])
... | output | 1 | 98,531 | 3 | 197,063 |
Provide a correct Python 3 solution for this coding contest problem.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many enemy tanks and they could not call a rescue herio. So,... | instruction | 0 | 98,532 | 3 | 197,064 |
"Correct Solution:
```
def tree_walk_1(start, parent=None):
for i, t in adj[start]:
if i != parent:
P[i] = (start, t)
C[start].append((i, t))
tree_walk_1(i, start)
def tree_walk_2(start):
global time
notVisited[start] = False
for c, t1 in C[start]:
if... | output | 1 | 98,532 | 3 | 197,065 |
Provide a correct Python 3 solution for this coding contest problem.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many enemy tanks and they could not call a rescue herio. So,... | instruction | 0 | 98,533 | 3 | 197,066 |
"Correct Solution:
```
def dfs1(v, pv):
for nv, _ in adj_list[v]:
if nv==pv:
continue
is_leaf[v] = False
dfs1(nv, v)
return is_leaf
def dfs2(v, pv, d):
dist[v] = d
for nv, w in adj_list[v]:
if nv==pv:
continue
... | output | 1 | 98,533 | 3 | 197,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many... | instruction | 0 | 98,534 | 3 | 197,068 |
No | output | 1 | 98,534 | 3 | 197,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Under the command "Save Sergeant Ryan," Aiz's rescue team fought fierce battles with enemy forces in the floating city of Lee, Germany. They successfully joined the sergeant, but there were many... | instruction | 0 | 98,535 | 3 | 197,070 |
No | output | 1 | 98,535 | 3 | 197,071 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is produced in a rectangular solid shaped tank whose size i... | instruction | 0 | 98,536 | 3 | 197,072 |
"Correct Solution:
```
# A106633
def f(n):
res=1+2*n
i=1
while i*i<=n:
res+=1+(n-i*i)//i*2
i+=1
return res
while 1:
n=int(input())
if n==0: break
print(8*f(n//2-1)+8*n)
``` | output | 1 | 98,536 | 3 | 197,073 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is produced in a rectangular solid shaped tank whose size i... | instruction | 0 | 98,537 | 3 | 197,074 |
"Correct Solution:
```
while 1:
n=int(input())
if n==0:break
a=0;i=1;b=n//2
while i*i<b:a+=((b-1)//i+1)-i-1;i+=1
a=(a+b-1)*2+i
print(8*(a+n))
``` | output | 1 | 98,537 | 3 | 197,075 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is produced in a rectangular solid shaped tank whose size i... | instruction | 0 | 98,538 | 3 | 197,076 |
"Correct Solution:
```
# AOJ 1026 Hedro's Hexahedron
# Python3 2018.7.5 bal4u
while True:
n = int(input())
if n == 0: break
ans = s = n >> 1
i, k = 1, 2
while i*i < s:
ans += (n+k-1)//k
i += 1
k += 2
ans = ans*2 - i*i
if n & 1: ans += 1
print((ans+n) << 3)
``` | output | 1 | 98,538 | 3 | 197,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is ... | instruction | 0 | 98,539 | 3 | 197,078 |
No | output | 1 | 98,539 | 3 | 197,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is ... | instruction | 0 | 98,540 | 3 | 197,080 |
No | output | 1 | 98,540 | 3 | 197,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is ... | instruction | 0 | 98,541 | 3 | 197,082 |
No | output | 1 | 98,541 | 3 | 197,083 |
Provide a correct Python 3 solution for this coding contest problem.
Two experienced climbers are planning a first-ever attempt: they start at two points of the equal altitudes on a mountain range, move back and forth on a single route keeping their altitudes equal, and finally meet with each other at a point on the r... | instruction | 0 | 98,545 | 3 | 197,090 |
"Correct Solution:
```
from heapq import heappush, heappop
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
N = int(readline())
if N == 0:
return False
P = [tuple(map(int, readline().split())) for i in range(N)]
YS = set(y for x, y in P)
Q = P[:]
for i in ra... | output | 1 | 98,545 | 3 | 197,091 |
Provide a correct Python 3 solution for this coding contest problem.
Wind Corridor is a covered passageway where strong wind is always blowing. It is a long corridor of width W, and there are several pillars in it. Each pillar is a right prism and its face is a polygon (not necessarily convex).
In this problem, we co... | instruction | 0 | 98,547 | 3 | 197,094 |
"Correct Solution:
```
from heapq import heappush, heappop
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def cross2(p, q):
return p[0]*q[1] - p[1]*q[0]
def dot2(p, q):
return p[0]*q[0] + p[1]*q[1]
def dist2(p):
return p[0]**2 + p[1]**2
def segment_line_dist(x, p0, p1):
z0 = (p1[0] - ... | output | 1 | 98,547 | 3 | 197,095 |
Provide a correct Python 3 solution for this coding contest problem.
Wind Corridor is a covered passageway where strong wind is always blowing. It is a long corridor of width W, and there are several pillars in it. Each pillar is a right prism and its face is a polygon (not necessarily convex).
In this problem, we co... | instruction | 0 | 98,548 | 3 | 197,096 |
"Correct Solution:
```
def solve():
from itertools import combinations
from heapq import heappush, heappop
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
# get distance between segment and p... | output | 1 | 98,548 | 3 | 197,097 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.