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.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all positive integer denominations that are powers of... | instruction | 0 | 55,108 | 10 | 110,216 |
Tags: greedy
Correct Solution:
```
def f(n):
def toTri(x):
if x <= 2:
return [x]
l = toTri(x // 3)
l.append(x % 3)
return l
digits = toTri(n)
for i in range(len(digits) - 1, -1, -1):
if digits[i] != 0:
break
coins = 1
mul = 1
for j... | output | 1 | 55,108 | 10 | 110,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all positive integer denominations that are powers of... | instruction | 0 | 55,109 | 10 | 110,218 |
Tags: greedy
Correct Solution:
```
n,a=int(input()),1
while n%a==0:a*=3
print(n//a+1)
``` | output | 1 | 55,109 | 10 | 110,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all positive integer denominations that are powers of... | instruction | 0 | 55,110 | 10 | 110,220 |
Tags: greedy
Correct Solution:
```
n = int(input())
p = 1
while n % p == 0: p *= 3
print(n//p + 1)
``` | output | 1 | 55,110 | 10 | 110,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,111 | 10 | 110,222 |
Yes | output | 1 | 55,111 | 10 | 110,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,112 | 10 | 110,224 |
Yes | output | 1 | 55,112 | 10 | 110,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,113 | 10 | 110,226 |
Yes | output | 1 | 55,113 | 10 | 110,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,114 | 10 | 110,228 |
Yes | output | 1 | 55,114 | 10 | 110,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,115 | 10 | 110,230 |
No | output | 1 | 55,115 | 10 | 110,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,116 | 10 | 110,232 |
No | output | 1 | 55,116 | 10 | 110,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,117 | 10 | 110,234 |
No | output | 1 | 55,117 | 10 | 110,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all po... | instruction | 0 | 55,118 | 10 | 110,236 |
No | output | 1 | 55,118 | 10 | 110,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,269 | 10 | 110,538 |
Tags: binary search
Correct Solution:
```
def energy(acc, level, perc_loss):
surplus = sum([max(x - level, 0) for x in acc])
en_cost = sum([(abs(min(0, x - level)) * 100) / (100 - perc_loss) for x in acc])
return surplus >= en_cost
class CodeforcesTask68BSolution:
def __init__(self):
self.resu... | output | 1 | 55,269 | 10 | 110,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has so... | instruction | 0 | 55,273 | 10 | 110,546 |
Tags: binary search
Correct Solution:
```
nk = list(map(int,input("").split()))
n, k = nk
aList = list(map(int,input("").split()))
aList.sort()
def isPossible(val, aList, k):
rightSum = 0
leftSum = 0
for item in aList:
if item > val:
rightSum += item - val
else:
leftS... | output | 1 | 55,273 | 10 | 110,547 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,131 | 10 | 112,262 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n, m = map(int, input().split())
mn = float('inf')
for _ in range(n):
a, b = map(int, input().split())
mn = min(mn, m*a/b)
print(mn)
``` | output | 1 | 56,131 | 10 | 112,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,132 | 10 | 112,264 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n,m=map(int,input().split())
low=0
for i in range(n):
a,b=map(int,input().split())
if low==0:
low=a/b
if low>a/b:
low=a/b
print('%.8f' % (m*low))
``` | output | 1 | 56,132 | 10 | 112,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,133 | 10 | 112,266 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n, m = map(int, input().split())
a, b = map(int, input().split())
mini = a / b
for i in range(1, n):
a, b = map(int, input().split())
mini = min(mini, a / b)
print(m * mini)
``` | output | 1 | 56,133 | 10 | 112,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,134 | 10 | 112,268 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n, m = map(int, input().split())
asd = 10 ** 9
for i in range(n):
a, b = map(int, input().split())
if a / b < asd:
asd = a / b
print(asd * m)
``` | output | 1 | 56,134 | 10 | 112,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,135 | 10 | 112,270 |
Tags: brute force, greedy, implementation
Correct Solution:
```
k, v = map(int, input().split())
result = []
for i in range(k):
u, m = map(int, input().split())
result.append(u / m)
minPrice = min(result)
print(minPrice * v)
``` | output | 1 | 56,135 | 10 | 112,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,136 | 10 | 112,272 |
Tags: brute force, greedy, implementation
Correct Solution:
```
lst = []
n ,m = [int(i) for i in input().split()]
for i in range(n):
a, b = [int(i) for i in input().split()]
lst.append(a/b)
print(min(lst)*m)
``` | output | 1 | 56,136 | 10 | 112,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,137 | 10 | 112,274 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n, m = map(int, input().split())
costs = []
for _ in range(n):
a, b = map(int, input().split())
costs.append((a * m) / b)
print(min(costs))
``` | output | 1 | 56,137 | 10 | 112,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care a... | instruction | 0 | 56,138 | 10 | 112,276 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n,m= input().split(); n,m= int(n), int(m)
li=[]
for i in range(n):
a,b= input().split(); a,b= int(a), int(b)
out= (a*m)/b
li.append(out)
print (round((min(li)),8))
``` | output | 1 | 56,138 | 10 | 112,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,139 | 10 | 112,278 |
Yes | output | 1 | 56,139 | 10 | 112,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,140 | 10 | 112,280 |
Yes | output | 1 | 56,140 | 10 | 112,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,141 | 10 | 112,282 |
Yes | output | 1 | 56,141 | 10 | 112,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,142 | 10 | 112,284 |
Yes | output | 1 | 56,142 | 10 | 112,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,143 | 10 | 112,286 |
No | output | 1 | 56,143 | 10 | 112,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,144 | 10 | 112,288 |
No | output | 1 | 56,144 | 10 | 112,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,145 | 10 | 112,290 |
No | output | 1 | 56,145 | 10 | 112,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say th... | instruction | 0 | 56,146 | 10 | 112,292 |
No | output | 1 | 56,146 | 10 | 112,293 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,211 | 10 | 112,422 |
"Correct Solution:
```
I=lambda:map(int,input().split());n,m=I();d=[0]+[9**9]*2**n
while m:
m-=1;a,_=I();s=sum(1<<c-1for c in I())
for j in range(2**n):d[s|j]=min(d[s|j],d[j]+a)
print(d[-2]%9**9or-1)
``` | output | 1 | 56,211 | 10 | 112,423 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,212 | 10 | 112,424 |
"Correct Solution:
```
n, m = map(int, input().split())
dp = [float("inf") for i in range(2 ** n)]
dp[0] = 0
for i in range(m):
a, b = map(int, input().split())
c = list(map(int, input().split()))
num = 0
for j in range(b):
num += 2 ** (c[j] - 1)
for k in range(2 ** n):
dp[k | num] ... | output | 1 | 56,212 | 10 | 112,425 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,213 | 10 | 112,426 |
"Correct Solution:
```
INF = float("inf")
N, M = map(int, input().split())
dp = [INF] * (2 ** N)
dp[0] = 0
for _ in range(M):
a, b = map(int, input().split())
C = [int(i) for i in input().split()]
mask = sum(1 << (c - 1) for c in C)
for i, dpi in enumerate(dp):
if dp[i | mask] > dpi + a:
... | output | 1 | 56,213 | 10 | 112,427 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,214 | 10 | 112,428 |
"Correct Solution:
```
n,m=map(int,input().split())
keys=[None]*m
INF = 10**10
dp=[INF]*(2**n)
dp[0]=0
for i in range(m):
a,b=map(int,input().split())
c=list(map(int,input().split()))
cond=0
for j in c:
cond+=2**(j-1)
keys[i]=[a,cond]
for key in keys:
for sta in range(2**n):
dp[sta|key[1]]=min(d... | output | 1 | 56,214 | 10 | 112,429 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,215 | 10 | 112,430 |
"Correct Solution:
```
n,m = map(int,input().split())
INF = 10 ** 9
cur = [INF] * (2**n)
cur[0] = 0
for i in range(m):
a,b = map(int,input().split())
c = 0
for j in map(int,input().split()):
c += 2**(j-1)
pre,cur = cur,[INF]*(2**n)
for j in range(2**n):
cur[j] = min(pre[j],cur[j])
jc = j|c
cur... | output | 1 | 56,215 | 10 | 112,431 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,216 | 10 | 112,432 |
"Correct Solution:
```
N,M=map(int,input().split())
INF=10**18
dp=[INF]*(1<<N)
dp[0]=0
cost=[None]*M
target=[0]*M
for i in range(M):
cost[i],b=map(int,input().split())
c=[int(x) for x in input().split()]
for j in c:
target[i]=target[i]|(1<<(j-1))
for s in range(1<<N):
for i in range(M... | output | 1 | 56,216 | 10 | 112,433 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,217 | 10 | 112,434 |
"Correct Solution:
```
n,m=map(int,input().split())
cost=[0]*m
keys=[0]*m
for i in range(m):
a,b=map(int,input().split())
cost[i]=a
k=list(map(int,input().split()))
for j in range(b):
keys[i]|=(1<<(k[j]-1))
INF=10**9+1
dp=[INF]*(2**n)
dp[0]=0
for i in range(len(keys)):
for j in range(len(dp)-1,-1,-1):
... | output | 1 | 56,217 | 10 | 112,435 |
Provide a correct Python 3 solution for this coding contest problem.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of ti... | instruction | 0 | 56,218 | 10 | 112,436 |
"Correct Solution:
```
n,m = map(int,input().split())
x = 2**n
dp = [1000000000 for _ in range(x)]
dp[0] = 0
for i in range(m):
ai,bi = map(int,input().split())
c = list(map(int,input().split()))
bit = 0
for j in range(bi):
bit += 2**(c[j]-1)
for k in range(x):
dp[k | bit] = min(dp[k... | output | 1 | 56,218 | 10 | 112,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,219 | 10 | 112,438 |
Yes | output | 1 | 56,219 | 10 | 112,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,220 | 10 | 112,440 |
Yes | output | 1 | 56,220 | 10 | 112,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,221 | 10 | 112,442 |
Yes | output | 1 | 56,221 | 10 | 112,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,222 | 10 | 112,444 |
Yes | output | 1 | 56,222 | 10 | 112,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,223 | 10 | 112,446 |
No | output | 1 | 56,223 | 10 | 112,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,224 | 10 | 112,448 |
No | output | 1 | 56,224 | 10 | 112,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,225 | 10 | 112,450 |
No | output | 1 | 56,225 | 10 | 112,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N locked treasure boxes, numbered 1 to N.
A shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{... | instruction | 0 | 56,226 | 10 | 112,452 |
No | output | 1 | 56,226 | 10 | 112,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people in this world, conveniently numbered 1 through n. They are using burles to buy goods and services. Occasionally, a person might not have enough currency to buy what he wants or needs, so he borrows money from someone else,... | instruction | 0 | 56,504 | 10 | 113,008 |
Tags: constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers
Correct Solution:
```
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
D=[0]*(n+1)
for i in range(m):
x,y,z=map(int,input().split())
D[x]+=z
D[y]-=z
PLUS=[]
MINUS=[]
for i in range(n+1):... | output | 1 | 56,504 | 10 | 113,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people in this world, conveniently numbered 1 through n. They are using burles to buy goods and services. Occasionally, a person might not have enough currency to buy what he wants or needs, so he borrows money from someone else,... | instruction | 0 | 56,505 | 10 | 113,010 |
Tags: constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers
Correct Solution:
```
from collections import deque
import sys
input = sys.stdin.buffer.readline
# input = sys.stdin.readline
# x = list ( map(int,input().split()))
n, m = map(int,input().split())
balance = [ 0 for i in ... | output | 1 | 56,505 | 10 | 113,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people in this world, conveniently numbered 1 through n. They are using burles to buy goods and services. Occasionally, a person might not have enough currency to buy what he wants or needs, so he borrows money from someone else,... | instruction | 0 | 56,506 | 10 | 113,012 |
Tags: constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers
Correct Solution:
```
n,m=map(int,input().split())
d={}
for i in range(m):
x,y,a=map(int,input().split())
d[x]=d.get(x,0)-a
d[y]=d.get(y,0)+a
pos=[]
neg=[]
for i in d:
if d[i]<0:
neg.append([d[i],i])
elif d[i]>0:
... | output | 1 | 56,506 | 10 | 113,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people in this world, conveniently numbered 1 through n. They are using burles to buy goods and services. Occasionally, a person might not have enough currency to buy what he wants or needs, so he borrows money from someone else,... | instruction | 0 | 56,507 | 10 | 113,014 |
Tags: constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers
Correct Solution:
```
n,m=map(int,input().split())
d={}
for i in range(m):
x,y,a=map(int,input().split())
d[x]=d.get(x,0)-a
d[y]=d.get(y,0)+a
pos=[]
neg=[]
for i in d:
if d[i]<0:
neg.append([d[i],i])
elif d[i]>0:
... | output | 1 | 56,507 | 10 | 113,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people in this world, conveniently numbered 1 through n. They are using burles to buy goods and services. Occasionally, a person might not have enough currency to buy what he wants or needs, so he borrows money from someone else,... | instruction | 0 | 56,508 | 10 | 113,016 |
Tags: constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
pass
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, fil... | output | 1 | 56,508 | 10 | 113,017 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.