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.
You a captain of a ship. Initially you are standing in a point (x_1, y_1) (obviously, all positions in the sea can be described by cartesian plane) and you want to travel to a point (x_2, y_2). ... | instruction | 0 | 10,862 | 3 | 21,724 |
No | output | 1 | 10,862 | 3 | 21,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You, the mighty Blackout, are standing in the upper-left (0,0) corner of NxM matrix. You must move either right or down each second.
There are K transformers jumping around the matrix in the f... | instruction | 0 | 10,871 | 3 | 21,742 |
No | output | 1 | 10,871 | 3 | 21,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You, the mighty Blackout, are standing in the upper-left (0,0) corner of NxM matrix. You must move either right or down each second.
There are K transformers jumping around the matrix in the f... | instruction | 0 | 10,872 | 3 | 21,744 |
No | output | 1 | 10,872 | 3 | 21,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You, the mighty Blackout, are standing in the upper-left (0,0) corner of NxM matrix. You must move either right or down each second.
There are K transformers jumping around the matrix in the f... | instruction | 0 | 10,873 | 3 | 21,746 |
No | output | 1 | 10,873 | 3 | 21,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You, the mighty Blackout, are standing in the upper-left (0,0) corner of NxM matrix. You must move either right or down each second.
There are K transformers jumping around the matrix in the f... | instruction | 0 | 10,874 | 3 | 21,748 |
No | output | 1 | 10,874 | 3 | 21,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you have to implement an algorithm to defragment your hard disk. The hard disk consists of a sequence of clusters, numbered by integers from 1 to n. The disk has m recorded files... | instruction | 0 | 11,033 | 3 | 22,066 |
No | output | 1 | 11,033 | 3 | 22,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you have to implement an algorithm to defragment your hard disk. The hard disk consists of a sequence of clusters, numbered by integers from 1 to n. The disk has m recorded files... | instruction | 0 | 11,034 | 3 | 22,068 |
No | output | 1 | 11,034 | 3 | 22,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you have to implement an algorithm to defragment your hard disk. The hard disk consists of a sequence of clusters, numbered by integers from 1 to n. The disk has m recorded files... | instruction | 0 | 11,035 | 3 | 22,070 |
No | output | 1 | 11,035 | 3 | 22,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you have to implement an algorithm to defragment your hard disk. The hard disk consists of a sequence of clusters, numbered by integers from 1 to n. The disk has m recorded files... | instruction | 0 | 11,036 | 3 | 22,072 |
No | output | 1 | 11,036 | 3 | 22,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,259 | 3 | 22,518 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
n, m, k = map(int,input().split())
dm, dp = {}, {}
vis = {}
sensors = []
border = set()
for el in [(0, m), (n, 0), (0, 0), (n, m)]:
border.add(el)
for _ in range(k):
x, y = map(int, input().split())
if not (x - y) in... | output | 1 | 11,259 | 3 | 22,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,260 | 3 | 22,520 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
f = lambda: map(int, input().split())
n, m, k = f()
w, h = 2 * n, 2 * m
s = [[] for i in range(w + h)]
p = [-1] * k
for i in range(k):
x, y = f()
if x - y & 1: continue
for a in (x, w - x):
for b in (y, h -... | output | 1 | 11,260 | 3 | 22,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,261 | 3 | 22,522 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
__author__ = 'Think'
n, m, k=[int(i) for i in input().split()]
n=2*n
m=2*m
a, b=sorted((m, n))
tracker=[b]
while a>0:
b=(b%a)
tracker.append(a)
a, b=(b, a)
g=b
prod=(m*n)//g
if m!=n:
if len(tracker)>=3:
pair=(1, -(tracke... | output | 1 | 11,261 | 3 | 22,523 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,262 | 3 | 22,524 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
# [https://codeforces.com/contest/724/submission/21299971]
(n, m, k) = map(int, input().split())
n = 2*n
m = 2*m
a = min(m, n)
b = max(m, n)
tracker = [b]
while a>0:
b = b % a
tracker.append(a)
(a, b) = (b, a)
g = ... | output | 1 | 11,262 | 3 | 22,525 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,263 | 3 | 22,526 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
import sys
from fractions import gcd
import math
def euclid_algorithm(a, b):
t1, t2 = abs(a), abs(b)
#saving equalities:
#t1 == x1 * a + y1 * b,
#t2 == x2 * a + y2 * b.
x1, y1, x2, y2 = int(math.copysign(1, ... | output | 1 | 11,263 | 3 | 22,527 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,264 | 3 | 22,528 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
"""
NTC here
"""
import sys
inp = sys.stdin.readline
def input(): return inp().strip()
# flush= sys.stdout.flush
# import threading
# sys.setrecursionlimit(10**6)
# threading.stack_size(2**26)
def iin(): return int(input())
... | output | 1 | 11,264 | 3 | 22,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,265 | 3 | 22,530 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
n, m, k = map(int,input().split())
dm, dp = {}, {}
vis = {}
sensors = []
border = set()
for el in [(0, m), (n, 0), (0, 0), (n, m)]:
border.add(el)
for _ in range(k):
x, y = map(int, input().split())
if not (x - y) in... | output | 1 | 11,265 | 3 | 22,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.
Opposite corners of the room are located at p... | instruction | 0 | 11,266 | 3 | 22,532 |
Tags: greedy, hashing, implementation, math, number theory, sortings
Correct Solution:
```
from sys import *
f = lambda: map(int, stdin.readline().split())
n, m, k = f()
w, h = 2 * n, 2 * m
inf = 1e11
s = [inf] * (w + h)
a = b = t = 0
while 1:
if s[b - a] == inf: s[b - a] = t - a
d = min(w - a, h - b)
t +... | output | 1 | 11,266 | 3 | 22,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle. ... | instruction | 0 | 11,267 | 3 | 22,534 |
Yes | output | 1 | 11,267 | 3 | 22,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle. ... | instruction | 0 | 11,268 | 3 | 22,536 |
Yes | output | 1 | 11,268 | 3 | 22,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle. ... | instruction | 0 | 11,269 | 3 | 22,538 |
No | output | 1 | 11,269 | 3 | 22,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle. ... | instruction | 0 | 11,270 | 3 | 22,540 |
No | output | 1 | 11,270 | 3 | 22,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle. ... | instruction | 0 | 11,271 | 3 | 22,542 |
No | output | 1 | 11,271 | 3 | 22,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle. ... | instruction | 0 | 11,272 | 3 | 22,544 |
No | output | 1 | 11,272 | 3 | 22,545 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,298 | 3 | 22,596 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
rd = lambda: map(int, input().split())
n = int(input())
x1, y1, x2, y2 = rd()
l = []
r = []
m = []
for i in range(n):
t = []
rx, ry, vx, vy = rd()
m.append([rx, ry, vx, vy])
if x1 <= rx <= x2 and y1 <= ry <= y2:
t.append(0)
... | output | 1 | 11,298 | 3 | 22,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,299 | 3 | 22,598 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
rd = lambda: map(int, input().split())
n = int(input())
x1, y1, x2, y2 = rd()
l = []
r = []
m = []
for i in range(n):
t = []
rx, ry, vx, vy = rd()
m.append([rx, ry, vx, vy])
if x1 <= rx <= x2 and y1 <= ry <= y2:
t.append(0)
... | output | 1 | 11,299 | 3 | 22,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,300 | 3 | 22,600 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
n=int(input())
x1,y1,x2,y2=[int(x) for x in input().split()]
st=[0]
et=[1e10]
ok=1
if x1==x2 or y1==y2:
ok=0
for i in range(n):
a,b,u,w=[int(x) for x in input().split()]
for x,v,s,e in ((a,u,x1,x2),(b,w,y1,y2)):
if v==0:
... | output | 1 | 11,300 | 3 | 22,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,301 | 3 | 22,602 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
import math
n = int(input())
x1, y1, x2, y2 = map(int, input().split())
t1 = 0
t2 = math.inf
yes = True
for i in range(n):
x, y, vx, vy = map(int, input().split())
if vx == 0:
if x <= x1 or x >= x2:
yes = False
break
else:
... | output | 1 | 11,301 | 3 | 22,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,302 | 3 | 22,604 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
# In the name of Allah
def main() :
n = int(input())
x1, y1, x2, y2 = map(int, input().split())
st = [0]
ed = [1e11]
if x1 == x2 or y1 == y2 :
print(-1)
exit()
for i in range(n) :
a, b, c, d = map(in... | output | 1 | 11,302 | 3 | 22,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,303 | 3 | 22,606 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
N = int( input() )
x1, y1, x2, y2 = map( int, input().split() )
maxl, minr = 0.0, 1e30
for i in range( N ):
rx, ry, vx, vy = map( int, input().split() )
c = [ 0.0 for i in range( 4 ) ] # b, t, l, r
if vx == 0:
if not ( x1 < rx and rx < x2 ):... | output | 1 | 11,303 | 3 | 22,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,304 | 3 | 22,608 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
import sys
lines = sys.stdin.read().split('\n')[1:][:-1]
line_1 = lines.pop(0)
x_1, y_1, x_2, y_2 = map(int, line_1.split())
def terminate_with_fail():
print('-1', end='')
sys.exit()
def move(x, y, dx, dy, t):
return (x + t * dx,
... | output | 1 | 11,304 | 3 | 22,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an infinite plane, then the mousetrap is a rectang... | instruction | 0 | 11,305 | 3 | 22,610 |
Tags: geometry, implementation, math, sortings
Correct Solution:
```
#!/usr/bin/env python3
from sys import stdin,stdout
from decimal import *
def ri():
return map(int, stdin.readline().split())
#lines = stdin.readlines()
def findt(rx,ry,vx,vy):
if vx == 0:
if rx > x1 and rx < x2:
t1x = D... | output | 1 | 11,305 | 3 | 22,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,306 | 3 | 22,612 |
Yes | output | 1 | 11,306 | 3 | 22,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,307 | 3 | 22,614 |
Yes | output | 1 | 11,307 | 3 | 22,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,308 | 3 | 22,616 |
Yes | output | 1 | 11,308 | 3 | 22,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,309 | 3 | 22,618 |
Yes | output | 1 | 11,309 | 3 | 22,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,310 | 3 | 22,620 |
No | output | 1 | 11,310 | 3 | 22,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,311 | 3 | 22,622 |
No | output | 1 | 11,311 | 3 | 22,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,312 | 3 | 22,624 |
No | output | 1 | 11,312 | 3 | 22,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor the analyst fell asleep on the work and had a strange dream. In the dream his desk was crowded with computer mice, so he bought a mousetrap to catch them.
The desk can be considered as an ... | instruction | 0 | 11,313 | 3 | 22,626 |
No | output | 1 | 11,313 | 3 | 22,627 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,366 | 3 | 22,732 |
Tags: expression parsing, math
Correct Solution:
```
m=int(input())
ans=[]
f={}
for _ in range(m):
n=input()
a=n.split('(')
b=a[1].split(')')
ad,bd=b[0].split('+')
cd=b[1].split('/')[1]
ans.append((int(ad)+int(bd))/int(cd))
f[_]=(int(ad)+int(bd))/int(cd)
freq = {}
for item in ans:
if (... | output | 1 | 11,366 | 3 | 22,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,367 | 3 | 22,734 |
Tags: expression parsing, math
Correct Solution:
```
import collections
def compute_coorinate(data):
return eval(data)
if __name__ == "__main__":
m = int(input())
coordinates = []
for i in range(m):
coordinates.append(compute_coorinate(input()))
numbers = collections.Counter(coordinates)
print(" ".join(str(n... | output | 1 | 11,367 | 3 | 22,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,368 | 3 | 22,736 |
Tags: expression parsing, math
Correct Solution:
```
from collections import defaultdict
d = defaultdict(lambda : 0)
a = []
for _ in range(int(input())):
s = input()
a.append(s)
d[eval(s)] += 1
for e in a:
print(d[eval(e)], end = ' ')
``` | output | 1 | 11,368 | 3 | 22,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,369 | 3 | 22,738 |
Tags: expression parsing, math
Correct Solution:
```
from collections import defaultdict
m = int(input())
value = {}
count = defaultdict(int)
for i in range(m):
s = input()
ans = 0
z = ""
n = len(s)
for j in range(1,n):
if s[j]=='+':
ans = int(z)
z = ""
... | output | 1 | 11,369 | 3 | 22,739 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,370 | 3 | 22,740 |
Tags: expression parsing, math
Correct Solution:
```
arr = []
d = {}
for _ in range(int(input())):
s = input()
a,b,c = tuple(map(int, s.replace("(","").replace(")","").replace("/",".").replace("+",".").split(".")))
x = (a+b)/c
arr.append(x)
if x not in d:
d[x] = 0
d[x] += 1
for i in arr... | output | 1 | 11,370 | 3 | 22,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,371 | 3 | 22,742 |
Tags: expression parsing, math
Correct Solution:
```
from collections import Counter
def getList(l, m):
r = []
cnt = Counter(l)
for i in l:
r.extend([cnt[i]])
return r
m = int(input())
res = []
for i in range(m):
a, b = [i for i in input().split("/")]
a = a.split("+")
a = [a[0].replace("(", "")... | output | 1 | 11,371 | 3 | 22,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,372 | 3 | 22,744 |
Tags: expression parsing, math
Correct Solution:
```
from collections import defaultdict
from sys import stdin
input = stdin.readline
dct = defaultdict(int)
n = int(input())
lst = [0] * n
for i in range(n):
t = input().strip()
a, b, c = map(int, (t[1:t.index('+')], t[t.index('+') + 1:t.index(')')], t[t.index(... | output | 1 | 11,372 | 3 | 22,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyp... | instruction | 0 | 11,373 | 3 | 22,746 |
Tags: expression parsing, math
Correct Solution:
```
n = int(input())
cl = []
dic = {}
res = [0]*n
for i in range(n):
x = eval(input())
if x not in dic.keys():
dic.update({x:[]})
dic[x].append(i)
else:
dic[x].append(i)
for x in dic.values():
k = len(x)
for y in x:
res[y]=k
result = '... | output | 1 | 11,373 | 3 | 22,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar syst... | instruction | 0 | 11,374 | 3 | 22,748 |
Yes | output | 1 | 11,374 | 3 | 22,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar syst... | instruction | 0 | 11,375 | 3 | 22,750 |
Yes | output | 1 | 11,375 | 3 | 22,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar syst... | instruction | 0 | 11,376 | 3 | 22,752 |
Yes | output | 1 | 11,376 | 3 | 22,753 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.