message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 276 109k | cluster float64 23 23 | __index_level_0__ int64 552 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Problem B Parallel Lines
Given an even number of distinct planar points, consider coupling all of the points into pairs. All the possible couplings are to be considered as long as all the given points are coupled to one and only one other point.
Wh... | instruction | 0 | 74,893 | 23 | 149,786 |
"Correct Solution:
```
#!/usr/bin/python3
from fractions import Fraction
import os
import sys
def main():
M = read_int()
A = [Vec(*read_ints()) for _ in range(M)]
print(solve(M, A))
def solve(M, A):
D = [[None] * M for _ in range(M)]
last_did = 0
did_map = {}
for i in range(M):
... | output | 1 | 74,893 | 23 | 149,787 |
Provide a correct Python 3 solution for this coding contest problem.
Problem B Parallel Lines
Given an even number of distinct planar points, consider coupling all of the points into pairs. All the possible couplings are to be considered as long as all the given points are coupled to one and only one other point.
Wh... | instruction | 0 | 74,894 | 23 | 149,788 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return li... | output | 1 | 74,894 | 23 | 149,789 |
Provide a correct Python 3 solution for this coding contest problem.
Problem B Parallel Lines
Given an even number of distinct planar points, consider coupling all of the points into pairs. All the possible couplings are to be considered as long as all the given points are coupled to one and only one other point.
Wh... | instruction | 0 | 74,895 | 23 | 149,790 |
"Correct Solution:
```
from fractions import gcd
m = int(input())
P = [list(map(int, input().split())) for _ in range(m)]
tmp = {}
for i, pi in enumerate(P):
for j, pj in enumerate(P):
if i == j:
break
x = pi[0] - pj[0]
y = pi[1] - pj[1]
k = (x / gcd(x, y), y / gcd(x, y))... | output | 1 | 74,895 | 23 | 149,791 |
Provide a correct Python 3 solution for this coding contest problem.
E-Election campaign
Problem Statement
You are a supporter of Mr. X, a candidate for the next election. Mr. X is planning a street speech in front of the station and intends to give a speech in a place that can be seen by as many voters as possible.... | instruction | 0 | 74,917 | 23 | 149,834 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def cross3(p0, p1, q0):
return (p1[0] - p0[0])*(q0[1] - p0[1]) - (p1[1] - p0[1])*(q0[0] - p0[0])
def cross_point(p0, p1, q0, q1):
x0, y0 = p0; x1, y1 = p1
x2, y2 = q0; x3, y3 = q1
dx0 = x1 - x0
dy0 = y1 - y0
... | output | 1 | 74,917 | 23 | 149,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,207 | 23 | 150,414 |
Tags: implementation
Correct Solution:
```
for i in range(int(input())):
n, m = map(int, input().split())
a = []
for _ in range(n):
a.append([[int(x) for x in input().split()] for _ in range(2)])
can = False
for _ in range(n):
can |= a[_][0][1] == a[_][1][0]
can &= m % 2 == 0
... | output | 1 | 75,207 | 23 | 150,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,208 | 23 | 150,416 |
Tags: implementation
Correct Solution:
```
from sys import stdin,stdout
from math import ceil
st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")
mod=1000000007
d... | output | 1 | 75,208 | 23 | 150,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,209 | 23 | 150,418 |
Tags: implementation
Correct Solution:
```
import sys
from collections import defaultdict
input=sys.stdin.readline
for _ in range(int(input())):
n,m=map(int,input().split())
lis=[]
for i in range(n):
lis.append([])
for j in range(2):
lis[-1].append(list(map(int,input().split()))... | output | 1 | 75,209 | 23 | 150,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,210 | 23 | 150,420 |
Tags: implementation
Correct Solution:
```
for _ in range(int(input())):
n, m = map(int,input().split())
flag = 0
for j in range(n):
a = list(map(int,input().split()))
b = list(map(int,input().split()))
if a[1]==b[0]:
flag = 1
continue
if flag == 1 and m%2... | output | 1 | 75,210 | 23 | 150,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,211 | 23 | 150,422 |
Tags: implementation
Correct Solution:
```
for _ in range(int(input())):
n,m=map(int,input().split())
if m%2==1:
for v in range(n):
a,b=map(int,input().split())
c,d=map(int,input().split())
print('NO')
continue
flag=0
for v in range(n):
a,b=map... | output | 1 | 75,211 | 23 | 150,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,212 | 23 | 150,424 |
Tags: implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().rstrip().split())
inl = lambda: list(map(int, input().split()))
out = lambda x, s='\n': print(s.join(map(str, x)))
t = ini()
for _ in range(... | output | 1 | 75,212 | 23 | 150,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,213 | 23 | 150,426 |
Tags: implementation
Correct Solution:
```
t=int(input())
while t:
n,m=map(int,input().split())
if m%2==0:
val=0
else:
val=1
ans='NO'
while n>0:
n-=1
a,b=map(int,input().split())
c,d=map(int,input().split())
if val==0:
if c==b:
ans='YES'
print(ans)... | output | 1 | 75,213 | 23 | 150,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m consisting of the given tiles. This square also ha... | instruction | 0 | 75,214 | 23 | 150,428 |
Tags: implementation
Correct Solution:
```
tt = int(input())
while (tt):
flag1 = False
flag2 = False
n,m = [int(i) for i in input().split()]
bs = []
cs = []
for i in range(n):
a, b = [int(i) for i in input().split()]
bs.append(b)
c,d = [int(i) for i in input().split()]
... | output | 1 | 75,214 | 23 | 150,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,215 | 23 | 150,430 |
Yes | output | 1 | 75,215 | 23 | 150,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,216 | 23 | 150,432 |
Yes | output | 1 | 75,216 | 23 | 150,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,217 | 23 | 150,434 |
Yes | output | 1 | 75,217 | 23 | 150,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,218 | 23 | 150,436 |
Yes | output | 1 | 75,218 | 23 | 150,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,219 | 23 | 150,438 |
No | output | 1 | 75,219 | 23 | 150,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,220 | 23 | 150,440 |
No | output | 1 | 75,220 | 23 | 150,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,221 | 23 | 150,442 |
No | output | 1 | 75,221 | 23 | 150,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha has n types of tiles of size 2 × 2. Each cell of the tile contains one integer. Masha has an infinite number of tiles of each type.
Masha decides to construct the square of size m × m con... | instruction | 0 | 75,222 | 23 | 150,444 |
No | output | 1 | 75,222 | 23 | 150,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,480 | 23 | 150,960 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
def f(x, y, n): return x + y if y == 0 or x == n else 4 * n - x - y
n, x1, y1, x2, y2 = map(int, input().split())
d = abs(f(x1, y1, n) - f(x2, y2, n))
print(min(d, 4 * n - d))
``` | output | 1 | 75,480 | 23 | 150,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,481 | 23 | 150,962 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n,x1,y1,x2,y2 = map(int,input().split())
d = {}
if x1 == 0:
d[(x1,y1)] = 1
if x1 == n:
d[(x1,y1)] = -1
if x2 == 0:
d[(x2,y2)] = 1
if x2 == n:
d[(x2,y2)] = -1
if y1 == 0:
d[(x1,y1)] = 2
if y1 == n:
d[(x1,y1)] = -2
if y2 == 0:
d[(x2,y2)] = 2
if ... | output | 1 | 75,481 | 23 | 150,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,482 | 23 | 150,964 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
def check(n, x, y):
if x == 0:
return y
if y == n:
return x + n
if x == n:
return 3 * n - y
return 4 * n - x
def earth(n, x1, y1, x2, y2):
r1, r2 = check(n, x1, y1), check(n, x2, y2)
result = abs(r1 - r... | output | 1 | 75,482 | 23 | 150,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,483 | 23 | 150,966 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n,x1,y1,x2,y2 = [int(i) for i in input().split()]
if x1 == 0 and x2==0 or x1 == n and x2 == n :
print(abs(y2-y1))
exit()
elif y2==0 and y1==0 or y2 == n and y1 == n:
print(abs(x2-x1))
exit()
elif x1 == 0 and x2 == n or x2 == 0 and x1 ==... | output | 1 | 75,483 | 23 | 150,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,484 | 23 | 150,968 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
def dis(x,y,d):
if y==0 or x==d:
return x+y
else:
return 4*d - x - y
d,x1,y1,x2,y2 = map(int, input().split())
a = abs(dis(x1,y1,d) - dis(x2,y2,d))
print(min(a, 4*d-a))
``` | output | 1 | 75,484 | 23 | 150,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,485 | 23 | 150,970 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n,x1,y1,x2,y2=map(int,input().split())
d=abs(x1-x2)+abs(y1-y2)
if abs(x1-x2)==n:
d=min(n+y1+y2,3*n-y1-y2)
if abs(y1-y2)==n:
d=min(n+x1+x2,3*n-x1-x2)
print(d)
``` | output | 1 | 75,485 | 23 | 150,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,486 | 23 | 150,972 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
from sys import setrecursionlimit
setrecursionlimit(1000000)
n,a,b,c,d=map(int,input().split())
dx=[0,0,-1,1]
dy=[1,-1,0,0]
vis=[[0]*(n+1) for _ in " "*(n+1)]
ok=[[1]*(n+1)]
for i in range(n-1):
ok.append([1]+[0]*(n-1)+[1])
ok.append([1]*(n+1))
def... | output | 1 | 75,486 | 23 | 150,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a... | instruction | 0 | 75,487 | 23 | 150,974 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n,x,y,a,b=map(int,input().split())
#points on adjacent sides
u=abs(x-a)+abs(y-b)
#points on opposite sides
if abs(x-a)==n:
u=min(n+y+b,3*n-(y+b))
if abs(y-b)==n:
u=min(n+a+x,3*n-(a+x))
print(u)
``` | output | 1 | 75,487 | 23 | 150,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything ... | instruction | 0 | 75,489 | 23 | 150,978 |
Yes | output | 1 | 75,489 | 23 | 150,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything ... | instruction | 0 | 75,491 | 23 | 150,982 |
Yes | output | 1 | 75,491 | 23 | 150,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything ... | instruction | 0 | 75,492 | 23 | 150,984 |
No | output | 1 | 75,492 | 23 | 150,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything ... | instruction | 0 | 75,493 | 23 | 150,986 |
No | output | 1 | 75,493 | 23 | 150,987 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,858 | 23 | 151,716 |
"Correct Solution:
```
import math
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def projection(p0,p1,p2):
a=p1-p0
b=p2-p0
pro = a * dot(a, b) / (abs(a) ** 2)
t=p0+pro
return t
def get_cross_point(p0,p1,p2):
pro=projection(p0,p1,p2)
e =(p1-p0)/abs(p1-p0)
base = (r**2 - abs(pro-p2)**2)**0.... | output | 1 | 75,858 | 23 | 151,717 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,859 | 23 | 151,718 |
"Correct Solution:
```
from sys import stdin
import math
class Vector:
def __init__(self, x=None, y=None):
self.x = x
self.y = y
def __add__(self, other):
return Vector(self.x + other.x, self.y + other.y)
def __sub__(self, other):
return Vector(self.x - other.x, self.y - o... | output | 1 | 75,859 | 23 | 151,719 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,860 | 23 | 151,720 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
EPS = 0.0000000001
COUNTER_CLOCKWISE = 1
CLOCKWISE = -1
ONLINE_BACK = 2
ONLINE_FRONT = -2
ON_SEGMENT = 0
class Point:
global EPS
def __init__(self, x = 0, y = 0):
s... | output | 1 | 75,860 | 23 | 151,721 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,861 | 23 | 151,722 |
"Correct Solution:
```
#! /usr/bin/env python3
from typing import List, Tuple
from math import sqrt
from enum import IntEnum
EPS = 1e-10
def float_equal(x: float, y: float) -> bool:
return abs(x - y) < EPS
class PointLocation(IntEnum):
COUNTER_CLOCKWISE = 1
CCW = 1
CLOCKWISE = -1
CW = -1
O... | output | 1 | 75,861 | 23 | 151,723 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,862 | 23 | 151,724 |
"Correct Solution:
```
from functools import singledispatch
import math
EPS = 1e-10
COUNTER_CLOCKWISE = 1
CLOCKWISE = -1
ONLINE_BACK = 2
ONLINE_FRONT = -2
ON_SEGMENT = 0
class Segment():
def __init__(self, p1, p2):
self.p1 = p1
self.p2 = p2
class Circle():
def __init__(self, c, r):
s... | output | 1 | 75,862 | 23 | 151,725 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,863 | 23 | 151,726 |
"Correct Solution:
```
import math
EPS = 10**(-9)
def is_equal(a,b):
return abs(a-b) < EPS
def norm(v,i=2):
ret = 0
n = len(v)
for j in range(n):
ret += abs(v[j])**i
return math.pow(ret,1/i)
class Vector(list):
"""
ベクトルクラス
対応演算子
+ : ベクトル和
- : ベクトル差
* : スカラー倍、または... | output | 1 | 75,863 | 23 | 151,727 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,864 | 23 | 151,728 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10 ** 9)
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
INF=float('inf')
class Geometry:
EPS = 10 ** -9
... | output | 1 | 75,864 | 23 | 151,729 |
Provide a correct Python 3 solution for this coding contest problem.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \leq q \leq 1,000$
* $-10,000 \leq cx, cy, x1, y1, x2, y2 \... | instruction | 0 | 75,865 | 23 | 151,730 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D
"""
import sys
from math import sqrt
from sys import stdin
input = stdin.readline
class Point(object):
epsilon = 1e-10
def __init__(self, x=0.0, y=0.0):
if isinstance(x, tuple):
... | output | 1 | 75,865 | 23 | 151,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,866 | 23 | 151,732 |
Yes | output | 1 | 75,866 | 23 | 151,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,867 | 23 | 151,734 |
Yes | output | 1 | 75,867 | 23 | 151,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,868 | 23 | 151,736 |
Yes | output | 1 | 75,868 | 23 | 151,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,869 | 23 | 151,738 |
Yes | output | 1 | 75,869 | 23 | 151,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,870 | 23 | 151,740 |
No | output | 1 | 75,870 | 23 | 151,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,871 | 23 | 151,742 |
No | output | 1 | 75,871 | 23 | 151,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,872 | 23 | 151,744 |
No | output | 1 | 75,872 | 23 | 151,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For given a circle $c$ and a line $l$, print the coordinates of the cross points of them.
Constraints
* $p1$ and $p2$ are different
* The circle and line have at least one cross point
* $1 \le... | instruction | 0 | 75,873 | 23 | 151,746 |
No | output | 1 | 75,873 | 23 | 151,747 |
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
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,961 | 23 | 151,922 |
Yes | output | 1 | 75,961 | 23 | 151,923 |
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
You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing ... | instruction | 0 | 75,962 | 23 | 151,924 |
Yes | output | 1 | 75,962 | 23 | 151,925 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.