message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,070 | 8 | 150,140 |
Yes | output | 1 | 75,070 | 8 | 150,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,071 | 8 | 150,142 |
Yes | output | 1 | 75,071 | 8 | 150,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,072 | 8 | 150,144 |
Yes | output | 1 | 75,072 | 8 | 150,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,073 | 8 | 150,146 |
Yes | output | 1 | 75,073 | 8 | 150,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,074 | 8 | 150,148 |
No | output | 1 | 75,074 | 8 | 150,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,075 | 8 | 150,150 |
No | output | 1 | 75,075 | 8 | 150,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,076 | 8 | 150,152 |
No | output | 1 | 75,076 | 8 | 150,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's denote a k-step ladder as the following structure: exactly k + 2 wooden planks, of which
* two planks of length at least k+1 β the base of the ladder;
* k planks of length at least 1... | instruction | 0 | 75,077 | 8 | 150,154 |
No | output | 1 | 75,077 | 8 | 150,155 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,223 | 8 | 150,446 |
Tags: implementation
Correct Solution:
```
n=int(input())
A=list(map(int,input().split()))
mn=min(A)
mx=max(A)
for i in range(n):
if A[i]==mx:
mx_index=i
break
for i in range(n-1,-1,-1):
if A[i]==mn:
mn_index=i
break
out=(n-mn_index)+mx_index-1
if mn_index<mx_index:
out-=1
print(out)
``` | output | 1 | 75,223 | 8 | 150,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,224 | 8 | 150,448 |
Tags: implementation
Correct Solution:
```
# Har har mahadev
# author : @harsh kanani
n = int(input())
l = list(map(int, input().split()))
#c = l.copy()
maxi = max(l)
ind_max = l.index(maxi)
count = 0
if ind_max != 0:
for i in range(ind_max, -1, -1):
temp = l[i]
l[i] = l[i-1]
l[i-1] = temp... | output | 1 | 75,224 | 8 | 150,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,225 | 8 | 150,450 |
Tags: implementation
Correct Solution:
```
n=int(input())
t=[int(i)for i in input().split()]
w=sorted(t)
mn=n-1-t[::-1].index(w[0])
mx=t.index(w[-1])
print(n-mn+mx-1-[0,1][mn<mx])
``` | output | 1 | 75,225 | 8 | 150,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,226 | 8 | 150,452 |
Tags: implementation
Correct Solution:
```
input()
nums = list(map(int,input().split()))
a = nums.index(max(nums))
b = nums[::-1].index(min(nums))
print(a+b-( a > (len(nums)-b-1)))
``` | output | 1 | 75,226 | 8 | 150,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,227 | 8 | 150,454 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
max = float("-inf")
min = float("inf")
for i in range(len(a)):
if a[i] > max:
max = a[i]
imax = i
if a[i] <= min:
min = a[i]
imin = i
if imax < imin:
print(imax + len(a) - imin - 1... | output | 1 | 75,227 | 8 | 150,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,228 | 8 | 150,456 |
Tags: implementation
Correct Solution:
```
n = int(input())
inputs = list(map(int,input().split()))
sHeights = []
for i in range(n):
sHeights.append(int(inputs[i]))
maxIndex = sHeights.index(max(sHeights))
minHeight = min(sHeights)
minIndex = 0
for i in range(n):
if sHeights[i] == minHeight:
minIndex =... | output | 1 | 75,228 | 8 | 150,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,229 | 8 | 150,458 |
Tags: implementation
Correct Solution:
```
n=int(input())
N=input().split()
ma=int(N[0])
mi=int(N[0])
a=0
b=0
i=0
while i<n:
if int(N[i])>ma:
ma=int(N[i])
a=i
elif int(N[i])<=mi:
mi=int(N[i])
b=i
i=i+1
if a<=b:
print(int(a+n-b-1))
else:
print(int(a+n-b-2))
``` | output | 1 | 75,229 | 8 | 150,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the milit... | instruction | 0 | 75,230 | 8 | 150,460 |
Tags: implementation
Correct Solution:
```
n=int(input())
a=[int(x) for x in input().split()]
maxi=0
br=0
for i in range(0,n):
if a[i]>a[maxi]:
maxi=i
for i in range(maxi, 0, -1):
a[i], a[i-1]=a[i-1], a[i]
br+=1
mini=n-1
for i in range(n-1, 0, -1):
if a[i]<a[mini]:
mini=i
br+=n-1-mini
pr... | output | 1 | 75,230 | 8 | 150,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,231 | 8 | 150,462 |
Yes | output | 1 | 75,231 | 8 | 150,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,232 | 8 | 150,464 |
Yes | output | 1 | 75,232 | 8 | 150,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,233 | 8 | 150,466 |
Yes | output | 1 | 75,233 | 8 | 150,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,234 | 8 | 150,468 |
Yes | output | 1 | 75,234 | 8 | 150,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,235 | 8 | 150,470 |
No | output | 1 | 75,235 | 8 | 150,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,236 | 8 | 150,472 |
No | output | 1 | 75,236 | 8 | 150,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,237 | 8 | 150,474 |
No | output | 1 | 75,237 | 8 | 150,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers... | instruction | 0 | 75,238 | 8 | 150,476 |
No | output | 1 | 75,238 | 8 | 150,477 |
Provide a correct Python 3 solution for this coding contest problem.
K: Relief (Angel Relief)
Tenma, an angel, decides to save a city.
The city has a rectangular shape divided into north-south $ H $ parcels x east-west $ W $ parcels, with houses in each parcel.
The $ X $ th section from the north and the $ Y $ th s... | instruction | 0 | 75,857 | 8 | 151,714 |
"Correct Solution:
```
def f(): return map(int,input().split())
h,w=f();print(sum([sum([(x+1)*(w-x)*v for x,v in enumerate(f())])*(y+1)*(h-y)for y in range(h)]))
``` | output | 1 | 75,857 | 8 | 151,715 |
Provide a correct Python 3 solution for this coding contest problem.
There was a powerful school where powerful people gathered. At the athletic meet of the powerful school, powerful people march in a formation.
While the powerhouses always want to show off their power, most of them don't want to walk on their own. S... | instruction | 0 | 76,613 | 8 | 153,226 |
"Correct Solution:
```
from itertools import accumulate
INF = 10 ** 20
n = int(input())
c_lst = []
w_lst = []
for _ in range(n):
c, w = map(int, input().split())
c_lst.append(c)
w_lst.append(w)
w_acc = [0] + list(accumulate(w_lst))
connect = [[None] * n for _ in range(n)]
for i in range(n):
connect[i][i] = True... | output | 1 | 76,613 | 8 | 153,227 |
Provide a correct Python 3 solution for this coding contest problem.
There was a powerful school where powerful people gathered. At the athletic meet of the powerful school, powerful people march in a formation.
While the powerhouses always want to show off their power, most of them don't want to walk on their own. S... | instruction | 0 | 76,614 | 8 | 153,228 |
"Correct Solution:
```
import sys
f = sys.stdin
n = int(f.readline())
s = [list(map(int, line.split())) for line in f]
p = [[i==j for j in range(n + 1)] for i in range(n + 1)]
c = [0] + [c for c,w in s]
sum_w = [0] + [w for c,w in s]
for i in range(1, len(sum_w)):
sum_w[i] += sum_w[i - 1]
for length in range... | output | 1 | 76,614 | 8 | 153,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There was a powerful school where powerful people gathered. At the athletic meet of the powerful school, powerful people march in a formation.
While the powerhouses always want to show off thei... | instruction | 0 | 76,615 | 8 | 153,230 |
No | output | 1 | 76,615 | 8 | 153,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There was a powerful school where powerful people gathered. At the athletic meet of the powerful school, powerful people march in a formation.
While the powerhouses always want to show off thei... | instruction | 0 | 76,616 | 8 | 153,232 |
No | output | 1 | 76,616 | 8 | 153,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There was a powerful school where powerful people gathered. At the athletic meet of the powerful school, powerful people march in a formation.
While the powerhouses always want to show off thei... | instruction | 0 | 76,617 | 8 | 153,234 |
No | output | 1 | 76,617 | 8 | 153,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There was a powerful school where powerful people gathered. At the athletic meet of the powerful school, powerful people march in a formation.
While the powerhouses always want to show off thei... | instruction | 0 | 76,618 | 8 | 153,236 |
No | output | 1 | 76,618 | 8 | 153,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n segments on the Ox-axis. You can drive a nail in any integer point on the Ox-axis line nail so, that all segments containing this point, are considered nailed down. If the nail passes through endpoint of some segment, this se... | instruction | 0 | 76,984 | 8 | 153,968 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
l = []
cur = set()
for i in range(n):
a, b = map(int, input().split())
a, b = min(a,b), max(a,b)
l.append((a, 1, i))
l.append((b, 2, i))
l.sort()
ans = []
for i in l:
if i[1] == 1:
cur.add(i[2])
elif i[2] in cur:
ans.a... | output | 1 | 76,984 | 8 | 153,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n segments on the Ox-axis. You can drive a nail in any integer point on the Ox-axis line nail so, that all segments containing this point, are considered nailed down. If the nail passes through endpoint of some segment, this se... | instruction | 0 | 76,985 | 8 | 153,970 |
Tags: greedy, sortings
Correct Solution:
```
n=int(input())
c=[]
for i in range(n):
x,y=map(int,input().split())
if x>y: x,y=y,x
c.append([x,0,i])
c.append([y,1,i])
c.sort()
ans=0
stack=[]
b=[]
for z in c:
if z[1]==0:
stack.append(z[2])
else:
if z[2] in stack:
ans+=1
... | output | 1 | 76,985 | 8 | 153,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n segments on the Ox-axis. You can drive a nail in any integer point on the Ox-axis line nail so, that all segments containing this point, are considered nailed down. If the nail passes through endpoint of some segment, this se... | instruction | 0 | 76,990 | 8 | 153,980 |
Tags: greedy, sortings
Correct Solution:
```
from sys import stdin
#import heapq
n = int(stdin.readline())
i = []
for board in range(n):
a,b = sorted([int(x) for x in stdin.readline().split()])
i.append([a,b])
i.sort()
end = 10000000
nails = []
for s,e in i:
if s > end:
nails.append(end)
... | output | 1 | 76,990 | 8 | 153,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is... | instruction | 0 | 77,059 | 8 | 154,118 |
Yes | output | 1 | 77,059 | 8 | 154,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is... | instruction | 0 | 77,061 | 8 | 154,122 |
No | output | 1 | 77,061 | 8 | 154,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is... | instruction | 0 | 77,062 | 8 | 154,124 |
No | output | 1 | 77,062 | 8 | 154,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is... | instruction | 0 | 77,063 | 8 | 154,126 |
No | output | 1 | 77,063 | 8 | 154,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is... | instruction | 0 | 77,064 | 8 | 154,128 |
No | output | 1 | 77,064 | 8 | 154,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,100 | 8 | 154,200 |
Tags: brute force, implementation
Correct Solution:
```
def calc_trees(cont: list, start_row: int, start_col: int, area_h, area_w) -> int:
trees = 0
for i in range(start_row, start_row + area_h):
for j in range(start_col, start_col + area_w):
trees += cont[i][j]
return trees
n, m = [in... | output | 1 | 77,100 | 8 | 154,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,101 | 8 | 154,202 |
Tags: brute force, implementation
Correct Solution:
```
import sys
inputlist=sys.stdin.readlines()
def traverse_row(s,b,m):
sum_of_b_elements=0
for i in range(b):
sum_of_b_elements=sum_of_b_elements+s[i]
i=i+1
min_now=sum_of_b_elements
#print(sum_of_b_elements)
while(i<m):
sum_of... | output | 1 | 77,101 | 8 | 154,203 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,102 | 8 | 154,204 |
Tags: brute force, implementation
Correct Solution:
```
n,m = [int(s) for s in input().split()]
g = []
for i in range(n):
g.append(input().split())
x,y = [int(s) for s in input().split()]
def getTrees(a,b,Index):
count = 0
for i in range(Index[0],Index[0] + a):
for j in range(Index[1],Index[1] ... | output | 1 | 77,102 | 8 | 154,205 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,103 | 8 | 154,206 |
Tags: brute force, implementation
Correct Solution:
```
import sys
import string
from collections import Counter, defaultdict
from math import fsum, sqrt, gcd, ceil, factorial
from operator import *
from itertools import accumulate
inf = float("inf")
# input = sys.stdin.readline
flush = lambda: sys.stdout.flush
comb ... | output | 1 | 77,103 | 8 | 154,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,104 | 8 | 154,208 |
Tags: brute force, implementation
Correct Solution:
```
n,m= map(int,input().split())
t=[]
for j in range(n):
t.append(list(map(int,input().split())))
a,b = map(int,input().split())
ans=99999999
for i in range(n-a+1):
for j in range(m-b+1):
u=0
for x in range(i,i+a):
for y... | output | 1 | 77,104 | 8 | 154,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,105 | 8 | 154,210 |
Tags: brute force, implementation
Correct Solution:
```
n, m = map(int, input().split())
t = [[0] * (m + 1)] + [[] for i in range(n)]
t[1] = [0] + list(map(int, input().split()))
for j in range(2, m + 1): t[1][j] += t[1][j - 1]
for i in range(2, n + 1):
t[i] = [0] + list(map(int, input().split()))
for j in rang... | output | 1 | 77,105 | 8 | 154,211 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,106 | 8 | 154,212 |
Tags: brute force, implementation
Correct Solution:
```
i=input
g=range
n,m=map(int,i().split())
M=[]
for _ in g(n):
M+=list(map(int,i().split()))
p=list(map(int,i().split()))
# this is supposed to be at least (a,b) && (a,b) in dimensions
R=[[0 for x in g(m)]for y in g(n)]
x=2500
for k in g(2):
for r in g(n-p[k]+1)... | output | 1 | 77,106 | 8 | 154,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a beautiful garden where wonderful fruit trees grow and yield fantastic harvest every year. But lately thieves started to sneak into the garden at nights and steal the fruit too often. Vasya canβt spend the nights in the garden and... | instruction | 0 | 77,107 | 8 | 154,214 |
Tags: brute force, implementation
Correct Solution:
```
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def MAP2():return map(float,input().split())
def LIST(): return list(map(int, input().split()))
def STRING(): return input()
import string
import sys
from h... | output | 1 | 77,107 | 8 | 154,215 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cubes stacked vertically on a desk.
You are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is `0`, and blue if that character is `1`.
You can perform the following operation an... | instruction | 0 | 78,063 | 8 | 156,126 |
"Correct Solution:
```
a=input()
b=a.count("0")
c=a.count("1")
print(min(b,c)*2)
``` | output | 1 | 78,063 | 8 | 156,127 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cubes stacked vertically on a desk.
You are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is `0`, and blue if that character is `1`.
You can perform the following operation an... | instruction | 0 | 78,064 | 8 | 156,128 |
"Correct Solution:
```
s=input()
a=s.count("1")
b=s.count("0")
print(min(a,b)*2)
``` | output | 1 | 78,064 | 8 | 156,129 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cubes stacked vertically on a desk.
You are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is `0`, and blue if that character is `1`.
You can perform the following operation an... | instruction | 0 | 78,065 | 8 | 156,130 |
"Correct Solution:
```
S=input();print(len(S)-abs(S.count("0")-S.count("1")))
``` | output | 1 | 78,065 | 8 | 156,131 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.