message stringlengths 2 28.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 21 109k | cluster float64 7 7 | __index_level_0__ int64 42 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such that all the numbers are distinct. While Vadim... | instruction | 0 | 58,150 | 7 | 116,300 |
Tags: dp, greedy, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
d=set([i for i in range(1,n+1)])
for i in l:
if i!=0:
d.remove(i)
t=[0,0]
for i in d:
t[i%2]+=1
l=[1]+l+[1]
z=-1
oe=[]
e=[]
o=[]
edo=[]
ede=[]
for i in range(1,n+1):
if l[i]==0:
if z==-1:
z=i-1
if i==n:
if ... | output | 1 | 58,150 | 7 | 116,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such that all the numbers are distinct. While Vadim... | instruction | 0 | 58,151 | 7 | 116,302 |
Tags: dp, greedy, sortings
Correct Solution:
```
# complexity of a garland to be the number of pairs of adjacent bulbs with numbers with different parity(remainder of the division by 2).
n = int(input())
p = input().split()
allnos = range(1,n+1)
thenos = []
givnos = []
extra = []
comp = 0
no = None
gap = 0
for i i... | output | 1 | 58,151 | 7 | 116,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such that all the numbers are distinct. While Vadim... | instruction | 0 | 58,152 | 7 | 116,304 |
Tags: dp, greedy, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def main():
n = int(input())
l = [int(s) for s in input().split()]
e,o = n//2, n-n//2
for i in range(n):
if l[i]!=0:
if l[i]%2==0:
e-=1
els... | output | 1 | 58,152 | 7 | 116,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such that all the numbers are distinct. While Vadim... | instruction | 0 | 58,153 | 7 | 116,306 |
Tags: dp, greedy, sortings
Correct Solution:
```
n = int(input())
pr = 0
t = 0
ch = n // 2
nech = n // 2 + n % 2
mass1 = []
mass3 = []
answer = 0
for i in [int(x) for x in input().split()]:
if i == 0:
pr += 1
elif pr > 0:
if i % 2 == 0:
ch -= 1
else:
nech -= 1
... | output | 1 | 58,153 | 7 | 116,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,154 | 7 | 116,308 |
Yes | output | 1 | 58,154 | 7 | 116,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,155 | 7 | 116,310 |
Yes | output | 1 | 58,155 | 7 | 116,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,156 | 7 | 116,312 |
Yes | output | 1 | 58,156 | 7 | 116,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,157 | 7 | 116,314 |
Yes | output | 1 | 58,157 | 7 | 116,315 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,158 | 7 | 116,316 |
Yes | output | 1 | 58,158 | 7 | 116,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,159 | 7 | 116,318 |
No | output | 1 | 58,159 | 7 | 116,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,160 | 7 | 116,320 |
No | output | 1 | 58,160 | 7 | 116,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,161 | 7 | 116,322 |
No | output | 1 | 58,161 | 7 | 116,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such... | instruction | 0 | 58,162 | 7 | 116,324 |
No | output | 1 | 58,162 | 7 | 116,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,634 | 7 | 117,268 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
import bisect;
def getIntList():
return list(map(int, input().split()));
def getTransIntList(n):
first=getIntList();
m=len(first);
result=[[0]*n for _ in range(m)];
for i in range(m):
result[i][0]=first[i];
... | output | 1 | 58,634 | 7 | 117,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,635 | 7 | 117,270 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
n, k, d = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
b = [0] * n
i = j = 0
for i in range(n):
while a[i] - a[j] > d:
j += 1
b[i] = j
c = [0] * n
# d = [0] * n
for i in range(k - 1, n):
... | output | 1 | 58,635 | 7 | 117,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,636 | 7 | 117,272 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
from bisect import bisect_right, bisect_left
def main():
n, k, d = map(int, input().split())
sat = [int(x) for x in input().split()]
sat = sorted(sat)
arrange = [False for _ in range(n + 1)]
arrange[0] = True
... | output | 1 | 58,636 | 7 | 117,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,637 | 7 | 117,274 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
import heapq
def run():
n, k, d = map(int, input().split())
a = sorted(map(int, input().split()))
max_size = [None] * n # how many pencils can be in box starting with this one
start = 0
end = 0
while start < ... | output | 1 | 58,637 | 7 | 117,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,638 | 7 | 117,276 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
#!/usr/bin/env python3
from bisect import bisect
from sys import exit
[n, k, d] = map(int, input().strip().split())
ais = list(map(int, input().strip().split()))
if k == 1:
print ('YES')
exit()
ais.sort()
# can do ais[i:]
cando =... | output | 1 | 58,638 | 7 | 117,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,639 | 7 | 117,278 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
def getIntList():
return list(map(int, input().split()));
def getTransIntList(n):
first=getIntList();
m=len(first);
result=[[0]*n for _ in range(m)];
for i in range(m):
result[i][0]=first[i];
for j in ra... | output | 1 | 58,639 | 7 | 117,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,640 | 7 | 117,280 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
from bisect import bisect
def main():
n, k, d = map(int, input().split())
if k == 1:
print('YES')
return
l = []
ll = [l]
a = 10 ** 10
for b in sorted(map(int, input().split())):
if a < ... | output | 1 | 58,640 | 7 | 117,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence a1, a2, ..., an of n... | instruction | 0 | 58,641 | 7 | 117,282 |
Tags: binary search, data structures, dp, greedy, two pointers
Correct Solution:
```
import bisect
import sys
input = sys.stdin.readline
class SegmentTree():
def __init__(self, n, op, e):
self.n = n
self.op = op
self.e = e
self.size = 2 ** ((n - 1).bit_length())
self.node =... | output | 1 | 58,641 | 7 | 117,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,642 | 7 | 117,284 |
Yes | output | 1 | 58,642 | 7 | 117,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,643 | 7 | 117,286 |
Yes | output | 1 | 58,643 | 7 | 117,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,644 | 7 | 117,288 |
Yes | output | 1 | 58,644 | 7 | 117,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,645 | 7 | 117,290 |
Yes | output | 1 | 58,645 | 7 | 117,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,646 | 7 | 117,292 |
No | output | 1 | 58,646 | 7 | 117,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,647 | 7 | 117,294 |
No | output | 1 | 58,647 | 7 | 117,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,648 | 7 | 117,296 |
No | output | 1 | 58,648 | 7 | 117,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be... | instruction | 0 | 58,649 | 7 | 117,298 |
No | output | 1 | 58,649 | 7 | 117,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,127 | 7 | 118,254 |
Tags: brute force, dp, greedy
Correct Solution:
```
import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from ... | output | 1 | 59,127 | 7 | 118,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,128 | 7 | 118,256 |
Tags: brute force, dp, greedy
Correct Solution:
```
def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.get... | output | 1 | 59,128 | 7 | 118,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,129 | 7 | 118,258 |
Tags: brute force, dp, greedy
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,k=map(int,input().split())
s=list(input())
if n==1:
print(0)
print(s[0])
exit()
if k==2:
a,b='A','... | output | 1 | 59,129 | 7 | 118,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,130 | 7 | 118,260 |
Tags: brute force, dp, greedy
Correct Solution:
```
n,k=map(int,input().split())
s=input()
if(k==2):
#A
sol1=[s[i] for i in range(n)]
ans1=0
for i in range(n):
if(i%2==0 and sol1[i]=="B"):
ans1+=1
sol1[i]="A"
elif(i%2!=0 and sol1[i]=="A"):
ans1+=1
... | output | 1 | 59,130 | 7 | 118,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,131 | 7 | 118,262 |
Tags: brute force, dp, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file... | output | 1 | 59,131 | 7 | 118,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,132 | 7 | 118,264 |
Tags: brute force, dp, greedy
Correct Solution:
```
import sys
from math import sqrt, gcd, ceil, log
# from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
# from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda: list(map(int, input().strip().split()... | output | 1 | 59,132 | 7 | 118,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,133 | 7 | 118,266 |
Tags: brute force, dp, greedy
Correct Solution:
```
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
s=list(input().rstrip())
al=list("abcdefghijklmnopqrstuvwxyz".upper())[:k]
al=set(al)
if k>=3:
cnt=0
for i in range(1,n-1):
if s[i-1]==s[i]==s[i+1]:
s[i]=list(al-{s[i-1]})[0]
... | output | 1 | 59,133 | 7 | 118,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color fr... | instruction | 0 | 59,134 | 7 | 118,268 |
Tags: brute force, dp, greedy
Correct Solution:
```
from sys import maxsize, stdout, stdin,stderr
mod = int(1e9+7)
import sys
def I(): return int(stdin.readline())
def lint(): return [int(x) for x in stdin.readline().split()]
def S(): return input().strip()
def grid(r, c): return [lint() for i in range(r)]
from collect... | output | 1 | 59,134 | 7 | 118,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,135 | 7 | 118,270 |
Yes | output | 1 | 59,135 | 7 | 118,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,136 | 7 | 118,272 |
Yes | output | 1 | 59,136 | 7 | 118,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,137 | 7 | 118,274 |
Yes | output | 1 | 59,137 | 7 | 118,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,138 | 7 | 118,276 |
Yes | output | 1 | 59,138 | 7 | 118,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,139 | 7 | 118,278 |
No | output | 1 | 59,139 | 7 | 118,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,140 | 7 | 118,280 |
No | output | 1 | 59,140 | 7 | 118,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,141 | 7 | 118,282 |
No | output | 1 | 59,141 | 7 | 118,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells ... | instruction | 0 | 59,142 | 7 | 118,284 |
No | output | 1 | 59,142 | 7 | 118,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if... | instruction | 0 | 59,212 | 7 | 118,424 |
Tags: greedy
Correct Solution:
```
a=sorted(map(int,input().split()))
print(min(a[0]+a[1],sum(a)//3))
``` | output | 1 | 59,212 | 7 | 118,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if... | instruction | 0 | 59,213 | 7 | 118,426 |
Tags: greedy
Correct Solution:
```
def get_answer(a, b, c):
return min((a+b+c)//3, a+b+c-max(a,b,c))
r, g, b = map(int, input().split())
print(get_answer(r, g, b))
``` | output | 1 | 59,213 | 7 | 118,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if... | instruction | 0 | 59,214 | 7 | 118,428 |
Tags: greedy
Correct Solution:
```
a=list(map(int,input().split()))
a.sort()
if(2*(a[0]+a[1])<=a[2]):
print(a[0]+a[1])
else:
print((a[0]+a[1]+a[2])//3)
``` | output | 1 | 59,214 | 7 | 118,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if... | instruction | 0 | 59,215 | 7 | 118,430 |
Tags: greedy
Correct Solution:
```
a = [int(i) for i in input().split()]
a.sort()
if a[0]+a[1] < a[2]/2 :
print(a[0]+a[1])
else:
print((a[0]+a[1]+a[2])//3)
``` | output | 1 | 59,215 | 7 | 118,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What maximum number t of tables can be decorated if... | instruction | 0 | 59,216 | 7 | 118,432 |
Tags: greedy
Correct Solution:
```
r,g,b=[int(i) for i in input().split()]
r,g,b=sorted([r,g,b])
if 2*(r+g)<=b:
print(r+g)
else:
print((r+g+b)//3)
``` | output | 1 | 59,216 | 7 | 118,433 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.