message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Shuseki Islands are an archipelago of 30001 small islands in the Yutampo Sea. The islands are evenly spaced along a line, numbered from 0 to 30000 from the west to the east. These islands ar... | instruction | 0 | 14,595 | 3 | 29,190 |
No | output | 1 | 14,595 | 3 | 29,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,610 | 3 | 29,220 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,610 | 3 | 29,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,611 | 3 | 29,222 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,611 | 3 | 29,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,612 | 3 | 29,224 |
Tags: data structures, greedy, sortings
Correct Solution:
```
import heapq
n,m=[int(x) for x in input().split()]
l1,r1=[int(x) for x in input().split()]
req=[]
start=[]
for i in range(n-1):
l2,r2=[int(x) for x in input().split()]
req.append((l2-r1,r2-l1,i))
l1,r1=l2,r2
have=[int(x) for x in input().split()]... | output | 1 | 14,612 | 3 | 29,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,613 | 3 | 29,226 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,613 | 3 | 29,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,614 | 3 | 29,228 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,614 | 3 | 29,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,615 | 3 | 29,230 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,615 | 3 | 29,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,616 | 3 | 29,232 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,616 | 3 | 29,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more... | instruction | 0 | 14,617 | 3 | 29,234 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of t... | output | 1 | 14,617 | 3 | 29,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago... | instruction | 0 | 14,618 | 3 | 29,236 |
Yes | output | 1 | 14,618 | 3 | 29,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago... | instruction | 0 | 14,619 | 3 | 29,238 |
Yes | output | 1 | 14,619 | 3 | 29,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago... | instruction | 0 | 14,620 | 3 | 29,240 |
No | output | 1 | 14,620 | 3 | 29,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago... | instruction | 0 | 14,621 | 3 | 29,242 |
No | output | 1 | 14,621 | 3 | 29,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago... | instruction | 0 | 14,622 | 3 | 29,244 |
No | output | 1 | 14,622 | 3 | 29,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago... | instruction | 0 | 14,623 | 3 | 29,246 |
No | output | 1 | 14,623 | 3 | 29,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
It is well-known that the best decoration for a flower bed in Sweetland are vanilla muffins. Seedlings of this plant need sun to grow up. Slastyona has m seedlings, and the j-th seedlin... | instruction | 0 | 14,693 | 3 | 29,386 |
No | output | 1 | 14,693 | 3 | 29,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Vasya got interested in finding extra-terrestrial intelligence. He made a simple extra-terrestrial signals’ receiver and was keeping a record of the signals for n days in a row. Each of... | instruction | 0 | 15,407 | 3 | 30,814 |
No | output | 1 | 15,407 | 3 | 30,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Vasya got interested in finding extra-terrestrial intelligence. He made a simple extra-terrestrial signals’ receiver and was keeping a record of the signals for n days in a row. Each of... | instruction | 0 | 15,408 | 3 | 30,816 |
No | output | 1 | 15,408 | 3 | 30,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Vasya got interested in finding extra-terrestrial intelligence. He made a simple extra-terrestrial signals’ receiver and was keeping a record of the signals for n days in a row. Each of... | instruction | 0 | 15,409 | 3 | 30,818 |
No | output | 1 | 15,409 | 3 | 30,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Vasya got interested in finding extra-terrestrial intelligence. He made a simple extra-terrestrial signals’ receiver and was keeping a record of the signals for n days in a row. Each of... | instruction | 0 | 15,410 | 3 | 30,820 |
No | output | 1 | 15,410 | 3 | 30,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main walking trail in Geraldion is absolutely straight, and it passes strictly from the north to the south, it is so long that no one has ever reached its ends in either of the two direction... | instruction | 0 | 15,470 | 3 | 30,940 |
No | output | 1 | 15,470 | 3 | 30,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main walking trail in Geraldion is absolutely straight, and it passes strictly from the north to the south, it is so long that no one has ever reached its ends in either of the two direction... | instruction | 0 | 15,471 | 3 | 30,942 |
No | output | 1 | 15,471 | 3 | 30,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main walking trail in Geraldion is absolutely straight, and it passes strictly from the north to the south, it is so long that no one has ever reached its ends in either of the two direction... | instruction | 0 | 15,472 | 3 | 30,944 |
No | output | 1 | 15,472 | 3 | 30,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The main walking trail in Geraldion is absolutely straight, and it passes strictly from the north to the south, it is so long that no one has ever reached its ends in either of the two direction... | instruction | 0 | 15,473 | 3 | 30,946 |
No | output | 1 | 15,473 | 3 | 30,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,650 | 3 | 31,300 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
import math
n,r=map(int,input().split())
a=list(map(int,input().split()))
new=[r for i in range(n)]
for i in range(1,n):
for j in range(i):
temp=(2*r)**2 - (a[i]-a[j])**2
if(temp>=0):
new[i]=max(new[i],... | output | 1 | 15,650 | 3 | 31,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,651 | 3 | 31,302 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
n, r = map(int, input().split())
a = input().split()
ans = []
for i in range(n):
res = r
for j in range(i):
if (abs(int(a[j]) - int(a[i])) <= 2 * r):
res = max(res, ans[j] + (4 * r * r - abs(int(a[j]) - int(a[i])) ** 2) ... | output | 1 | 15,651 | 3 | 31,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,652 | 3 | 31,304 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
from math import *
n, r = map(int, input().split())
x = list(map(int, input().split()))
ans = []
for i in range(n):
yi = r
for j in range(i):
if abs(x[j] - x[i]) <= 2 * r:
yi = max(yi, ans[j] + sqrt(4 * r**2 - (x[j] - ... | output | 1 | 15,652 | 3 | 31,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,653 | 3 | 31,306 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
import math as mt
import sys,string,bisect
input=sys.stdin.readline
from collections import deque,defaultdict
from decimal import *
getcontext().prec = 100
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(... | output | 1 | 15,653 | 3 | 31,307 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,654 | 3 | 31,308 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
n,r=map(int,input().split())
a=list(map(int,input().split()))
st=[]
for i in a:
left,right,cen=i-r,i+r,-1
for j in st:
if (not(j[0]>right or j[1]<left)) and cen< ((2*r)**2 - ((j[0]+j[1])/2 - i)**2 )**0.5 + j[2]:
cen=((2... | output | 1 | 15,654 | 3 | 31,309 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,655 | 3 | 31,310 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
import math
def get_n():
return int(input())
def get_int_vector():
return [int(x) for x in input().split()]
def list2string(list):
result = []
for i in list:
result.append(str(i))
return ':'.join(result)
def string2v... | output | 1 | 15,655 | 3 | 31,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,656 | 3 | 31,312 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
import math;
n, r = map(int, input().split());
X = list(map(int, input().split()));
C = [];
for q in range(len(X)):
y = r;
for w in range(len(C)):
if abs(X[w] - X[q]) <= 2 * r:
yc = math.sqrt(4 * r * r - (X[w] - X[q]) **... | output | 1 | 15,656 | 3 | 31,313 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she ... | instruction | 0 | 15,657 | 3 | 31,314 |
Tags: brute force, geometry, implementation, math
Correct Solution:
```
import math
n, r = tuple(int(k) for k in input().split())
xs = tuple(map(int, input().split()))
ts = []
for x2 in xs:
y2 = r
for (x1, y1) in ts:
dx = abs(x1 - x2)
if 2.0 * r - dx >= -10e-4:
y2 = max(y2, y1 + ma... | output | 1 | 15,657 | 3 | 31,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,658 | 3 | 31,316 |
Yes | output | 1 | 15,658 | 3 | 31,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,659 | 3 | 31,318 |
Yes | output | 1 | 15,659 | 3 | 31,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,660 | 3 | 31,320 |
Yes | output | 1 | 15,660 | 3 | 31,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,661 | 3 | 31,322 |
Yes | output | 1 | 15,661 | 3 | 31,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,662 | 3 | 31,324 |
No | output | 1 | 15,662 | 3 | 31,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,663 | 3 | 31,326 |
No | output | 1 | 15,663 | 3 | 31,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,664 | 3 | 31,328 |
No | output | 1 | 15,664 | 3 | 31,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y =... | instruction | 0 | 15,665 | 3 | 31,330 |
No | output | 1 | 15,665 | 3 | 31,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,852 | 3 | 31,704 |
Yes | output | 1 | 15,852 | 3 | 31,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,853 | 3 | 31,706 |
Yes | output | 1 | 15,853 | 3 | 31,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,854 | 3 | 31,708 |
Yes | output | 1 | 15,854 | 3 | 31,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,855 | 3 | 31,710 |
Yes | output | 1 | 15,855 | 3 | 31,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,856 | 3 | 31,712 |
No | output | 1 | 15,856 | 3 | 31,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,857 | 3 | 31,714 |
No | output | 1 | 15,857 | 3 | 31,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,858 | 3 | 31,716 |
No | output | 1 | 15,858 | 3 | 31,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot.... | instruction | 0 | 15,859 | 3 | 31,718 |
No | output | 1 | 15,859 | 3 | 31,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thanks to the Doctor's help, the rebels managed to steal enough gold to launch a full-scale attack on the Empire! However, Darth Vader is looking for revenge and wants to take back his gold.
The rebels have hidden the gold in various bases ... | instruction | 0 | 16,024 | 3 | 32,048 |
Tags: flows, graph matchings, graphs, shortest paths, sortings
Correct Solution:
```
def naiveSolve():
return
def floyd_warshall(n, edges):
dist = [[0 if i == j else float("inf") for i in range(n)] for j in range(n)]
# dist = [[float("inf") for i in range(n)] for j in range(n)] # if nodes a... | output | 1 | 16,024 | 3 | 32,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thanks to the Doctor's help, the rebels managed to steal enough gold to launch a full-scale attack on the Empire! However, Darth Vader is looking for revenge and wants to take back his gold.
The rebels have hidden the gold in various bases ... | instruction | 0 | 16,025 | 3 | 32,050 |
Tags: flows, graph matchings, graphs, shortest paths, sortings
Correct Solution:
```
import sys
def matching(node, visited, adj, assigned):
if node == -1:
return True
if visited[node]:
return False
visited[node] = True
for neighbor in adj[node]:
if matching(assigned[neighbor], visited, adj, assigned):
ass... | output | 1 | 16,025 | 3 | 32,051 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.