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.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his... | instruction | 0 | 50,435 | 8 | 100,870 |
No | output | 1 | 50,435 | 8 | 100,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his... | instruction | 0 | 50,436 | 8 | 100,872 |
No | output | 1 | 50,436 | 8 | 100,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his... | instruction | 0 | 50,437 | 8 | 100,874 |
No | output | 1 | 50,437 | 8 | 100,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the advanced algorithm class, n2 students sit in n rows and n columns. One day, a professor who teaches this subject comes into the class, asks the shortest student in each row to lift up his... | instruction | 0 | 50,438 | 8 | 100,876 |
No | output | 1 | 50,438 | 8 | 100,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjur... | instruction | 0 | 50,582 | 8 | 101,164 |
No | output | 1 | 50,582 | 8 | 101,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjur... | instruction | 0 | 50,583 | 8 | 101,166 |
No | output | 1 | 50,583 | 8 | 101,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjur... | instruction | 0 | 50,584 | 8 | 101,168 |
No | output | 1 | 50,584 | 8 | 101,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjur... | instruction | 0 | 50,585 | 8 | 101,170 |
No | output | 1 | 50,585 | 8 | 101,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,843 | 8 | 101,686 |
Tags: brute force, implementation
Correct Solution:
```
n,k = map(int,input().split())
A = list(map(int,input().split()))
best = n
best_ind = -1
for i in range(1,1001):
X = [i + k*j for j in range(n)]
cnt = 0
for j in range(n):
if X[j]!=A[j]:
cnt += 1
if cnt < best:
best_... | output | 1 | 50,843 | 8 | 101,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,844 | 8 | 101,688 |
Tags: brute force, implementation
Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
max_p = n
max_i = -1
for i in range(n):
p = 0
if a[i] - k * i >= 1:
for j in range(n):
if j < i:
if a[j] != a[i] - k * (i - j):
p +... | output | 1 | 50,844 | 8 | 101,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,845 | 8 | 101,690 |
Tags: brute force, implementation
Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
vis = [False] * n
answer = 0
for i in range(n):
t = 0
if not vis[i]:
for j in range(i, n):
if not vis[j]:
temp = a[j] - ((j - i) * k)
x... | output | 1 | 50,845 | 8 | 101,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,846 | 8 | 101,692 |
Tags: brute force, implementation
Correct Solution:
```
n,k=map(int,input().split())
L=list(map(int,input().split()))
a=min(L)
b=max(L)
ans=10**10
F=[]
for s in range(1,1001):
x=0
E=[]
for i in range(n):
if(abs((s+i*k)-L[i])):
x+=1
E.append(i)
if(x<ans):
ans=x
... | output | 1 | 50,846 | 8 | 101,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,847 | 8 | 101,694 |
Tags: brute force, implementation
Correct Solution:
```
a,b=map(int,input().split())
l=list(map(int,input().split()))
m=10000000000
s = 0
p=0
for i in range(1,1001):
x=0
for j in range(0,a):
h=i+j*b
if l[j]==h:
x=x+1
if x>=s:
p=i
s=x
print(a-s)
for i in range(0,a)... | output | 1 | 50,847 | 8 | 101,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,848 | 8 | 101,696 |
Tags: brute force, implementation
Correct Solution:
```
n, k = map(int, input().split())
arr = [int(z) for z in input().split()]
cap = 1001
potentialfirst=[]
ops = []
for pot in range(1,cap):
cnt = 0
r = []
for i in range(n):
if arr[i] != pot+i*k: cnt += 1
if arr[i] < pot+i*k:
... | output | 1 | 50,848 | 8 | 101,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,849 | 8 | 101,698 |
Tags: brute force, implementation
Correct Solution:
```
def check_bounds(start):
return heights[start]-start*k >= 1
n,k = map(int,input().split())
heights = list(map(int,input().split()))
seq_start = -1
lon_seq = [0]*n
max_len = 0
cur_seq= [0]*n
cur_len=0
for i,a in enumerate(heights):
cur_seq=[0]*n
cur_le... | output | 1 | 50,849 | 8 | 101,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the con... | instruction | 0 | 50,850 | 8 | 101,700 |
Tags: brute force, implementation
Correct Solution:
```
string=str(input())
astring=str(input())+' '
word=''
alist=[]
n=int(string[:string.index(' ')])
k=int(string[string.index(' ')+1:])
for char in astring:
if char!=' ':
word+=char
else:
alist.append(int(word))
word=''
minchange=n
m... | output | 1 | 50,850 | 8 | 101,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,851 | 8 | 101,702 |
Yes | output | 1 | 50,851 | 8 | 101,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,852 | 8 | 101,704 |
Yes | output | 1 | 50,852 | 8 | 101,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,853 | 8 | 101,706 |
Yes | output | 1 | 50,853 | 8 | 101,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,854 | 8 | 101,708 |
Yes | output | 1 | 50,854 | 8 | 101,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,855 | 8 | 101,710 |
No | output | 1 | 50,855 | 8 | 101,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,856 | 8 | 101,712 |
No | output | 1 | 50,856 | 8 | 101,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,857 | 8 | 101,714 |
No | output | 1 | 50,857 | 8 | 101,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garde... | instruction | 0 | 50,858 | 8 | 101,716 |
No | output | 1 | 50,858 | 8 | 101,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a... | instruction | 0 | 50,878 | 8 | 101,756 |
No | output | 1 | 50,878 | 8 | 101,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a... | instruction | 0 | 50,879 | 8 | 101,758 |
No | output | 1 | 50,879 | 8 | 101,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a... | instruction | 0 | 50,880 | 8 | 101,760 |
No | output | 1 | 50,880 | 8 | 101,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a... | instruction | 0 | 50,881 | 8 | 101,762 |
No | output | 1 | 50,881 | 8 | 101,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which she was on a stairs.
The stairs consists of n... | instruction | 0 | 50,974 | 8 | 101,948 |
Tags: constructive algorithms, data structures, math, two pointers
Correct Solution:
```
n=int(input())
string = input()
q1,q2,B,C=[],[],[],[]
A=0
for i in range(n):
if string[i] == "D":
q1.append(i)
else:
q2.append(n-1-i)
for i in range(len(q1)):
A+=(q1[i]-i)*2+1
B.append(A)
A=0
temp ... | output | 1 | 50,974 | 8 | 101,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which ... | instruction | 0 | 50,975 | 8 | 101,950 |
No | output | 1 | 50,975 | 8 | 101,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which ... | instruction | 0 | 50,976 | 8 | 101,952 |
No | output | 1 | 50,976 | 8 | 101,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which ... | instruction | 0 | 50,977 | 8 | 101,954 |
No | output | 1 | 50,977 | 8 | 101,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The academic year has just begun, but lessons and olympiads have already occupied all the free time. It is not a surprise that today Olga fell asleep on the Literature. She had a dream in which ... | instruction | 0 | 50,978 | 8 | 101,956 |
No | output | 1 | 50,978 | 8 | 101,957 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,091 | 8 | 102,182 |
"Correct Solution:
```
N, K = map(int, input().split())
h = [int(i) for i in input().split() if int(i) - K >= 0]
print(len(h))
``` | output | 1 | 51,091 | 8 | 102,183 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,092 | 8 | 102,184 |
"Correct Solution:
```
N, K = map(int, input().split())
vA = list(map(int, input().split()))
print(sum(a >= K for a in vA))
``` | output | 1 | 51,092 | 8 | 102,185 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,093 | 8 | 102,186 |
"Correct Solution:
```
N,K = map(int,input().split())
*H, = map(int,input().split())
print(sum(h>=K for h in H))
``` | output | 1 | 51,093 | 8 | 102,187 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,094 | 8 | 102,188 |
"Correct Solution:
```
N, K = map(int,input().split())
li_h = list(map(int, input().split()))
print(sum(i>=K for i in li_h))
``` | output | 1 | 51,094 | 8 | 102,189 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,095 | 8 | 102,190 |
"Correct Solution:
```
n,k = map(int,input().split())
ans = 0
for h in map(int,input().split()):
ans += (h>=k)
print(ans)
``` | output | 1 | 51,095 | 8 | 102,191 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,096 | 8 | 102,192 |
"Correct Solution:
```
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(map(lambda x:x>=K, H)))
``` | output | 1 | 51,096 | 8 | 102,193 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,097 | 8 | 102,194 |
"Correct Solution:
```
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(1 for h in H if h>=K))
``` | output | 1 | 51,097 | 8 | 102,195 |
Provide a correct Python 3 solution for this coding contest problem.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster... | instruction | 0 | 51,098 | 8 | 102,196 |
"Correct Solution:
```
N,K=map(int, input().split())
h=list(map(int, input().split()))
print(sum([H>=K for H in h]))
``` | output | 1 | 51,098 | 8 | 102,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How man... | instruction | 0 | 51,100 | 8 | 102,200 |
Yes | output | 1 | 51,100 | 8 | 102,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How man... | instruction | 0 | 51,101 | 8 | 102,202 |
Yes | output | 1 | 51,101 | 8 | 102,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How man... | instruction | 0 | 51,103 | 8 | 102,206 |
No | output | 1 | 51,103 | 8 | 102,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How man... | instruction | 0 | 51,104 | 8 | 102,208 |
No | output | 1 | 51,104 | 8 | 102,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How man... | instruction | 0 | 51,106 | 8 | 102,212 |
No | output | 1 | 51,106 | 8 | 102,213 |
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,519 | 8 | 103,038 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import sys
import math
from collections import Counter,defaultdict
input = sys.stdin.readline
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
def case():
... | output | 1 | 51,519 | 8 | 103,039 |
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,520 | 8 | 103,040 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
d={}
l={2:set(),4:set()}
for i in range(n):
if a[i] not in d:d[a[i]]=1
else:
d[a[i]]+=1
if d[a[i]]==2:
l[2].add(a[i])
if d[a[i]]==4... | output | 1 | 51,520 | 8 | 103,041 |
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,521 | 8 | 103,042 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
# from bisect import bisect_left
N = int(input())
A = {}
sq = set()
rec = set()
for a in map(int, input().split()):
c = A.setdefault(a, 0) + 1
A[a] = c
if c > 3:
sq.add(a)
if c > 1:
rec.add(a)
... | output | 1 | 51,521 | 8 | 103,043 |
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,522 | 8 | 103,044 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
z,zz=input,lambda:list(map(int,z().split()))
fast=lambda:stdin.readline().strip()
zzz=lambda:[int(i) for i in fast().split()]
szz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())
from string import *
from re i... | output | 1 | 51,522 | 8 | 103,045 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.