message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he... | instruction | 0 | 38,809 | 14 | 77,618 |
Tags: implementation
Correct Solution:
```
n = int(input())
to_sb = list(map(int, input().split()))
dict1 = {i + 1: to_sb[i] for i in range(len(to_sb))}
dict2 = dict(sorted(dict1.items(), key=lambda d: d[1], reverse=False))
from_sb = sorted(dict1.items(), key=lambda d: d[1], reverse=False)
end_p = [from_sb[i][0] for i ... | output | 1 | 38,809 | 14 | 77,619 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he... | instruction | 0 | 38,810 | 14 | 77,620 |
Tags: implementation
Correct Solution:
```
n = int(input())
lis = [int(_) for _ in input().split()]
dic = {}
for i,x in enumerate(lis):
dic[x] = i+1
print(' '.join([str(dic[_+1]) for _ in range(n)]))
``` | output | 1 | 38,810 | 14 | 77,621 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he... | instruction | 0 | 38,811 | 14 | 77,622 |
Tags: implementation
Correct Solution:
```
n=int(input())
l=input().split()
l1=len(l)
for i in range(n):
l[i]=int(l[i])
i=0
j=1
while(j<l1+1):
if(l[i]==j):
j+=1
print(i+1,"", end="")
i=-1
i+=1
``` | output | 1 | 38,811 | 14 | 77,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he... | instruction | 0 | 38,812 | 14 | 77,624 |
Tags: implementation
Correct Solution:
```
k = int(input())
n = list(map(int, input().split()))
m = 0
for i in range(1, k+1):
m = n.index(i) + 1
print(m)
``` | output | 1 | 38,812 | 14 | 77,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,813 | 14 | 77,626 |
Yes | output | 1 | 38,813 | 14 | 77,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,814 | 14 | 77,628 |
Yes | output | 1 | 38,814 | 14 | 77,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,815 | 14 | 77,630 |
Yes | output | 1 | 38,815 | 14 | 77,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,816 | 14 | 77,632 |
Yes | output | 1 | 38,816 | 14 | 77,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,817 | 14 | 77,634 |
No | output | 1 | 38,817 | 14 | 77,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,818 | 14 | 77,636 |
No | output | 1 | 38,818 | 14 | 77,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,819 | 14 | 77,638 |
No | output | 1 | 38,819 | 14 | 77,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than... | instruction | 0 | 38,820 | 14 | 77,640 |
No | output | 1 | 38,820 | 14 | 77,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,026 | 14 | 78,052 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import sys
import string
import math
from collections import defaultdict
from functools import lru_cache
from collections import Counter
from fractions import Fraction
def mi(s):
return map(int, s.strip().split())
def lmi(s):
return list(mi... | output | 1 | 39,026 | 14 | 78,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,027 | 14 | 78,054 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
from bisect import bisect_left as lower
def put(): return map(int, input().split())
n = int(input())
c,p = [],[]
for i in range(n):
ci,pi = put()
c.append(ci)
p.append(pi)
k = int(input())
rr = list(put())
l = []
for i in range(n):
... | output | 1 | 39,027 | 14 | 78,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,028 | 14 | 78,056 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import heapq
n=int(input())
req=[]
for i in range(n):
c,p=map(int,input().split())
req.append((c,p,i+1))
req.sort()
x=int(input())
r1=list(map(int,input().split()))
r=[]
for i in range(x):
r.append((r1[i],i+1))
r.sort()
l1=[]
z=0
ans=0
... | output | 1 | 39,028 | 14 | 78,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,029 | 14 | 78,058 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
def main():
F = lambda : map(int, input().split())
n = int(input())
groups = [list(F())[::-1] + [i] for i in range(n)]
k = int(input())
tables = list(F())
tables = [[tables[i], i] for i in range(k)]
tables = sorted(table... | output | 1 | 39,029 | 14 | 78,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,030 | 14 | 78,060 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import sys
from math import log2,floor,ceil,sqrt
# import bisect
# from collections import deque
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip(... | output | 1 | 39,030 | 14 | 78,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,031 | 14 | 78,062 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
n = int(input())
g = [list(map(int, input().split())) + [i] for i in range(n)]
k = int(input())
r = [(v, i) for i, v in enumerate(list(map(int, input().split())))]
b = [None] * n
sg = sorted(g, key=lambda x: x[1], reverse=True)
sr = sorted(r)
count... | output | 1 | 39,031 | 14 | 78,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,032 | 14 | 78,064 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
n = int(input())
R = []
for r in range(n):
c, p = list(map(int, input().split()))
R.append((p, c, r+1))
m = int(input())
T = list(map(int, input().split()))
T = sorted([[c, i+1] for i,c in enumerate(T)])
R = sorted(R, reverse=True)
ans = 0
B = ... | output | 1 | 39,032 | 14 | 78,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.
There are n booking r... | instruction | 0 | 39,033 | 14 | 78,066 |
Tags: binary search, dp, greedy, implementation
Correct Solution:
```
import bisect, sys
input = sys.stdin.readline
def binary_search(array, value, l = 0, h = None):
array = [i[0] for i in array]
if not h:
h = len(array)
index = bisect.bisect_left(array, value, l, h)
if index != h and array[in... | output | 1 | 39,033 | 14 | 78,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,034 | 14 | 78,068 |
Yes | output | 1 | 39,034 | 14 | 78,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,035 | 14 | 78,070 |
Yes | output | 1 | 39,035 | 14 | 78,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,036 | 14 | 78,072 |
Yes | output | 1 | 39,036 | 14 | 78,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,037 | 14 | 78,074 |
Yes | output | 1 | 39,037 | 14 | 78,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,038 | 14 | 78,076 |
No | output | 1 | 39,038 | 14 | 78,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,039 | 14 | 78,078 |
No | output | 1 | 39,039 | 14 | 78,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,040 | 14 | 78,080 |
No | output | 1 | 39,040 | 14 | 78,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!
A restaurant called "Dijkstra's Place" has started thinking about optimiz... | instruction | 0 | 39,041 | 14 | 78,082 |
No | output | 1 | 39,041 | 14 | 78,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Large Software Company develops its own social network. Analysts have found that during the holidays, major sporting events and other significant events users begin to enter the network more frequently, resulting in great load increase on ... | instruction | 0 | 39,106 | 14 | 78,212 |
Tags: constructive algorithms, greedy
Correct Solution:
```
from collections import deque
import random
class CodeforcesTask566BSolution:
def __init__(self):
self.result = ''
self.n = 0
self.rules = []
def read_input(self):
self.n = int(input())
self.rules = [[int(x) f... | output | 1 | 39,106 | 14 | 78,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Large Software Company develops its own social network. Analysts have found that during the holidays, major sporting events and other significant events users begin to enter the network more f... | instruction | 0 | 39,107 | 14 | 78,214 |
No | output | 1 | 39,107 | 14 | 78,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Large Software Company develops its own social network. Analysts have found that during the holidays, major sporting events and other significant events users begin to enter the network more f... | instruction | 0 | 39,108 | 14 | 78,216 |
No | output | 1 | 39,108 | 14 | 78,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Large Software Company develops its own social network. Analysts have found that during the holidays, major sporting events and other significant events users begin to enter the network more f... | instruction | 0 | 39,109 | 14 | 78,218 |
No | output | 1 | 39,109 | 14 | 78,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Large Software Company develops its own social network. Analysts have found that during the holidays, major sporting events and other significant events users begin to enter the network more f... | instruction | 0 | 39,110 | 14 | 78,220 |
No | output | 1 | 39,110 | 14 | 78,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,180 | 14 | 78,360 |
Tags: implementation, math
Correct Solution:
```
seatposition=input()
rownumber = int(seatposition[0:-1])
colnumber = seatposition[-1]
colorder = {'f': 1, 'e':2, 'd':3, 'a':4, 'b':5, 'c': 6}
blocknumber = (rownumber-1)//4
detailnumber = rownumber%4
waitnumber = 0
if detailnumber %2 == 0:
waitnumber = 7
print(16*blo... | output | 1 | 39,180 | 14 | 78,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,181 | 14 | 78,362 |
Tags: implementation, math
Correct Solution:
```
import sys
fin = sys.stdin
fout = sys.stdout
temp = fin.readline().strip()
n = int(temp[:len(temp) - 1])
s = temp[-1]
ans = 0
if n % 2 == 0:
if n % 4 == 0:
ans += ((n - 1) // 2) * 6 + (n - 3)
else:
ans += (n // 2) * 6 + (n - 1)
else:
if n % 4... | output | 1 | 39,181 | 14 | 78,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,182 | 14 | 78,364 |
Tags: implementation, math
Correct Solution:
```
# You lost the game.
s = str(input())
l = s[len(s)-1]
r = int(s[:len(s)-1]) - 1
D = {}
D["f"] = 1
D["e"] = 2
D["d"] = 3
D["a"] = 4
D["b"] = 5
D["c"] = 6
q = r // 4
b = r % 4
if b % 2 == 0:
print(D[l]+16*q)
else:
print(D[l]+16*q+7)
``` | output | 1 | 39,182 | 14 | 78,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,183 | 14 | 78,366 |
Tags: implementation, math
Correct Solution:
```
s = input()
p = s[-1]
s = int(s[:-1])
ans1 = 0
if p == 'f':
ans1 = 1
if p == 'e':
ans1 = 2
if p == 'd':
ans1 = 3
if p == 'a':
ans1 = 4
if p == 'b':
ans1 = 5
if p == 'c':
ans1 = 6
ans = 16 * ((s - 1) // 4)
temp = s
while s % 4 != 0:
s -= 1
temp -= s
s = temp
if s =... | output | 1 | 39,183 | 14 | 78,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,184 | 14 | 78,368 |
Tags: implementation, math
Correct Solution:
```
from math import *
ns = input()
n = int(ns[:-1])
s = 'fedabc'.index(ns[-1]) + 1
n1 = n
if not n % 4:
n1 -= 1
lvl = n1 // 4
ans = lvl * 16
if not n % 2:
ans += 7
print(ans + s)
``` | output | 1 | 39,184 | 14 | 78,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,185 | 14 | 78,370 |
Tags: implementation, math
Correct Solution:
```
s = input()
n, ch = int(s[:-1]), s[-1]
D = {'a':4, 'b':5, 'c':6, 'd':3, 'e':2, 'f':1}
if n % 4 == 0 or (n+1) % 4 == 0:
x = n//2
x = x if x != 0 else 1
res = n-3 + (x-1)*6 + D[ch]
else:
x = n//2
res = n-1 + (x)*6 + D[ch]
print(res)
``` | output | 1 | 39,185 | 14 | 78,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,186 | 14 | 78,372 |
Tags: implementation, math
Correct Solution:
```
def get_ans(start):
t = (start - 1) // 4
ret = t * 16
if (start - 1) % 4 in (1, 3):
ret += 7
return ret
s = input()
seat = int(s[:-1])
p = s[-1]
ans = get_ans(seat)
if p == 'f':
ans += 0
elif p == 'e':
ans += 1
elif p == 'd':
ans... | output | 1 | 39,186 | 14 | 78,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to t... | instruction | 0 | 39,187 | 14 | 78,374 |
Tags: implementation, math
Correct Solution:
```
s = input()
n = int(s[:len(s) - 1])
n -= 1
ans = (n // 4) * 16
n %= 4
if n % 2 == 1:
ans += 6 + 1
d = {'a':4,'f':1,'e':2,'d':3,'b':5,'c':6}
print(ans + d[s[-1]])
``` | output | 1 | 39,187 | 14 | 78,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,188 | 14 | 78,376 |
Yes | output | 1 | 39,188 | 14 | 78,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,189 | 14 | 78,378 |
Yes | output | 1 | 39,189 | 14 | 78,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,190 | 14 | 78,380 |
Yes | output | 1 | 39,190 | 14 | 78,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,191 | 14 | 78,382 |
Yes | output | 1 | 39,191 | 14 | 78,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,192 | 14 | 78,384 |
No | output | 1 | 39,192 | 14 | 78,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,193 | 14 | 78,386 |
No | output | 1 | 39,193 | 14 | 78,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,194 | 14 | 78,388 |
No | output | 1 | 39,194 | 14 | 78,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' ... | instruction | 0 | 39,195 | 14 | 78,390 |
No | output | 1 | 39,195 | 14 | 78,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Arcady's garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are n inflorescences, numbered from 1 to n. Inflorescence number 1 is situated near base of tree and... | instruction | 0 | 39,323 | 14 | 78,646 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
from collections import deque
n = int(input())
parents = [0, 0] + [int(x) for x in input().split()]
children = [set([]) for _ in range(n + 1)]
for i, p in enumerate(parents):
children[p].add(i)
q = deque([(0, 1)])
levels = [0 for _ in range(n + 1)]
maxLev... | output | 1 | 39,323 | 14 | 78,647 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.