message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,563 | 8 | 113,126 |
Tags: data structures, implementation
Correct Solution:
```
import sys
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): ret... | output | 1 | 56,563 | 8 | 113,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,564 | 8 | 113,128 |
Tags: data structures, implementation
Correct Solution:
```
#import bisect
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
class Sortedlist:
def __init__(self, iterable=[], _load=200):
"""Initialize sorted list instance."""
values = sorted(iterable)
self._len = _l... | output | 1 | 56,564 | 8 | 113,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,565 | 8 | 113,130 |
Tags: data structures, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split())... | output | 1 | 56,565 | 8 | 113,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,566 | 8 | 113,132 |
Tags: data structures, implementation
Correct Solution:
```
class SortedList:
def __init__(self, iterable=[], _load=200):
"""Initialize sorted list instance."""
values = sorted(iterable)
self._len = _len = len(values)
self._load = _load
self._lists = _lists = [values[i:i + _l... | output | 1 | 56,566 | 8 | 113,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,567 | 8 | 113,134 |
Tags: data structures, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
from heapq import heappop, heappush
from collections import Counter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline... | output | 1 | 56,567 | 8 | 113,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,568 | 8 | 113,136 |
Yes | output | 1 | 56,568 | 8 | 113,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,569 | 8 | 113,138 |
Yes | output | 1 | 56,569 | 8 | 113,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,570 | 8 | 113,140 |
Yes | output | 1 | 56,570 | 8 | 113,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,571 | 8 | 113,142 |
Yes | output | 1 | 56,571 | 8 | 113,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,572 | 8 | 113,144 |
No | output | 1 | 56,572 | 8 | 113,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,573 | 8 | 113,146 |
No | output | 1 | 56,573 | 8 | 113,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,574 | 8 | 113,148 |
No | output | 1 | 56,574 | 8 | 113,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have diff... | instruction | 0 | 56,575 | 8 | 113,150 |
No | output | 1 | 56,575 | 8 | 113,151 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,608 | 8 | 113,216 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
def main():
T = int(input())
for _ in range(T):
n = input().strip()
n = int(n)
x = [0 for i in range(n)]
y = [0 for i in range(n)]
for i in range(n):
p, q = map(int, input().split()... | output | 1 | 56,608 | 8 | 113,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,609 | 8 | 113,218 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
#from sys import stdin,stdout
#input=stdin.readline
#from itertools import permutations
from collections import Counter
#import collections
#import heapq
#from collections import deque
import math
#dx=[-1,1,0,0]
#dy=[0,0,-1,1]
#dx=[1,-1,-1,... | output | 1 | 56,609 | 8 | 113,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,610 | 8 | 113,220 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.buffer.readline
for _ in range(int(input())):
X = []
Y = []
N = int(input())
for _ in range(N):
x, y = map(int, ... | output | 1 | 56,610 | 8 | 113,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,611 | 8 | 113,222 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
from math import ceil,floor,log
import sys
from heapq import heappush,heappop
from collections import Counter,defaultdict,deque
input=lambda : sys.stdin.readline().strip()
c=lambda x: 10**9 if(x=="?") else int(x)
class node:
def __init__(... | output | 1 | 56,611 | 8 | 113,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,612 | 8 | 113,224 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
from sys import stdin
input = stdin.readline
for _ in range(int(input())):
n = int(input())
hx = []
hy = []
for _ in range(n):
x, y = map(int, input().split())
hx.append(x)
hy.append(y)
hx.sort... | output | 1 | 56,612 | 8 | 113,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,614 | 8 | 113,228 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
import os
DEBUG = 'DEBUG' in os.environ
def debug(*args):
if DEBUG:
print(">", *args)
def solution(houses):
if len(houses) == 1:
return 1
housesX = []
housesY = []
for house in houses:
housesX.append(house[0])
ho... | output | 1 | 56,614 | 8 | 113,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city is asking you for places for the building of th... | instruction | 0 | 56,615 | 8 | 113,230 |
Tags: binary search, geometry, shortest paths, sortings
Correct Solution:
```
a = int(input())
for x in range(a):
b = int(input())
h = []
m = []
for y in range(b):
d,e = map(int,input().split())
h.append(d)
m.append(e)
h.sort()
m.sort()
if b&1 == 1:
print(1... | output | 1 | 56,615 | 8 | 113,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You and your friends live in n houses. Each house is located on a 2D plane, in a point with integer coordinates. There might be different houses located in the same point. The mayor of the city ... | instruction | 0 | 56,616 | 8 | 113,232 |
Yes | output | 1 | 56,616 | 8 | 113,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are standing in front of the room with great treasures. The only thing stopping you is the door with a push-button combination lock. This lock has d buttons with digits from 0 to d - 1. When... | instruction | 0 | 56,624 | 8 | 113,248 |
No | output | 1 | 56,624 | 8 | 113,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are standing in front of the room with great treasures. The only thing stopping you is the door with a push-button combination lock. This lock has d buttons with digits from 0 to d - 1. When... | instruction | 0 | 56,625 | 8 | 113,250 |
No | output | 1 | 56,625 | 8 | 113,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are standing in front of the room with great treasures. The only thing stopping you is the door with a push-button combination lock. This lock has d buttons with digits from 0 to d - 1. When... | instruction | 0 | 56,626 | 8 | 113,252 |
No | output | 1 | 56,626 | 8 | 113,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are standing in front of the room with great treasures. The only thing stopping you is the door with a push-button combination lock. This lock has d buttons with digits from 0 to d - 1. When... | instruction | 0 | 56,627 | 8 | 113,254 |
No | output | 1 | 56,627 | 8 | 113,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,719 | 8 | 113,438 |
Yes | output | 1 | 56,719 | 8 | 113,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,720 | 8 | 113,440 |
Yes | output | 1 | 56,720 | 8 | 113,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,721 | 8 | 113,442 |
Yes | output | 1 | 56,721 | 8 | 113,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,722 | 8 | 113,444 |
Yes | output | 1 | 56,722 | 8 | 113,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,723 | 8 | 113,446 |
No | output | 1 | 56,723 | 8 | 113,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,725 | 8 | 113,450 |
No | output | 1 | 56,725 | 8 | 113,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
... | instruction | 0 | 56,726 | 8 | 113,452 |
No | output | 1 | 56,726 | 8 | 113,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,882 | 8 | 113,764 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
print(int(input()) + 1 - len(set(map(int, input().split()))))
``` | output | 1 | 56,882 | 8 | 113,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,883 | 8 | 113,766 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
n = int(input())
t = list(map(int, input().split(' ')))
a = [0]
h = 1
cur_t = 1
d = {0:0}
for ti in t:
if d[a[ti]] != ti:
a.append(h)
d[h] = cur_t
h += 1
else:
d[a[ti]] = cur_t
a.append(a[ti])
cur_t += ... | output | 1 | 56,883 | 8 | 113,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,884 | 8 | 113,768 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
n = int(input())
A = list(map(int, input().split()))
D = {}
for i in range (n):
D[A[i]] = D.get ( A[i], -1 ) + 1
a = sum(D.values())+1
print(a)
``` | output | 1 | 56,884 | 8 | 113,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,885 | 8 | 113,770 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
n = int(input())
minutesUsed = [0 for _ in range(n)]
count = 1
for v in [int(k) for k in input().split(' ') if k]:
if minutesUsed[v]:
count += 1
else:
minutesUsed[v] = 1
print(count)
``` | output | 1 | 56,885 | 8 | 113,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,886 | 8 | 113,772 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
def getMinimum (arr, n):
times = [None for i in range(0, n+1)]
rooms = [None for i in range(0, n+1)]
currentRoom = 0
times[0] = currentRoom
rooms[currentRoom] = 0
t = 1
total = 1
currentRoom += 1
for i in range(0, n):
... | output | 1 | 56,886 | 8 | 113,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,887 | 8 | 113,774 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
vis = [0] * (n+1)
res = 1
for i in range(n):
if vis[arr[i]] > 0:
res += 1
vis[arr[i]] = 1
print(res)
``` | output | 1 | 56,887 | 8 | 113,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,888 | 8 | 113,776 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
i = int(input())
ctc = [0] + list(map(int, input().split()))
nm = 1
ptor = {0:1}
for i in range(1, len(ctc)):
if ctc[i] in ptor.keys():
ptor[i] = ptor[ctc[i]]
del(ptor[ctc[i]])
else:
nm+=1
ptor[i] = nm
print(nm)
``` | output | 1 | 56,888 | 8 | 113,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several rooms and bidirectional passages between some pa... | instruction | 0 | 56,889 | 8 | 113,778 |
Tags: dsu, greedy, implementation, trees
Correct Solution:
```
def main():
n = int(input())
p = set()
t = list(map(int, input().split()))
p.add(1)
for i in range(1, n):
if t[i] == 0:
p.add(i+1)
continue
if t[i] in p:
p.remove(t[i])
p.ad... | output | 1 | 56,889 | 8 | 113,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,890 | 8 | 113,780 |
Yes | output | 1 | 56,890 | 8 | 113,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,891 | 8 | 113,782 |
Yes | output | 1 | 56,891 | 8 | 113,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,892 | 8 | 113,784 |
Yes | output | 1 | 56,892 | 8 | 113,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,893 | 8 | 113,786 |
Yes | output | 1 | 56,893 | 8 | 113,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,894 | 8 | 113,788 |
No | output | 1 | 56,894 | 8 | 113,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,895 | 8 | 113,790 |
No | output | 1 | 56,895 | 8 | 113,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,896 | 8 | 113,792 |
No | output | 1 | 56,896 | 8 | 113,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs.
Catacombs consist of several r... | instruction | 0 | 56,897 | 8 | 113,794 |
No | output | 1 | 56,897 | 8 | 113,795 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice is playing with some stones.
Now there are three numbered heaps of stones. The first of them contains a stones, the second of them contains b stones and the third of them contains c stones.
Each time she can do one of two operations:... | instruction | 0 | 57,252 | 8 | 114,504 |
Tags: brute force, greedy, math
Correct Solution:
```
import os, sys
# zeilen = [l.strip() for l in sys.stdin.readlines()]
t = int(sys.stdin.readline().strip())
for _ in range(t):
a, b, c = map(int, sys.stdin.readline().strip().split())
anz2 = min(b, c//2)
anz1 = min(a, (b-anz2) // 2)
print(3*(anz1 + anz2))
... | output | 1 | 57,252 | 8 | 114,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 β€ i β€ n) book is wi.
As Jaehyun's house is not large enough to have a books... | instruction | 0 | 57,508 | 8 | 115,016 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n,m=map(int,input().split())
w=list(map(int,input().split()))
l=list(map(int,input().split()))
k=0
f=[]
for x in l :
x-=1
if x not in f :
for y in f :
k+=w[y]
f=[x]+f
else :
for i in range(l... | output | 1 | 57,508 | 8 | 115,017 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.