message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the following order 25, 18, 15, 12, 10, 8, 6, 4, 2, ... | instruction | 0 | 99,718 | 17 | 199,436 |
Tags: implementation
Correct Solution:
```
t = int(input())
racer = {}
points = [25, 18, 15, 12, 10, 8, 6, 4, 2, 1]
max_points = 0
for i in range(t):
n = int(input())
for j in range(n):
name = input()
if racer.get(name):
if j < 10:
racer[name][0] += points[j]
... | output | 1 | 99,718 | 17 | 199,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the following order 25, 18, 15, 12, 10, 8, 6, 4, 2, ... | instruction | 0 | 99,719 | 17 | 199,438 |
Tags: implementation
Correct Solution:
```
N=int(input())
# S={"name":[0,0,0,......],}
soc=[25,18,15,12,10,8,6,4,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
S={}
for i in range(N):
n=int(input())
for y in range(n):
s=input()
if s in S:
S[s][0]+=soc[y]
S[s][y+1]+=... | output | 1 | 99,719 | 17 | 199,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,720 | 17 | 199,440 |
Yes | output | 1 | 99,720 | 17 | 199,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,721 | 17 | 199,442 |
Yes | output | 1 | 99,721 | 17 | 199,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,722 | 17 | 199,444 |
Yes | output | 1 | 99,722 | 17 | 199,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,723 | 17 | 199,446 |
Yes | output | 1 | 99,723 | 17 | 199,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,724 | 17 | 199,448 |
No | output | 1 | 99,724 | 17 | 199,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,725 | 17 | 199,450 |
No | output | 1 | 99,725 | 17 | 199,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,726 | 17 | 199,452 |
No | output | 1 | 99,726 | 17 | 199,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula One championship consists of series of races called Grand Prix. After every race drivers receive points according to their final position. Only the top 10 drivers receive points in the f... | instruction | 0 | 99,727 | 17 | 199,454 |
No | output | 1 | 99,727 | 17 | 199,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,610 | 17 | 201,220 |
Tags: greedy, math
Correct Solution:
```
r1 = max(tuple(map(int, input().split()))[1:])
p1 = max(tuple(map(int, input().split()))[1:])
p2 = min(tuple(map(int, input().split()))[1:])
A, B = map(int, input().split())
print(r1 * (B * p1 / (A * p2 + B * p1)) ** 0.5)
``` | output | 1 | 100,610 | 17 | 201,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,611 | 17 | 201,222 |
Tags: greedy, math
Correct Solution:
```
import math
R1 = input().split(" ")
P1 = input().split(" ")
P2 = input().split(" ")
ab = input().split(" ")
a = float(ab[0])
b = float(ab[1])
def maximum(lst):
max = -1
for el in lst:
if float(el) > max:
max = float(el)
return max
def mini... | output | 1 | 100,611 | 17 | 201,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,612 | 17 | 201,224 |
Tags: greedy, math
Correct Solution:
```
def r2(p1, p2, r1, a, b):
numerador = b * p1 * (r1**2)
denominador = a * p2 + b * p1
return (numerador/denominador)**0.5
n, *r1s = input().split()
m, *p1s = input().split()
k, *p2s = input().split()
a, b = map(int, input().split())
r1s = list(map(int, r1s))
p1s = ... | output | 1 | 100,612 | 17 | 201,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,613 | 17 | 201,226 |
Tags: greedy, math
Correct Solution:
```
a=list(map(int,input().split()[1::]))
b=list(map(int,input().split()[1::]))
c=list(map(int,input().split()[1::]))
A,B=map(int,input().split())
print(max(a)*((B*max(b))/((A*min(c)+B*max(b))))**0.5)
``` | output | 1 | 100,613 | 17 | 201,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,614 | 17 | 201,228 |
Tags: greedy, math
Correct Solution:
```
from math import sqrt
n, *x = list(map(int, input().split()))
m, *y = list(map(int, input().split()))
k, *z = list(map(int, input().split()))
A, B = list(map(int, input().split()))
f = (A*min(z))/(B*max(y))
r2 = max(x)/sqrt(f+1)
print(r2)
``` | output | 1 | 100,614 | 17 | 201,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,615 | 17 | 201,230 |
Tags: greedy, math
Correct Solution:
```
r11 = list(map(int,input().split()))[1:]
poutt = list(map(int,input().split()))[1:]
pinn = list(map(int,input().split()))[1:]
A,B = map(int,input().split())
final = []
r1 = max(r11)
pout = max(poutt)
pin = min(pinn)
r2 = ((r1**2)/((A/B)*(pin/pout)+1))**(0.5)
print(r2)
``` | output | 1 | 100,615 | 17 | 201,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,616 | 17 | 201,232 |
Tags: greedy, math
Correct Solution:
```
x_values = list(map(int, input().split()))
y_values = list(map(int, input().split()))
z_values = list(map(int, input().split()))
a, b = map(int, input().split())
r1 = max(x_values[1:])
p1 = max(y_values[1:])
p2 = min(z_values[1:])
r2 = r1 / ((((a * p2) / (b * p1)) + 1) ** 0.5)... | output | 1 | 100,616 | 17 | 201,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with density p1 g/cm3. The second part is an inner disk wi... | instruction | 0 | 100,617 | 17 | 201,234 |
Tags: greedy, math
Correct Solution:
```
import math as m
r1=max(list( map(int,input().split() ))[1:])
p1=max(list( map(int,input().split() ))[1:])
p2=min(list( map(int,input().split() ))[1:])
a,b=map(int , input().split())
c=a/b
print(m.sqrt((p1*r1*r1)/(p1+c*p2)))
``` | output | 1 | 100,617 | 17 | 201,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,618 | 17 | 201,236 |
Yes | output | 1 | 100,618 | 17 | 201,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,619 | 17 | 201,238 |
Yes | output | 1 | 100,619 | 17 | 201,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,620 | 17 | 201,240 |
Yes | output | 1 | 100,620 | 17 | 201,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,621 | 17 | 201,242 |
Yes | output | 1 | 100,621 | 17 | 201,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,622 | 17 | 201,244 |
No | output | 1 | 100,622 | 17 | 201,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,623 | 17 | 201,246 |
No | output | 1 | 100,623 | 17 | 201,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,624 | 17 | 201,248 |
No | output | 1 | 100,624 | 17 | 201,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made of metal with densit... | instruction | 0 | 100,625 | 17 | 201,250 |
No | output | 1 | 100,625 | 17 | 201,251 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are $ 2 $ teams, Team UKU and Team Ushi. Initially, Team UKU has $ N $ people and Team Uku has $ M $ people. Team UKU and Team Ushi decided to play a game called "U & U". "U & U" has a common score for $ 2 $ teams, and the goal is to w... | instruction | 0 | 101,160 | 17 | 202,320 |
"Correct Solution:
```
N,M = map(int,input().split())
ah = N*2
bh = M*2
ans1 = 0
while True:
ap = min(N,ah)
bh -= ap
if bh <= 0:
break
ans1 += 1
#print('ans1,ah,bh,ap',ans1,ah,bh,ap)
bp = (bh+1)//2
ah -= bp
if ah <= 0:
break
ans1 += 1
#print('ans1,ah,bh,bp',ans1,... | output | 1 | 101,160 | 17 | 202,321 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are $ 2 $ teams, Team UKU and Team Ushi. Initially, Team UKU has $ N $ people and Team Uku has $ M $ people. Team UKU and Team Ushi decided to play a game called "U & U". "U & U" has a common score for $ 2 $ teams, and the goal is to w... | instruction | 0 | 101,161 | 17 | 202,322 |
"Correct Solution:
```
A, B = map(int, input().split())
score = 0
score_a = A * 2
score_b = B * 2
a = A
b = B
while True :
score_b -= a
if score_b <= 0 :
break
else :
score += 1
if score_b < b :
b = score_b
score_a -= b
if score_a <= 0 :
break
el... | output | 1 | 101,161 | 17 | 202,323 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are $ 2 $ teams, Team UKU and Team Ushi. Initially, Team UKU has $ N $ people and Team Uku has $ M $ people. Team UKU and Team Ushi decided to play a game called "U & U". "U & U" has a common score for $ 2 $ teams, and the goal is to w... | instruction | 0 | 101,162 | 17 | 202,324 |
"Correct Solution:
```
def inpl(): return list(map(int, input().split()))
N, M = inpl()
n2 = N * 1
n1 = N * 1
m1 = M * 1
mall = M * 2
# うくをほろぼす
ans1 = 0
while True:
mall -= n1
m1 = -(-mall//2)
if mall <= 0:
break
ans1 += 1
if n2 - m1 >= 0:
n2 -= m1
else:
n1 = ... | output | 1 | 101,162 | 17 | 202,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,545 | 17 | 203,090 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
j,k=1,1
for i in range(n-1):
if j<n:
print(j+1)
else:
print((j%n)+1)
k+=1
j+=k
``` | output | 1 | 101,545 | 17 | 203,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,546 | 17 | 203,092 |
Tags: brute force, implementation
Correct Solution:
```
def main_function():
n = int(input())
throw_counter = 1
children_who_got_the_ball = []
ball_holder = 1
while throw_counter < n:
if ball_holder + throw_counter <= n:
ball_holder += throw_counter
else:
ba... | output | 1 | 101,546 | 17 | 203,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,547 | 17 | 203,094 |
Tags: brute force, implementation
Correct Solution:
```
# import sys
# sys.stdin=open('input.in','r')
# sys.stdout=open('output.out','w')
n=int(input())
k=1
p=1
for x in range(n-1):
k+=p
if k>n:
print(k-n,end=' ')
k=k-n
else:
print(k,end=' ')
p+=1
``` | output | 1 | 101,547 | 17 | 203,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,548 | 17 | 203,096 |
Tags: brute force, implementation
Correct Solution:
```
import math
n=int(input())
cur=1
for i in range(n-1):
cur=(cur+i+1)%n
if cur==0:
cur=n
if i<n-2:
print(cur,end=' ')
print(cur)
``` | output | 1 | 101,548 | 17 | 203,097 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,549 | 17 | 203,098 |
Tags: brute force, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue Mar 30 19:32:51 2021
@author: nehas
"""
n=int(input())
c=2
print(c,end=" ")
for i in range(2,n):
c=c+i
if(c>n):
c=c-n
print(c,end=" ")
``` | output | 1 | 101,549 | 17 | 203,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,550 | 17 | 203,100 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
c = 0
for i in range(n-1):
c=(c+i+1)%n
print(c+1, ' ')
``` | output | 1 | 101,550 | 17 | 203,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,551 | 17 | 203,102 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
m=2
print(m,end=' ')
for i in range(2,n):
m=m+i
if m>n:
m=m-n
print(m,end=' ')
``` | output | 1 | 101,551 | 17 | 203,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids stand in circle. Let's agree to think of the chil... | instruction | 0 | 101,552 | 17 | 203,104 |
Tags: brute force, implementation
Correct Solution:
```
# https://codeforces.com/problemset/problem/46/A
n = int(input().strip())
ball_ps = 1
for i in range(1, n):
ball_ps += i
if ball_ps > n:
ball_ps = ball_ps - n
print(ball_ps, end=' ')
``` | output | 1 | 101,552 | 17 | 203,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,553 | 17 | 203,106 |
Yes | output | 1 | 101,553 | 17 | 203,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,554 | 17 | 203,108 |
Yes | output | 1 | 101,554 | 17 | 203,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,555 | 17 | 203,110 |
Yes | output | 1 | 101,555 | 17 | 203,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,556 | 17 | 203,112 |
Yes | output | 1 | 101,556 | 17 | 203,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,557 | 17 | 203,114 |
No | output | 1 | 101,557 | 17 | 203,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,558 | 17 | 203,116 |
No | output | 1 | 101,558 | 17 | 203,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,559 | 17 | 203,118 |
No | output | 1 | 101,559 | 17 | 203,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A kindergarten teacher Natalia Pavlovna has invented a new ball game. This game not only develops the children's physique, but also teaches them how to count.
The game goes as follows. Kids st... | instruction | 0 | 101,560 | 17 | 203,120 |
No | output | 1 | 101,560 | 17 | 203,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan is a very experienced olympiad participant. He has n cups for Physics olympiads and m cups for Informatics olympiads. Each cup is characterized by two parameters — its significance ci and width wi.
Stepan decided to expose some of hi... | instruction | 0 | 101,682 | 17 | 203,364 |
Tags: *special, binary search, data structures, two pointers
Correct Solution:
```
n, m, d = list(map(int, input().split()))
a = []
b = []
for i in range(n):
a.append(list(map(int, input().split())))
for i in range(m):
b.append(list(map(int, input().split())))
a = sorted(a, key=lambda x: x[0] + (1- x[1] * 1... | output | 1 | 101,682 | 17 | 203,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan is a very experienced olympiad participant. He has n cups for Physics olympiads and m cups for Informatics olympiads. Each cup is characterized by two parameters — its significance ci and width wi.
Stepan decided to expose some of hi... | instruction | 0 | 101,683 | 17 | 203,366 |
Tags: *special, binary search, data structures, two pointers
Correct Solution:
```
n, m, d = map(int, input().split())
ph = [[int(j) for j in input().split()] for i in range(n)]
inf = [[int(j) for j in input().split()] for i in range(m)]
for i in range(n):
ph[i][1] = -ph[i][1]
for i in range(m):
inf[i][1] = -in... | output | 1 | 101,683 | 17 | 203,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan is a very experienced olympiad participant. He has n cups for Physics olympiads and m cups for Informatics olympiads. Each cup is characterized by two parameters — its significance ci and... | instruction | 0 | 101,684 | 17 | 203,368 |
No | output | 1 | 101,684 | 17 | 203,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan is a very experienced olympiad participant. He has n cups for Physics olympiads and m cups for Informatics olympiads. Each cup is characterized by two parameters — its significance ci and... | instruction | 0 | 101,685 | 17 | 203,370 |
No | output | 1 | 101,685 | 17 | 203,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan is a very experienced olympiad participant. He has n cups for Physics olympiads and m cups for Informatics olympiads. Each cup is characterized by two parameters — its significance ci and... | instruction | 0 | 101,686 | 17 | 203,372 |
No | output | 1 | 101,686 | 17 | 203,373 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.