message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perform two types of operations:
1. Subtract 1 ... | instruction | 0 | 100,909 | 10 | 201,818 |
Tags: dp, greedy
Correct Solution:
```
z=input;c,n,k,a,b=0,int(z()),int(z()),int(z()),int(z())
if k>1:
while(((n//k)*a*(k-1))>b):c+=(n%k)*a +b;n=n//k
c+=(n-1)*a;print(c)
``` | output | 1 | 100,909 | 10 | 201,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,910 | 10 | 201,820 |
Yes | output | 1 | 100,910 | 10 | 201,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,911 | 10 | 201,822 |
Yes | output | 1 | 100,911 | 10 | 201,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,912 | 10 | 201,824 |
Yes | output | 1 | 100,912 | 10 | 201,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,913 | 10 | 201,826 |
Yes | output | 1 | 100,913 | 10 | 201,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,914 | 10 | 201,828 |
No | output | 1 | 100,914 | 10 | 201,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,915 | 10 | 201,830 |
No | output | 1 | 100,915 | 10 | 201,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,916 | 10 | 201,832 |
No | output | 1 | 100,916 | 10 | 201,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Right now she actually isn't. But she will be, if you don't solve this problem.
You are given integers n, k, A and B. There is a number x, which is initially equal to n. You are allowed to perf... | instruction | 0 | 100,917 | 10 | 201,834 |
No | output | 1 | 100,917 | 10 | 201,835 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,095 | 10 | 202,190 |
"Correct Solution:
```
while True:
n = input()
if n == '0': break
q1, b, c1, c2, q2 = map(int, n.split())
for i in range(q2, 0, -1):
c = i * c1
x = (b-c)//c2
if i+x < q1:
continue
elif x >= 0:
print(i, x)
break
else:
print('... | output | 1 | 101,095 | 10 | 202,191 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,096 | 10 | 202,192 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0186
"""
import sys
from sys import stdin
input = stdin.readline
def Cond(q1, b, mid, c1, c2):
b -= (c1 * mid)
if b < 0:
return False
b -= (c2 * (q1 - mid))
if b < 0:
return Fal... | output | 1 | 101,096 | 10 | 202,193 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,097 | 10 | 202,194 |
"Correct Solution:
```
while True:
N = input()
if N == "0":
break
q1,b,c1,c2,q2 = [int(i) for i in N.split()]
if c1 <= c2:
x = min(q2, b // c1)
else:
x = min((b-c2*q1) // (c1-c2), q2, b // c1)
y = (b-c1*x) // c2
if x <= 0 or x + y < q1:
print("NA")
else... | output | 1 | 101,097 | 10 | 202,195 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,098 | 10 | 202,196 |
"Correct Solution:
```
def binary_search(quantity, budget, aizu_chicken_price, chicken_price, aizu_chicken_limit):
if budget < (quantity - 1) * chicken_price + aizu_chicken_price:
return None
if aizu_chicken_price * quantity <= budget:
aizu_chicken_count = budget // aizu_chicken_price
... | output | 1 | 101,098 | 10 | 202,197 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,099 | 10 | 202,198 |
"Correct Solution:
```
# Aizu Problem 0186: Aizu Chicken
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def aizu_chicken(q1, b, c1, c2, q2):
for i in range(q2, 0, -1):
cj = i * c1
normal = int((b - cj) ... | output | 1 | 101,099 | 10 | 202,199 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,100 | 10 | 202,200 |
"Correct Solution:
```
def check(mid, b, c1, c2, q1):
if mid + (b - mid * c1) // c2 < q1:
return False
return True
while True:
s = input()
if s == "0":
break
q1, b, c1, c2, q2 = map(int, s.split())
max_aizu = min(b // c1, q2)
if max_aizu <= 0:
print("NA")
continue
if c2 >= c1:
... | output | 1 | 101,100 | 10 | 202,201 |
Provide a correct Python 3 solution for this coding contest problem.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken is very delicious, but it is difficult to breed, so the ... | instruction | 0 | 101,101 | 10 | 202,202 |
"Correct Solution:
```
class Solve:
def __init__(self):
tmp = [int(i) for i in input().split()]
if len(tmp) == 1:
self.cal = False
else:
self.cal = True
q1, b, c1, c2, q2 = tmp
self.B = b
self.C = (c1, c2)
self.Q = (q1... | output | 1 | 101,101 | 10 | 202,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken ... | instruction | 0 | 101,102 | 10 | 202,204 |
No | output | 1 | 101,102 | 10 | 202,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken ... | instruction | 0 | 101,103 | 10 | 202,206 |
No | output | 1 | 101,103 | 10 | 202,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken ... | instruction | 0 | 101,104 | 10 | 202,208 |
No | output | 1 | 101,104 | 10 | 202,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In April 2008, Aizuwakamatsu City succeeded in making yakitori with a length of 20 m 85 cm. The chicken used at this time is Aizu local chicken, which is a specialty of Aizu. Aizu local chicken ... | instruction | 0 | 101,105 | 10 | 202,210 |
No | output | 1 | 101,105 | 10 | 202,211 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,148 | 10 | 202,296 |
"Correct Solution:
```
I=input
n,d,x=map(int,I().split())
w=[list(map(int,I().split()))for i in range(d)];d-=1
p=[[w[i+1][j]-w[i][j]for j in range(n)]for i in range(d)]
b=x
for i in range(d):
dp = [False for j in range(b+1)]
dp[0]=0
for j in range(n):
for k in range(b):
if w[i][j]+k<b+1 ... | output | 1 | 101,148 | 10 | 202,297 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,149 | 10 | 202,298 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int... | output | 1 | 101,149 | 10 | 202,299 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,150 | 10 | 202,300 |
"Correct Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
n,d,x = map(int,input().split())
weights = []
for i in range(d):
weights.append(list(map(int,input().split())))
prices = []
for i in range(d-1):
prices.append([weights[i+1][j] - weights[i][j] for j in range(n)])
bag = x
for i in range(d-1):... | output | 1 | 101,150 | 10 | 202,301 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,151 | 10 | 202,302 |
"Correct Solution:
```
N, D, X = map(int, input().split())
INF = 10 ** 5
dp = [0] * (INF + 1)
P = [tuple(map(int, input().split())) for _ in range(D)]
for i in range(X + 1):
dp[i] = i
ans = X
for d in range(D - 1):
for i in range(ans + 1):
dp[i] = i
tmp = ans
for i in range(N):
for j in ... | output | 1 | 101,151 | 10 | 202,303 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,152 | 10 | 202,304 |
"Correct Solution:
```
def get_pro(w, v):
"""
dp[a][b] ... a番目、金額bまでで作れる最高の利益
dp[a][b] = max(dp[a - 1][b], dp[a - 1][b - w * k] + v * k)
"""
dp = [0] * (x + 1)
for a in range(n):
wa = wlst[a]
va = vlst[a]
for b in range(wa, x + 1):
dp[b] = max(dp[b], dp[b - wa] + va)
return dp[x]
n, d, ... | output | 1 | 101,152 | 10 | 202,305 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,153 | 10 | 202,306 |
"Correct Solution:
```
import sys
def calc(x, n, p1, p2):
dp = []
for i in range(n):
dp.append( [0] * (x + 1) )
pocket = x
for i in range(n):
for j in range(x + 1):
dp[i][j] = dp[i - 1][j]
if j - p1[i] >= 0:
dp[i][j] = max(dp[i][j], dp[i][j - p1[... | output | 1 | 101,153 | 10 | 202,307 |
Provide a correct Python 3 solution for this coding contest problem.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the money back, Ikta decided to start investing in stocks.
Ikt... | instruction | 0 | 101,154 | 10 | 202,308 |
"Correct Solution:
```
import sys
def main():
n,d,x = map(int, sys.stdin.readline().split())
pp = []
for i in range(d):
pp.append( list(map(int,sys.stdin.readline().split())) )
dp = [0] * 100001
curr_x = x
for k in range(d - 1):
next_x = curr_x
for i in range(curr_x + ... | output | 1 | 101,154 | 10 | 202,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the mon... | instruction | 0 | 101,155 | 10 | 202,310 |
No | output | 1 | 101,155 | 10 | 202,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the mon... | instruction | 0 | 101,156 | 10 | 202,312 |
No | output | 1 | 101,156 | 10 | 202,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After many years of research, Ikta has acquired the ability to predict the future! The time and money he spent on this research was enormous, but it's finally time to be rewarded. To get the mon... | instruction | 0 | 101,157 | 10 | 202,314 |
No | output | 1 | 101,157 | 10 | 202,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A thief made his way to a shop.
As usual he has his lucky knapsack with him. The knapsack can contain k objects. There are n kinds of products in the shop and an infinite number of products of ... | instruction | 0 | 101,645 | 10 | 203,290 |
No | output | 1 | 101,645 | 10 | 203,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A thief made his way to a shop.
As usual he has his lucky knapsack with him. The knapsack can contain k objects. There are n kinds of products in the shop and an infinite number of products of ... | instruction | 0 | 101,646 | 10 | 203,292 |
No | output | 1 | 101,646 | 10 | 203,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A thief made his way to a shop.
As usual he has his lucky knapsack with him. The knapsack can contain k objects. There are n kinds of products in the shop and an infinite number of products of ... | instruction | 0 | 101,647 | 10 | 203,294 |
No | output | 1 | 101,647 | 10 | 203,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A thief made his way to a shop.
As usual he has his lucky knapsack with him. The knapsack can contain k objects. There are n kinds of products in the shop and an infinite number of products of ... | instruction | 0 | 101,648 | 10 | 203,296 |
No | output | 1 | 101,648 | 10 | 203,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,688 | 10 | 203,376 |
Tags: data structures, implementation
Correct Solution:
```
n = int(input())
p = map(int, input().split())
a = map(int, input().split())
b = map(int, input().split())
m =input()
c = map(int, input().split())
t = sorted(zip(p, a, b), key=lambda x: x[0])
t = [list(x) for x in t]
indxs = [None, 0, 0, 0]
r = []
for ci... | output | 1 | 101,688 | 10 | 203,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,689 | 10 | 203,378 |
Tags: data structures, implementation
Correct Solution:
```
n=int(input())
p=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
f=[0]*n
m=int(input())
c=list(map(int,input().split()))
l=[[],[],[],[]]
for i in range(n):
l[a[i]]+=[[p[i],i]]
if b[i]!=a[i]:
l[b[... | output | 1 | 101,689 | 10 | 203,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,690 | 10 | 203,380 |
Tags: data structures, implementation
Correct Solution:
```
import math as mt
import sys,string,bisect
input=sys.stdin.readline
import random
from collections import deque,defaultdict
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
... | output | 1 | 101,690 | 10 | 203,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,691 | 10 | 203,382 |
Tags: data structures, implementation
Correct Solution:
```
import collections
def mp(): return map(int,input().split())
def lt(): return list(map(int,input().split()))
def pt(x): print(x)
def ip(): return input()
def it(): return int(input())
def sl(x): return [t for t in x]
def spl(x): return x.split()
def aj(l... | output | 1 | 101,691 | 10 | 203,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,692 | 10 | 203,384 |
Tags: data structures, implementation
Correct Solution:
```
from collections import deque
class CodeforcesTask799BSolution:
def __init__(self):
self.result = ''
self.n = 0
self.prices = []
self.front_colors = []
self.back_colors = []
self.m = 0
self.customer... | output | 1 | 101,692 | 10 | 203,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,693 | 10 | 203,386 |
Tags: data structures, implementation
Correct Solution:
```
n = int(input())
p = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
P = []
for i in range(n):
P.append([p[i],a[i],b[i],0])
P = sorted(P)
last = [0,0,0,0]
m = int(input())
c = list(map(int,input().split())... | output | 1 | 101,693 | 10 | 203,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,694 | 10 | 203,388 |
Tags: data structures, implementation
Correct Solution:
```
import sys
# 1. create color to tshirt map
# 2. sort tshirts by orice for each color
# 3. save the current tshirt for each color ready for the next buyer
# 4. simulate sale
def main(in_stream=sys.stdin):
max_col = 3
in_stream.readline()
pli... | output | 1 | 101,694 | 10 | 203,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All va... | instruction | 0 | 101,695 | 10 | 203,390 |
Tags: data structures, implementation
Correct Solution:
```
"""
Code of Ayush Tiwari
Codeforces: servermonk
Codechef: ayush572000
"""
import sys
input = sys.stdin.buffer.readline
def solution():
n=int(input())
p=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().spl... | output | 1 | 101,695 | 10 | 203,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,696 | 10 | 203,392 |
Yes | output | 1 | 101,696 | 10 | 203,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,697 | 10 | 203,394 |
Yes | output | 1 | 101,697 | 10 | 203,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,698 | 10 | 203,396 |
Yes | output | 1 | 101,698 | 10 | 203,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,699 | 10 | 203,398 |
Yes | output | 1 | 101,699 | 10 | 203,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,700 | 10 | 203,400 |
No | output | 1 | 101,700 | 10 | 203,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,701 | 10 | 203,402 |
No | output | 1 | 101,701 | 10 | 203,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,702 | 10 | 203,404 |
No | output | 1 | 101,702 | 10 | 203,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt a... | instruction | 0 | 101,703 | 10 | 203,406 |
No | output | 1 | 101,703 | 10 | 203,407 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.