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.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and anoth... | instruction | 0 | 51,523 | 8 | 103,046 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
n=int(input())
arr=list(map(int,input().split()))
ct=dict()
for k in arr:
if(k not in ct):
ct[k]=0
ct[k]+=1
fr=0;tw=0
for i in ct:
fr+=ct[i]//4
tw+=(ct[i]%4)//2
t=int(input())
for i in range(t):
p=in... | output | 1 | 51,523 | 8 | 103,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and anoth... | instruction | 0 | 51,524 | 8 | 103,048 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split(' ')))
numP = 0
sqr = 0
cnt = [0] * 100010
for x in a:
cnt[x] += 1
if (cnt[x] % 2 == 0):
numP += 1
if (cnt[x] == 4):
sqr += 1
q = int(input())
for i i... | output | 1 | 51,524 | 8 | 103,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and anoth... | instruction | 0 | 51,525 | 8 | 103,050 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import os
import heapq
import sys,threading
import math
import bisect
import operator
from collections import defaultdict
sys.setrecursionlimit(10**5)
from io import BytesIO, IOBase
def gcd(a,b):
if b==0:
return a
... | output | 1 | 51,525 | 8 | 103,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-zero area: one in the shape of a square and anoth... | instruction | 0 | 51,526 | 8 | 103,052 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
'''
Author: nuoyanli
Date: 2020-08-07 21:14:34
LastEditTime: 2020-08-07 23:09:59
Author's blog: https://blog.nuoyanli.com/
Description: Plum blossom from the bitter cold!
'''
import sys
readline = sys.stdin.buffer.readline
read... | output | 1 | 51,526 | 8 | 103,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,527 | 8 | 103,054 |
Yes | output | 1 | 51,527 | 8 | 103,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,528 | 8 | 103,056 |
Yes | output | 1 | 51,528 | 8 | 103,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,529 | 8 | 103,058 |
Yes | output | 1 | 51,529 | 8 | 103,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,530 | 8 | 103,060 |
Yes | output | 1 | 51,530 | 8 | 103,061 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,531 | 8 | 103,062 |
Yes | output | 1 | 51,531 | 8 | 103,063 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,532 | 8 | 103,064 |
No | output | 1 | 51,532 | 8 | 103,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,533 | 8 | 103,066 |
No | output | 1 | 51,533 | 8 | 103,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,534 | 8 | 103,068 |
No | output | 1 | 51,534 | 8 | 103,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two storages with non-ze... | instruction | 0 | 51,535 | 8 | 103,070 |
No | output | 1 | 51,535 | 8 | 103,071 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,964 | 8 | 103,928 |
"Correct Solution:
```
N=int(input())
A=[i for i in map(int,input().split())]
X=[0]*N
X[0]=sum(A[0::2])-sum(A[1::2])
for i in range(1, N):
X[i]=2*A[i-1]-X[i-1]
print(' '.join(map(str,X)))
``` | output | 1 | 51,964 | 8 | 103,929 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,965 | 8 | 103,930 |
"Correct Solution:
```
N = int(input())
a = [int(i) for i in input().split()]
b=[0]*(N+1)
b[0] = sum(a)-2*sum(a[1::2])
for i in range(1,N+1):
b[i] = 2*a[i-1] - b[i-1]
print(*b[:N])
``` | output | 1 | 51,965 | 8 | 103,931 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,966 | 8 | 103,932 |
"Correct Solution:
```
N=int(input())
A=list(map(int,input().split()))
s=sum(A)
ans=[s-2*sum(A[1::2])]
for i in range(0,N-1):
ans.append(A[i]*2-ans[-1])
print(*ans)
``` | output | 1 | 51,966 | 8 | 103,933 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,967 | 8 | 103,934 |
"Correct Solution:
```
N = int(input())
l_a = list(map(int,input().split()))
b_x = sum(l_a) - sum(l_a[1::2])*2
l_x =[b_x]
for s in range(N-1):
x = l_a[s]*2 - b_x
l_x.append(x)
b_x = x
print(*l_x)
``` | output | 1 | 51,967 | 8 | 103,935 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,968 | 8 | 103,936 |
"Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a0=sum(a)//2-sum(a[1::2])
ans=[a0*2]
for i in range(n-2):
ans.append(a[i]*2-ans[-1])
ans.append((a[-1]-a0)*2)
print(*ans)
``` | output | 1 | 51,968 | 8 | 103,937 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,969 | 8 | 103,938 |
"Correct Solution:
```
n=int(input())
A=list(map(int,input().split()))
X=[0]*n
S=sum(A)
A2=0
for i in range(1,n-1,2):
A2+=A[i]
X[0]=S-2*A2
for i in range(1,n):
X[i]=2*A[i-1]-X[i-1]
print(*X)
``` | output | 1 | 51,969 | 8 | 103,939 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,970 | 8 | 103,940 |
"Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
ans[0] = sum(a) - sum(a[1::2])*2
for i in range(1, n):
ans[i] = (a[i-1] - ans[i-1]//2) * 2
print(*ans)
``` | output | 1 | 51,970 | 8 | 103,941 |
Provide a correct Python 3 solution for this coding contest problem.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain... | instruction | 0 | 51,971 | 8 | 103,942 |
"Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
ans = []
x0 = sum(a) - 2 * sum(a[1::2])
ans.append(x0)
for i in range(1,n):
ans.append(2*a[i-1] - ans[-1])
print(*ans)
``` | output | 1 | 51,971 | 8 | 103,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,972 | 8 | 103,944 |
Yes | output | 1 | 51,972 | 8 | 103,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,973 | 8 | 103,946 |
Yes | output | 1 | 51,973 | 8 | 103,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,975 | 8 | 103,950 |
Yes | output | 1 | 51,975 | 8 | 103,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,976 | 8 | 103,952 |
No | output | 1 | 51,976 | 8 | 103,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,977 | 8 | 103,954 |
No | output | 1 | 51,977 | 8 | 103,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,978 | 8 | 103,956 |
No | output | 1 | 51,978 | 8 | 103,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.
Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Da... | instruction | 0 | 51,979 | 8 | 103,958 |
No | output | 1 | 51,979 | 8 | 103,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,314 | 8 | 104,628 |
Tags: implementation
Correct Solution:
```
k = int(input())
for _ in range(k):
n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = 0
for i in range(n):
ans = max(ans, min(a[i], i+1))
print(ans)
``` | output | 1 | 52,314 | 8 | 104,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,315 | 8 | 104,630 |
Tags: implementation
Correct Solution:
```
import sys
import math
#to faster python
Input=sys.stdin.readline
get_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read non spaced string and elements are integers to list of int
get_int = lambda: int(sys.stdin.readline().strip())
#to print faster
p... | output | 1 | 52,315 | 8 | 104,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,316 | 8 | 104,632 |
Tags: implementation
Correct Solution:
```
n = int(input())
for nn in range(n):
n_of_elements = int(input())
list_of_elements = sorted(list(map(int, input().split())))
for el in range(n_of_elements, 0, -1):
if el <= list_of_elements[n_of_elements - el]:
print(el)
break
``` | output | 1 | 52,316 | 8 | 104,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,317 | 8 | 104,634 |
Tags: implementation
Correct Solution:
```
'''
Created on 2019. 9. 21.
@author: kkhh88
'''
#q = int(input())
#x, y = map(int,input().split(' '))
#print (' '.join(list(map(str, s))))
q = int(input())
for _ in range(q):
n = int(input())
s = list(map(int,input().split(' ')))
s.sort(reverse = True)
cnt = ... | output | 1 | 52,317 | 8 | 104,635 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,318 | 8 | 104,636 |
Tags: implementation
Correct Solution:
```
k = int(input())
for i in range(k):
n = int(input())
a = reversed(sorted(list(map(int, input().split()))))
ret, w = 1, 1
for i in a:
m = min(w, i)
ret = max(m, ret)
w += 1
print(ret)
``` | output | 1 | 52,318 | 8 | 104,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,319 | 8 | 104,638 |
Tags: implementation
Correct Solution:
```
t=int(input())
while t:
t-=1
n=int(input())
s=input()
L=s.split(" ")
for i in range(n):
L[i]=int(L[i])
L.sort()
maxi=0
for i in range(n):
ini=n-i-1
if(i+1<=int(L[ini])):
maxi+=1
else:
break... | output | 1 | 52,319 | 8 | 104,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,320 | 8 | 104,640 |
Tags: implementation
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
l.sort()
l.reverse()
# print(l)
a=None
v=[]
for i in range(1,len(l)+1):
v.append(min(i,l[i-1]))
# print(v)
print(max(v))
v.clear()
``` | output | 1 | 52,320 | 8 | 104,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Ujan wants to make a square roof. He will first ch... | instruction | 0 | 52,321 | 8 | 104,642 |
Tags: implementation
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
arr = arr[-1::-1]
cnt = 1
final = []
for i in range(n):
l = min(arr[:cnt])
ans = min(l,cnt)
final.append(ans)
cnt+=1
p... | output | 1 | 52,321 | 8 | 104,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,322 | 8 | 104,644 |
Yes | output | 1 | 52,322 | 8 | 104,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,323 | 8 | 104,646 |
Yes | output | 1 | 52,323 | 8 | 104,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,324 | 8 | 104,648 |
Yes | output | 1 | 52,324 | 8 | 104,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,325 | 8 | 104,650 |
Yes | output | 1 | 52,325 | 8 | 104,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,326 | 8 | 104,652 |
No | output | 1 | 52,326 | 8 | 104,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,327 | 8 | 104,654 |
No | output | 1 | 52,327 | 8 | 104,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,328 | 8 | 104,656 |
No | output | 1 | 52,328 | 8 | 104,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ujan decided to make a new wooden roof for the house. He has n rectangular planks numbered from 1 to n. The i-th plank has size a_i × 1 (that is, the width is 1 and the height is a_i).
Now, Uja... | instruction | 0 | 52,329 | 8 | 104,658 |
No | output | 1 | 52,329 | 8 | 104,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an area map that is a rectangular matrix n × m, each cell of the matrix contains the average height of a corresponding area part. Peter works for a company that has to build several cit... | instruction | 0 | 52,471 | 8 | 104,942 |
No | output | 1 | 52,471 | 8 | 104,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an area map that is a rectangular matrix n × m, each cell of the matrix contains the average height of a corresponding area part. Peter works for a company that has to build several cit... | instruction | 0 | 52,472 | 8 | 104,944 |
No | output | 1 | 52,472 | 8 | 104,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an area map that is a rectangular matrix n × m, each cell of the matrix contains the average height of a corresponding area part. Peter works for a company that has to build several cit... | instruction | 0 | 52,473 | 8 | 104,946 |
No | output | 1 | 52,473 | 8 | 104,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an area map that is a rectangular matrix n × m, each cell of the matrix contains the average height of a corresponding area part. Peter works for a company that has to build several cit... | instruction | 0 | 52,474 | 8 | 104,948 |
No | output | 1 | 52,474 | 8 | 104,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Niwel is a little golden bear. As everyone knows, bears live in forests, but Niwel got tired of seeing all the trees so he decided to move to the city.
In the city, Niwel took on a job managing bears to deliver goods. The city that he lives... | instruction | 0 | 52,636 | 8 | 105,272 |
Tags: binary search, flows, graphs
Correct Solution:
```
from collections import defaultdict, deque
adj = defaultdict(lambda: defaultdict(lambda: 0))
def bfs(graph, inicio, destino, parent):
parent.clear()
queue = deque()
queue.append([inicio, float("Inf")])
parent[inicio] = -2
while (len(queue)):... | output | 1 | 52,636 | 8 | 105,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Niwel is a little golden bear. As everyone knows, bears live in forests, but Niwel got tired of seeing all the trees so he decided to move to the city.
In the city, Niwel took on a job managing bears to deliver goods. The city that he lives... | instruction | 0 | 52,637 | 8 | 105,274 |
Tags: binary search, flows, graphs
Correct Solution:
```
from queue import Queue
def addEdge(s, t, flow):
E[s].append((len(E[t]), t, flow))
E[t].append((len(E[s])-1, s, 0))
def mkLevel():
global src, des, E, lvl
for i in range(n):
lvl[i] = -1
lvl[src] = 0
q = Queue()
q.put(src... | output | 1 | 52,637 | 8 | 105,275 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.