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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n models in the shop numbered from 1 to n, with sizes s_1, s_2, …, s_n.
Orac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but no... | instruction | 0 | 24,931 | 8 | 49,862 |
Yes | output | 1 | 24,931 | 8 | 49,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n models in the shop numbered from 1 to n, with sizes s_1, s_2, …, s_n.
Orac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but no... | instruction | 0 | 24,932 | 8 | 49,864 |
No | output | 1 | 24,932 | 8 | 49,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n models in the shop numbered from 1 to n, with sizes s_1, s_2, …, s_n.
Orac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but no... | instruction | 0 | 24,933 | 8 | 49,866 |
No | output | 1 | 24,933 | 8 | 49,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n models in the shop numbered from 1 to n, with sizes s_1, s_2, …, s_n.
Orac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but no... | instruction | 0 | 24,934 | 8 | 49,868 |
No | output | 1 | 24,934 | 8 | 49,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n models in the shop numbered from 1 to n, with sizes s_1, s_2, …, s_n.
Orac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but no... | instruction | 0 | 24,935 | 8 | 49,870 |
No | output | 1 | 24,935 | 8 | 49,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently bought some land and decided to surround it with a wooden fence.
He went to a company called "Wooden board" that produces wooden boards for fences. Vasya read in the catalog of products that the company has at its disposa... | instruction | 0 | 25,020 | 8 | 50,040 |
Tags: dp
Correct Solution:
```
from sys import stdin, stdout
MOD = 10 ** 9 + 7
sze = 101
n, l = map(int, stdin.readline().split())
dp = [[[0, 0] for j in range(l + sze + 1)] for i in range(n)]
bars = []
challengers = [[] for i in range(sze)]
for i in range(n):
a, b = map(int, stdin.readline().split())
b... | output | 1 | 25,020 | 8 | 50,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently bought some land and decided to surround it with a wooden fence.
He went to a company called "Wooden board" that produces wooden boards for fences. Vasya read in the catalog ... | instruction | 0 | 25,021 | 8 | 50,042 |
No | output | 1 | 25,021 | 8 | 50,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently bought some land and decided to surround it with a wooden fence.
He went to a company called "Wooden board" that produces wooden boards for fences. Vasya read in the catalog ... | instruction | 0 | 25,022 | 8 | 50,044 |
No | output | 1 | 25,022 | 8 | 50,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you remember how Kai constructed the word "eternity" using pieces of ice as components?
Little Sheldon plays with pieces of ice, each piece has exactly one digit between 0 and 9. He wants to... | instruction | 0 | 25,061 | 8 | 50,122 |
No | output | 1 | 25,061 | 8 | 50,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,098 | 8 | 50,196 |
Tags: implementation
Correct Solution:
```
n=int(input())
f=0
for i in range(n):
p,c=map(int,input().split())
if (c-2)>=p:
f+=1
print(f)
``` | output | 1 | 25,098 | 8 | 50,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,099 | 8 | 50,198 |
Tags: implementation
Correct Solution:
```
res = 0
for i in range(int(input())):
p,q = map(int, input().split())
if p+2<=q:
res+=1
print(res)
``` | output | 1 | 25,099 | 8 | 50,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,100 | 8 | 50,200 |
Tags: implementation
Correct Solution:
```
x=int(input())
arr=[]
for i in range(x):
arr.append(list(map(int,input().split())))
s=0
for l in range(x):
if arr[l][1]-arr[l][0]>=2:
s+=1
if s>0:
print(s)
else:
print(0)
``` | output | 1 | 25,100 | 8 | 50,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,101 | 8 | 50,202 |
Tags: implementation
Correct Solution:
```
kol=0
n=int(input())
for i in range(n):
a,b = map(int,input().split())
if b-a >= 2:
kol+=1
print(kol)
``` | output | 1 | 25,101 | 8 | 50,203 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,102 | 8 | 50,204 |
Tags: implementation
Correct Solution:
```
n=int(input())
x=0
for i in range(n):
p,q=(int(i) for i in input().split())
if q-p>=2:
x+=1
print(x)
``` | output | 1 | 25,102 | 8 | 50,205 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,103 | 8 | 50,206 |
Tags: implementation
Correct Solution:
```
mas = 0
for _ in range(int(input())):
p, q =[int(x) for x in input().split()]
if p + 2 <= q:
mas += 1
print(mas)
``` | output | 1 | 25,103 | 8 | 50,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,104 | 8 | 50,208 |
Tags: implementation
Correct Solution:
```
from sys import stdin
def fun(lines):
rooms = 0
for line in lines[1:]:
[a, b] = list(map(int, line.split(' ')))
if b - a >= 2:
rooms += 1
return str(rooms)
tests = [
[
"3\n1 1\n2 2\n3 3",
"0"
],
[
... | output | 1 | 25,104 | 8 | 50,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The d... | instruction | 0 | 25,105 | 8 | 50,210 |
Tags: implementation
Correct Solution:
```
n = int(input())
output = 0
for i in range(n):
p, q=map(int, input().split(' '))
if q - p >= 2:
output += 1
print(output)
``` | output | 1 | 25,105 | 8 | 50,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,106 | 8 | 50,212 |
Yes | output | 1 | 25,106 | 8 | 50,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,107 | 8 | 50,214 |
Yes | output | 1 | 25,107 | 8 | 50,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,108 | 8 | 50,216 |
Yes | output | 1 | 25,108 | 8 | 50,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,109 | 8 | 50,218 |
Yes | output | 1 | 25,109 | 8 | 50,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,110 | 8 | 50,220 |
No | output | 1 | 25,110 | 8 | 50,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,111 | 8 | 50,222 |
No | output | 1 | 25,111 | 8 | 50,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,112 | 8 | 50,224 |
No | output | 1 | 25,112 | 8 | 50,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
Georg... | instruction | 0 | 25,113 | 8 | 50,226 |
No | output | 1 | 25,113 | 8 | 50,227 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this planet in the near future.
Mr. Dango's family, the huge... | instruction | 0 | 25,524 | 8 | 51,048 |
"Correct Solution:
```
# AOJ 1065 The House of Huge Family
# Python3 2018.7.10 bal4u
# UNION-FIND library
class UnionSet:
def __init__(self, nmax):
self.size = [1]*nmax
self.id = [i for i in range(nmax+1)]
def root(self, i):
while i != self.id[i]:
self.id[i] = self.id[self.id[i]]
i = self.id[i]
return ... | output | 1 | 25,524 | 8 | 51,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this ... | instruction | 0 | 25,525 | 8 | 51,050 |
No | output | 1 | 25,525 | 8 | 51,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this ... | instruction | 0 | 25,526 | 8 | 51,052 |
No | output | 1 | 25,526 | 8 | 51,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this ... | instruction | 0 | 25,527 | 8 | 51,054 |
No | output | 1 | 25,527 | 8 | 51,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this ... | instruction | 0 | 25,528 | 8 | 51,056 |
No | output | 1 | 25,528 | 8 | 51,057 |
Provide a correct Python 3 solution for this coding contest problem.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output | instruction | 0 | 25,563 | 8 | 51,126 |
"Correct Solution:
```
from heapq import *
# G : [to/from, cap, cost, rev]
def minimumCostFlow(N: int, G: list, s: int, t: int, flow: int):
ret = 0
INF = 1 << 60
potential = [0] * N
pre_vtx = [None] * N
pre_edge = [None] * N
while flow > 0:
dist = [INF] * N
dist[s] = 0
visited = [False] * N
q = [(0, s)]... | output | 1 | 25,563 | 8 | 51,127 |
Provide a correct Python 3 solution for this coding contest problem.
Examples
Input
4 5 2
0 1 2 1
0 2 1 2
1 2 1 1
1 3 1 3
2 3 2 1
Output
6
Input
Output | instruction | 0 | 25,566 | 8 | 51,132 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
from heapq import heappush, heappop
def min_cost_flow_dijkstra(E, s, t, f):
INF = 1 << 100
NN = N
LN = NN.bit_length()
G = [[] for _ in range(NN)]
for a, b, cap, c in E:
G[a].append([b, cap, c, len(G[b])])
G[b].append([a, 0... | output | 1 | 25,566 | 8 | 51,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
[SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nora used to play lots of games with her creation ... | instruction | 0 | 25,717 | 8 | 51,434 |
Tags: bitmasks, combinatorics, dp
Correct Solution:
```
MOD = 1000000007
def isSubset(a, b):
return (a & b) == a
def isIntersect(a, b):
return (a & b) != 0
# Solve for each weakly connected component (WCC)
def cntOrder(s, t):
p = len(s)
m = len(t)
inMask = [0 for i in range(m)]
for x in range(p):
for i ... | output | 1 | 25,717 | 8 | 51,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
[SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nora used to play lots of games with her creation ... | instruction | 0 | 25,718 | 8 | 51,436 |
Tags: bitmasks, combinatorics, dp
Correct Solution:
```
MOD = 1000000007
def isSubset(a, b):
return (a & b) == a
def isIntersect(a, b):
return (a & b) != 0
def cntOrder(s, t):
p = len(s)
m = len(t)
inMask = [0 for i in range(m)]
for x in range(p):
for i in range(m):
if t[i] %... | output | 1 | 25,718 | 8 | 51,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
[SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nor... | instruction | 0 | 25,719 | 8 | 51,438 |
No | output | 1 | 25,719 | 8 | 51,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
[SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nor... | instruction | 0 | 25,720 | 8 | 51,440 |
No | output | 1 | 25,720 | 8 | 51,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
[SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nor... | instruction | 0 | 25,721 | 8 | 51,442 |
No | output | 1 | 25,721 | 8 | 51,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
[SIHanatsuka - EMber](https://soundcloud.com/hanatsuka/sihanatsuka-ember)
[SIHanatsuka - ATONEMENT](https://soundcloud.com/hanatsuka/sihanatsuka-atonement)
Back in time, the seven-year-old Nor... | instruction | 0 | 25,722 | 8 | 51,444 |
No | output | 1 | 25,722 | 8 | 51,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the g... | instruction | 0 | 25,888 | 8 | 51,776 |
Tags: dfs and similar, greedy
Correct Solution:
```
read = lambda: [int(i) - 1 for i in input().split()]
n = int(input())
house = read()
prec = [set(read()[1:]) for i in range(n)]
def sub(): # do the job if the precedence is cleared
for i in job_list:
if house[i] == k and not tmp_prec[i]:
retu... | output | 1 | 25,888 | 8 | 51,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the g... | instruction | 0 | 25,889 | 8 | 51,778 |
Tags: dfs and similar, greedy
Correct Solution:
```
n = int(input())
c = list(map(int, input().split()))
d = dict()
d[1] = []
d[2] = []
d[3] = []
for i in range(n):
d[c[i]].append(i)
done = set()
mas = []
k = 0
poss = set()
for i in range(n):
l = list(map(int, input().split()))
l = l[1:]
mas.append(l)
... | output | 1 | 25,889 | 8 | 51,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the g... | instruction | 0 | 25,890 | 8 | 51,780 |
Tags: dfs and similar, greedy
Correct Solution:
```
from collections import *
read_line = lambda: [int(i) for i in input().split(' ')]
n = read_line()[0]
cs = [c - 1 for c in read_line()]
g = [[] for v in range(n)]
parent_cnt = [0] * n
for v in range(n):
parents = read_line()
parent_cnt[v] = len(parents) - 1
... | output | 1 | 25,890 | 8 | 51,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the g... | instruction | 0 | 25,891 | 8 | 51,782 |
Tags: dfs and similar, greedy
Correct Solution:
```
n = int(input())
h = [int(q) - 1 for q in input().split()]
u = [set([int(q) - 1 for q in input().split()][1:]) for i in range(n)]
t = 1e9
def g():
for i in p:
if h[i] == k and not v[i]:
return i
for k in range(3):
p = list(range(n))
... | output | 1 | 25,891 | 8 | 51,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the g... | instruction | 0 | 25,892 | 8 | 51,784 |
Tags: dfs and similar, greedy
Correct Solution:
```
f = lambda: [int(q) - 1 for q in input().split()]
def g():
for i in p:
if h[i] == k and not v[i]: return i
r = range(int(input()))
t, h = 1e9, f()
u = [set(f()[1:]) for i in r]
for k in (0, 1, 2):
p = list(r)
d = -1
v = [q.copy() for q in u]
... | output | 1 | 25,892 | 8 | 51,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Furik and Rubik love playing computer games. Furik has recently found a new game that greatly interested Rubik. The game consists of n parts and to complete each part a player may probably need to complete some other ones. We know that the g... | instruction | 0 | 25,893 | 8 | 51,786 |
Tags: dfs and similar, greedy
Correct Solution:
```
from collections import *
read_line = lambda: [int(i) for i in input().split(' ')]
n = read_line()[0]
cs = [c - 1 for c in read_line()]
g = [[] for v in range(n)]
parent_cnt = [0] * n
for v in range(n):
parents = read_line()
parent_cnt[v] = len(parents) - 1
... | output | 1 | 25,893 | 8 | 51,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the mini... | instruction | 0 | 25,939 | 8 | 51,878 |
Tags: sortings
Correct Solution:
```
n = int(input())
b = list(map(int, input().split()))
num = len(set(b))
maxx = 0
for i in set(b):
maxx = max(b.count(i), maxx)
print(maxx, num)
``` | output | 1 | 25,939 | 8 | 51,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the mini... | instruction | 0 | 25,940 | 8 | 51,880 |
Tags: sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
pre = -1
ans = 0
highest = -1
for i in a:
if i != pre:
count = 1
ans += 1
pre = i
else:
count += 1
highest = max(highest, count)
print(highest, ans, end=' ')
``` | output | 1 | 25,940 | 8 | 51,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the mini... | instruction | 0 | 25,941 | 8 | 51,882 |
Tags: sortings
Correct Solution:
```
from sys import stdin
def result():
numero = int(stdin.readline().strip())
lista1 = [int(x) for x in stdin.readline().split()]
lista2 = []
for a in range(numero):
if lista1[a] not in lista2:
lista2.append(lista1[a])
towers = []
for i ... | output | 1 | 25,941 | 8 | 51,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the mini... | instruction | 0 | 25,942 | 8 | 51,884 |
Tags: sortings
Correct Solution:
```
input()
bars = list(map(int, input().split()))
towers = {}
for b in bars:
towers[b] = towers.get(b, 0) + 1
print(max(towers.values()), len(towers))
``` | output | 1 | 25,942 | 8 | 51,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the mini... | instruction | 0 | 25,943 | 8 | 51,886 |
Tags: sortings
Correct Solution:
```
n = int(input())
l = list(map(int, input().split()))
se = len(set(l))
h = []
for i in l:
lt = l.count(i)
h.append(lt)
print(max(h), se)
``` | output | 1 | 25,943 | 8 | 51,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the mini... | instruction | 0 | 25,944 | 8 | 51,888 |
Tags: sortings
Correct Solution:
```
n = int(input())
arr = sorted(list(map(int,input().strip().split(' '))))
hs = {}
for v in arr :
if v not in hs :
hs[v] = 1
else :
hs[v] += 1
# print()
print("%s %s"%(max(hs.values()),len(hs)))
``` | output | 1 | 25,944 | 8 | 51,889 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.