message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pi... | instruction | 0 | 65,253 | 17 | 130,506 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
# [https://codeforces.com/contest/662/submission/35889556]
for i in range(int(input())):
t = input()[4:]
q = int(t)
d = 10**len(t)
while q < 1988 + d // 9:
q += d
print(q)
``` | output | 1 | 65,253 | 17 | 130,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pi... | instruction | 0 | 65,254 | 17 | 130,508 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
#!/usr/bin/python3
delims = [0, 1989, 1999, 2099, 3099, 13099, 113099, 1113099, 11113099, 111113099, 1111113099]
n = int(input())
for i in range(n):
suf = input()[4:]
min_val = delims[len(suf)]
d = int(suf)
while d < min... | output | 1 | 65,254 | 17 | 130,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pi... | instruction | 0 | 65,255 | 17 | 130,510 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
def main():
l = []
for i in range(int(input())):
y, n, m = 1989, 0, 1
for d in input()[-1:3:-1]:
n += (ord(d) - 48) * m
m *= 10
t = n - y % m
y += (m + t if t < 0 els... | output | 1 | 65,255 | 17 | 130,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pi... | instruction | 0 | 65,256 | 17 | 130,512 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n = int(input())
res = []
for i in range(n):
line = input()
year = 1989
for u in range(len(line)-1, 3, -1):
a = line[u:]
k = len(a)
while year%(10**k)!=int(a):
year = year+10**(k-1)
year += 10**(k)
res.append(year-10**k)
fo... | output | 1 | 65,256 | 17 | 130,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,257 | 17 | 130,514 |
Yes | output | 1 | 65,257 | 17 | 130,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,258 | 17 | 130,516 |
Yes | output | 1 | 65,258 | 17 | 130,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,259 | 17 | 130,518 |
Yes | output | 1 | 65,259 | 17 | 130,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,260 | 17 | 130,520 |
Yes | output | 1 | 65,260 | 17 | 130,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,261 | 17 | 130,522 |
No | output | 1 | 65,261 | 17 | 130,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,262 | 17 | 130,524 |
No | output | 1 | 65,262 | 17 | 130,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,263 | 17 | 130,526 |
No | output | 1 | 65,263 | 17 | 130,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last d... | instruction | 0 | 65,264 | 17 | 130,528 |
No | output | 1 | 65,264 | 17 | 130,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,976 | 17 | 131,952 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
def solve(a,b):
n = len(a)
m = len(b)
a = sorted(a)
b = sorted(b)
r1 = n * 3
r2 = m * 3
max1 = r1
max2 = r2
p1 = 0
p2 = 0
while p1 < n or p2 < m:
v = 0
if p2 == m:
v = a[p1]
elif p1 == ... | output | 1 | 65,976 | 17 | 131,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,977 | 17 | 131,954 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
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 = Strin... | output | 1 | 65,977 | 17 | 131,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,978 | 17 | 131,956 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
from sys import stdout, stdin, maxsize
n = int(input())
team1 = list(map(int, input().split()))
m = int(input())
team2 = list(map(int, input().split()))
ls = []
for i in range(n):
ls.append([team1[i], 1])
f... | output | 1 | 65,978 | 17 | 131,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,979 | 17 | 131,958 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
def read_pack():
c = int(input())
x = list(map(int, str.split(input())))
x.sort()
return c, x + [0]
n, a = read_pack()
m, b = read_pack()
i = j = 0
pa = pb = None
while i <= n and j <= m:
... | output | 1 | 65,979 | 17 | 131,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,980 | 17 | 131,960 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
from bisect import *
def main():
n=int(input())
a=... | output | 1 | 65,980 | 17 | 131,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,981 | 17 | 131,962 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
I = lambda: list(map(int, input().split()))
n = I()[0]
d1 = [0]+sorted(I())
m = I()[0]
d2 = [0]+sorted(I())
index1, index2 = {}, {}
index1[0], index2[0] = n, m
i, j = n, m
while (i>=0 and j>=0):
maxd = m... | output | 1 | 65,981 | 17 | 131,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,982 | 17 | 131,964 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
n,_a=int(input()),list(map(int,input().split()))
m,_b=int(input()),list(map(int,input().split()))
p=[(ai,0) for ai in _a] + [(bi,1) for bi in _b]
p.sort()
i=0
R=[len(_a)*3,len(_b)*3]
r=list(R)
while i<len(p):... | output | 1 | 65,982 | 17 | 131,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some... | instruction | 0 | 65,983 | 17 | 131,966 |
Tags: binary search, brute force, data structures, implementation, sortings, two pointers
Correct Solution:
```
from itertools import chain
from bisect import bisect_left as bisect
def main():
n = int(input().strip())
aa = list(map(int, input().strip().split()))
aa.sort()
m = int(input().strip())
... | output | 1 | 65,983 | 17 | 131,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,984 | 17 | 131,968 |
Yes | output | 1 | 65,984 | 17 | 131,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,985 | 17 | 131,970 |
Yes | output | 1 | 65,985 | 17 | 131,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,986 | 17 | 131,972 |
Yes | output | 1 | 65,986 | 17 | 131,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,987 | 17 | 131,974 |
Yes | output | 1 | 65,987 | 17 | 131,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,988 | 17 | 131,976 |
No | output | 1 | 65,988 | 17 | 131,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,989 | 17 | 131,978 |
No | output | 1 | 65,989 | 17 | 131,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,990 | 17 | 131,980 |
No | output | 1 | 65,990 | 17 | 131,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if th... | instruction | 0 | 65,991 | 17 | 131,982 |
No | output | 1 | 65,991 | 17 | 131,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,178 | 17 | 132,356 |
Tags: implementation, sortings
Correct Solution:
```
n=int(input())
m=input().split(" ")
l=[]
for i in range(len (m)):
if int(m[i])!=0 and not(m[i] in l):
l+=[m[i]]
print(len (l))
``` | output | 1 | 66,178 | 17 | 132,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,179 | 17 | 132,358 |
Tags: implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
a=len(set(l))
if(0 in l):
print(a-1)
else:
print(a)
``` | output | 1 | 66,179 | 17 | 132,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,180 | 17 | 132,360 |
Tags: implementation, sortings
Correct Solution:
```
n = int(input())
a = [int(x) for x in input().split(' ')]
s = set(a)
s.discard(0)
print(len(s))
``` | output | 1 | 66,180 | 17 | 132,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,181 | 17 | 132,362 |
Tags: implementation, sortings
Correct Solution:
```
x=int(input())
y=input().split()
z=[int(i)for i in y]
m=[]
a=0
for i in range(x):
if z[i]!=0 and z[i] not in m:
a+=1
m.append(z[i])
print(a)
``` | output | 1 | 66,181 | 17 | 132,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,182 | 17 | 132,364 |
Tags: implementation, sortings
Correct Solution:
```
n=input()
x=list(set(list(map(int,input().split()))))
if not (len(x)-1):
print(1)
elif 0 in x:
print(len(x)-1)
else:
print(len(x))
``` | output | 1 | 66,182 | 17 | 132,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,183 | 17 | 132,366 |
Tags: implementation, sortings
Correct Solution:
```
# A. Olympiad
n = int(input())
a = set(map(int, input().split()))
if 0 in a:
print(len(a) - 1)
else:
print(len(a))
``` | output | 1 | 66,183 | 17 | 132,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,184 | 17 | 132,368 |
Tags: implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
l.sort()
s=1
for i in range(len(l)-1):
if l[i]!=l[i+1]:
s=s+1
if l[0]==0:
s=s-1
print(s)
``` | output | 1 | 66,184 | 17 | 132,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with res... | instruction | 0 | 66,185 | 17 | 132,370 |
Tags: implementation, sortings
Correct Solution:
```
a = input()
s = input().split()
d = []
for i in s:
if i not in d:
d.append(i)
if '0' in d:
print(len(d) - 1)
else:
print(len(d))
``` | output | 1 | 66,185 | 17 | 132,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,186 | 17 | 132,372 |
Yes | output | 1 | 66,186 | 17 | 132,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,187 | 17 | 132,374 |
Yes | output | 1 | 66,187 | 17 | 132,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,188 | 17 | 132,376 |
Yes | output | 1 | 66,188 | 17 | 132,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,189 | 17 | 132,378 |
Yes | output | 1 | 66,189 | 17 | 132,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,190 | 17 | 132,380 |
No | output | 1 | 66,190 | 17 | 132,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,191 | 17 | 132,382 |
No | output | 1 | 66,191 | 17 | 132,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,192 | 17 | 132,384 |
No | output | 1 | 66,192 | 17 | 132,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.
As the head of the programming committee, you are to determine the set of pa... | instruction | 0 | 66,193 | 17 | 132,386 |
No | output | 1 | 66,193 | 17 | 132,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new academic year has started, and Berland's university has n first-year students. They are divided into k academic groups, however, some of the groups might be empty. Among the students, th... | instruction | 0 | 66,652 | 17 | 133,304 |
No | output | 1 | 66,652 | 17 | 133,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new academic year has started, and Berland's university has n first-year students. They are divided into k academic groups, however, some of the groups might be empty. Among the students, th... | instruction | 0 | 66,653 | 17 | 133,306 |
No | output | 1 | 66,653 | 17 | 133,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new academic year has started, and Berland's university has n first-year students. They are divided into k academic groups, however, some of the groups might be empty. Among the students, th... | instruction | 0 | 66,654 | 17 | 133,308 |
No | output | 1 | 66,654 | 17 | 133,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new academic year has started, and Berland's university has n first-year students. They are divided into k academic groups, however, some of the groups might be empty. Among the students, th... | instruction | 0 | 66,655 | 17 | 133,310 |
No | output | 1 | 66,655 | 17 | 133,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem consists of three subproblems: for solving subproblem C1 you will receive 4 points, for solving subproblem C2 you will receive 4 points, and for solving subproblem C3 you will receive 8 points.
Manao decided to pursue a fighter... | instruction | 0 | 68,477 | 17 | 136,954 |
Tags: greedy
Correct Solution:
```
m = 301000
ns = [0] * m
es = [0] * m
c = [0] * m
b = [0] * m
t = [0] * m
P = 0
def add(b, k):
k = t[k]
while k:
e = es[k]
if b[-1] > e: b[-1] = e
b[e] += 1
k = ns[k]
def delete(b):
for i in range(b[m - 1], m + 1):
if b[i]:
... | output | 1 | 68,477 | 17 | 136,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The All-Berland National Olympiad in Informatics has just ended! Now Vladimir wants to upload the contest from the Olympiad as a gym to a popular Codehorses website.
Unfortunately, the archive with Olympiad's data is a mess. For example, th... | instruction | 0 | 68,632 | 17 | 137,264 |
Tags: greedy, implementation
Correct Solution:
```
def print_all():
print(top)
print(free_top)
print(busy_top)
print(bottom)
print(free_bottom)
print(busy_bottom)
n = int(input())
top = set()
bottom = set()
for i in range(n):
name, type = input().split()
if type == '1':
top.add(... | output | 1 | 68,632 | 17 | 137,265 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.