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.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards"... | instruction | 0 | 106,414 | 3 | 212,828 |
Tags: math
Correct Solution:
```
sa=int(input())
mod=10**9+7
if sa==0:
print(1)
else:
print((pow(2, 2*sa-1, mod)+pow(2, sa-1, mod))%mod)
``` | output | 1 | 106,414 | 3 | 212,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards"... | instruction | 0 | 106,415 | 3 | 212,830 |
Tags: math
Correct Solution:
```
n,m=int(input()),1000000007
n=pow(2,n,m)
print((((n%m)*((n+1)%m))//2)%m)
``` | output | 1 | 106,415 | 3 | 212,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards"... | instruction | 0 | 106,416 | 3 | 212,832 |
Tags: math
Correct Solution:
```
def cal_pow(a, b):
if b == 0: return 1
res = cal_pow(a, b // 2)
res = res * res % 1000000007
if b % 2 == 1:
res = (res * a) % 1000000007
return res
n = int(input())
res = cal_pow(2, n)
print(((res * (res + 1) // 2)) % 1000000007)
``` | output | 1 | 106,416 | 3 | 212,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards"... | instruction | 0 | 106,417 | 3 | 212,834 |
Tags: math
Correct Solution:
```
n = pow(2, int(input()), int(1e9 + 7))
print(((n + 1) // 2 * n + (n // 2, 0)[n % 2]) % int(1e9 + 7))
``` | output | 1 | 106,417 | 3 | 212,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards"... | instruction | 0 | 106,418 | 3 | 212,836 |
Tags: math
Correct Solution:
```
import math
MOD = 1000000007
def mod_inverse(b,m):
g = math.gcd(b, m)
if (g != 1):
return -1
else:
return pow(b, m - 2, m)
def div_mod(a,b,m):
a = a % m
inv = mod_inverse(b,m)
if(inv == -1):
return None
else:
re... | output | 1 | 106,418 | 3 | 212,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards"... | instruction | 0 | 106,419 | 3 | 212,838 |
Tags: math
Correct Solution:
```
def fstexp(x,y):
if (y<=1):
return x**y%1000000007
if (y%2==1):
return ((((fstexp(x,y//2)%1000000007)**2)%1000000007)*(x%1000000007))%1000000007
return (((fstexp(x,y//2)%1000000007)**2)%1000000007)
x=int(input())
x=fstexp(2,x)
x=x%1000000007
print(int((((x**2... | output | 1 | 106,419 | 3 | 212,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,420 | 3 | 212,840 |
Yes | output | 1 | 106,420 | 3 | 212,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,421 | 3 | 212,842 |
Yes | output | 1 | 106,421 | 3 | 212,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,422 | 3 | 212,844 |
Yes | output | 1 | 106,422 | 3 | 212,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,423 | 3 | 212,846 |
Yes | output | 1 | 106,423 | 3 | 212,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,424 | 3 | 212,848 |
No | output | 1 | 106,424 | 3 | 212,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,425 | 3 | 212,850 |
No | output | 1 | 106,425 | 3 | 212,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,426 | 3 | 212,852 |
No | output | 1 | 106,426 | 3 | 212,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four tria... | instruction | 0 | 106,427 | 3 | 212,854 |
No | output | 1 | 106,427 | 3 | 212,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,574 | 3 | 213,148 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
n,x,y = map(int, input().split())
a = []
for i in range(n):
x1, y1, = map(int, input().split())
a.append((x1,y1))
d = set()
for p, q in a:
x2, y2 = p-x, q-y
found = False
for x1, y1 in d:
if x1*y2 == x2*... | output | 1 | 106,574 | 3 | 213,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,575 | 3 | 213,150 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
def calc_slope(p1, p2):
dy = p2[1] - p1[1]
dx = p2[0] - p1[0]
if dx == 0:
return "vertical"
#if dy > 0:
# return "+y"
#else:
# return "-y"
#if dy == 0:
# if dx > 0:
# return "+x"
# else:
# return "-x"
return dy... | output | 1 | 106,575 | 3 | 213,151 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,576 | 3 | 213,152 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
n, x1, y1 = [int(s) for s in input().split()]
slope = {}
shoot=0
for i in range(n):
x2,y2=[int(s) for s in input().split()]
if(x2-x1)==0:
m="a"
else:
m = (y2-y1)/(x2-x1)
if m not in slope:
... | output | 1 | 106,576 | 3 | 213,153 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,577 | 3 | 213,154 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
from math import *
n,gx,gy = map(int,input().split())
pts = [tuple(map(int,input().split())) for _ in range(n)]
vis = [1]*n
def ccw(g,p,q):
return (p[0]-g[0])*(q[1]-g[1])-(p[1]-g[1])*(q[0]-g[0])
for i in range(n):
if vis[i]:
... | output | 1 | 106,577 | 3 | 213,155 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,578 | 3 | 213,156 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
read = lambda : list(map(int, input().split()))
params = read()
n, x, y = params[0], params[1], params[2]
slopes = set()
for i in range(n):
point = read()
diffx = (point[0] - x)
diffy = (point[1] - y)
... | output | 1 | 106,578 | 3 | 213,157 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,579 | 3 | 213,158 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
a,b,c=map(int,input().split())
l=set()
for __ in range(a):
x,y=map(int,input().split())
if b-x==0:
z=100001
else:
z=(c-y)/(b-x)
l.add(z)
print(len(l))
``` | output | 1 | 106,579 | 3 | 213,159 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,580 | 3 | 213,160 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
n,x,y=map(int,input().split())
d={}
for i in range(n):
a,b=map(int,input().split())
if y-b==0:
d['i']=0
else:
d[(x-a)/(y-b)]=0
print(len(d.keys()))
``` | output | 1 | 106,580 | 3 | 213,161 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight the... | instruction | 0 | 106,581 | 3 | 213,162 |
Tags: brute force, data structures, geometry, implementation, math
Correct Solution:
```
n,x0,y0=map(int,input().split())
d={}
for i in range(n):
x,y=map(int,input().split())
d[(x,y)]=1
ans=0
for i in d:
if d[i]==1:
x1=i[0]
y1=i[1]
if y0-y1==0:
m1=float('inf')
els... | output | 1 | 106,581 | 3 | 213,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,582 | 3 | 213,164 |
Yes | output | 1 | 106,582 | 3 | 213,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,583 | 3 | 213,166 |
Yes | output | 1 | 106,583 | 3 | 213,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,584 | 3 | 213,168 |
Yes | output | 1 | 106,584 | 3 | 213,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,585 | 3 | 213,170 |
Yes | output | 1 | 106,585 | 3 | 213,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,586 | 3 | 213,172 |
No | output | 1 | 106,586 | 3 | 213,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,587 | 3 | 213,174 |
No | output | 1 | 106,587 | 3 | 213,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,588 | 3 | 213,176 |
No | output | 1 | 106,588 | 3 | 213,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han So... | instruction | 0 | 106,589 | 3 | 213,178 |
No | output | 1 | 106,589 | 3 | 213,179 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,897 | 3 | 213,794 |
"Correct Solution:
```
import math
temp=input().split()
N=int(temp[0])
L=int(temp[1])
T=int(temp[2])
XW=[[int(j) for j in input().split()] for i in range(N)]
count=0
for i in range(N):
if XW[i][1]==1:
XW[i][0]+=T
else:
XW[i][0]-=T
count+=math.floor(XW[i][0]/L)
#
# if XW[0][1]==1:
# for i in range(1,N):
# if X... | output | 1 | 106,897 | 3 | 213,795 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,898 | 3 | 213,796 |
"Correct Solution:
```
import math
temp=input().split()
N=int(temp[0])
L=int(temp[1])
T=int(temp[2])
XW=[[int(j) for j in input().split()] for i in range(N)]
count=0
for i in range(N):
if XW[i][1]==1:
XW[i][0]+=T
else:
XW[i][0]-=T
count+=math.floor(XW[i][0]/L)
newX=[]
for i in range(N):
newX.append(XW[i][0]%L)
... | output | 1 | 106,898 | 3 | 213,797 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,899 | 3 | 213,798 |
"Correct Solution:
```
# C
N, L, T = map(int, input().split())
X = list()
W = list()
positions = list()
for _ in range(N):
x, w = map(int, input().split())
X.append(x)
W.append(w)
if w == 1:
positions.append((x + T) % L)
else:
positions.append((x - T) % L)
# find which is the positi... | output | 1 | 106,899 | 3 | 213,799 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,900 | 3 | 213,800 |
"Correct Solution:
```
import bisect
n, l, t = map(int, input().split())
plots = []
plots_after = []
for i in range(n):
x, w = map(int, input().split())
plots.append((x, w, i))
if w == 1:
plots_after.append((x+t) % l)
else:
plots_after.append((x-t) % l)
x0, w0, _ = plots[0]
if w0 ... | output | 1 | 106,900 | 3 | 213,801 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,901 | 3 | 213,802 |
"Correct Solution:
```
import sys
def input(): return sys.stdin.readline()
def inpl(): return [int(i) for i in input().split()]
N, L, T = inpl()
Ant = []
ctr = 0
for _ in range(N):
X, W = inpl()
Ant.append((X + T*(3-2*W))%L)
ctr += (X + T*(3-2*W))//L
Ant.sort()
ctr %= N
ans = Ant[ctr:] + Ant[:ctr]
for i in... | output | 1 | 106,901 | 3 | 213,803 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,902 | 3 | 213,804 |
"Correct Solution:
```
from collections import deque
n, l, t = map(int, input().split())
ants = [list(map(int, input().split())) for i in range(n)]
# print(ants)
ants_t = []
count = 0
for ant in ants:
ant_t = ant
if ant[1] == 1:
c, ant_t[0] = divmod(t + ant[0], l)
# count += c
else:
... | output | 1 | 106,902 | 3 | 213,805 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,903 | 3 | 213,806 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
n, l, t = map(int, input().split())
XW = [list(map(int, input().split())) for _ in range(n)]
L = []
cnt = 0
for i, xw in enumerate(XW):
x, w = xw
L.append((x+t*(3-2*w))%l)
cnt += (x+t*(3-2*w))//l
L.sort()
for i in range(cnt, cnt+n):
print(L[i%n])
``` | output | 1 | 106,903 | 3 | 213,807 |
Provide a correct Python 3 solution for this coding contest problem.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On this circumference, there are N ants. These ants are number... | instruction | 0 | 106,904 | 3 | 213,808 |
"Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
N, L, T= map(int,input().split())
X = []
W = []
for i in range(N):
x,w = map(int,input().split())
X.append(2*x)
W.append(2*(1-w)+1)
pos = [((x+2*T*w) % (2*L))//2 for x,w in zip(X,W)]
meet = 0
for i in range(1,N):
if W[0] != W[i]:
... | output | 1 | 106,904 | 3 | 213,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,905 | 3 | 213,810 |
Yes | output | 1 | 106,905 | 3 | 213,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,906 | 3 | 213,812 |
Yes | output | 1 | 106,906 | 3 | 213,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,907 | 3 | 213,814 |
Yes | output | 1 | 106,907 | 3 | 213,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,908 | 3 | 213,816 |
Yes | output | 1 | 106,908 | 3 | 213,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,909 | 3 | 213,818 |
No | output | 1 | 106,909 | 3 | 213,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,910 | 3 | 213,820 |
No | output | 1 | 106,910 | 3 | 213,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,911 | 3 | 213,822 |
No | output | 1 | 106,911 | 3 | 213,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a circle with a circumference of L. Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point. On thi... | instruction | 0 | 106,912 | 3 | 213,824 |
No | output | 1 | 106,912 | 3 | 213,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After the war, the supersonic rocket became the most common public transportation.
Each supersonic rocket consists of two "engines". Each engine is a set of "power sources". The first engine has n power sources, and the second one has m pow... | instruction | 0 | 107,026 | 3 | 214,052 |
Tags: geometry, hashing, strings
Correct Solution:
```
import sys
# > 0 anti-clock, < 0 clockwise, == 0 same line
def orientation(p1, p2, p3):
return (p2[0] - p1[0])*(p3[1] - p1[1]) - (p2[1] - p1[1])*(p3[0] - p1[0])
def dot(p1, p2, p3, p4):
return (p2[0]-p1[0])*(p4[0]-p3[0]) + (p2[1]-p1[1])*(p4[1]-p3[1])
... | output | 1 | 107,026 | 3 | 214,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After the war, the supersonic rocket became the most common public transportation.
Each supersonic rocket consists of two "engines". Each engine is a set of "power sources". The first engine ha... | instruction | 0 | 107,027 | 3 | 214,054 |
No | output | 1 | 107,027 | 3 | 214,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After the war, the supersonic rocket became the most common public transportation.
Each supersonic rocket consists of two "engines". Each engine is a set of "power sources". The first engine ha... | instruction | 0 | 107,028 | 3 | 214,056 |
No | output | 1 | 107,028 | 3 | 214,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After the war, the supersonic rocket became the most common public transportation.
Each supersonic rocket consists of two "engines". Each engine is a set of "power sources". The first engine ha... | instruction | 0 | 107,029 | 3 | 214,058 |
No | output | 1 | 107,029 | 3 | 214,059 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.