message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,620 | 14 | 9,240 |
Tags: combinatorics, math
Correct Solution:
```
a=int(input())
print(4**(a-3)*3*(3*a-1))
``` | output | 1 | 4,620 | 14 | 9,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,621 | 14 | 9,242 |
Tags: combinatorics, math
Correct Solution:
```
n = int(input())
N = 2*n-2
ans = 0;
for i in range(n):
l_cnt = i
r_cnt = N - i - n
if r_cnt < 0: break
m = 4
p = int(l_cnt > 0) + int(r_cnt > 0)
m *= 3 ** p
l_cnt = max(0, l_cnt - 1)
r_cnt = max(0, r_cnt - 1)
p = l_cnt + r_cnt;
... | output | 1 | 4,621 | 14 | 9,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,622 | 14 | 9,244 |
Tags: combinatorics, math
Correct Solution:
```
# Принимаем входные данные
n = int(input())
# Вычисляем ответ
ways_count = max(((n - 3) * 36 * 4**(n - 4)), (n - 3) * 36) # Когда машины стоят не по краям
ways_count += 2 * (3 * 4**(n-3)) * 4 # Когда машины стоят по краям
# Выводим результат
print(int(ways_count))
``` | output | 1 | 4,622 | 14 | 9,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,623 | 14 | 9,246 |
Tags: combinatorics, math
Correct Solution:
```
n = int(input())
print(int(4*(n-3)*9*4**(n-4) + 2*4*3*4**(n-3)))
``` | output | 1 | 4,623 | 14 | 9,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,624 | 14 | 9,248 |
Tags: combinatorics, math
Correct Solution:
```
n = int(input())
print(6 * 4**(n-2) + 9 * (n-3) * 4**(n-3))
``` | output | 1 | 4,624 | 14 | 9,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,625 | 14 | 9,250 |
Tags: combinatorics, math
Correct Solution:
```
n = int(input())
res = 0
res += 8 * (3 * pow(4, n - 3))
res += ((n - 3) * 4 * 9 * int(pow(4, n - 4)))
print(res)
``` | output | 1 | 4,625 | 14 | 9,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists... | instruction | 0 | 4,626 | 14 | 9,252 |
Tags: combinatorics, math
Correct Solution:
```
import sys,math
inputs = iter(sys.stdin.readlines())
n = int(next(inputs))
print(int(2*4*3*pow(4,n-3) + (n-3)*4*3**2*pow(4,n-4)))
``` | output | 1 | 4,626 | 14 | 9,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,667 | 14 | 9,334 |
Tags: implementation, math
Correct Solution:
```
n, m, k = map(int, input().split())
L = int(k/(m+m))
if k%(m+m)!=0:L = L + 1
D = (L-1)*(m+m) + 1
if k%2==0:D = D + 1
D = int((k-D)/2) + 1
st = "L"
if k%2==0:st = "R"
print(L, D, st)
``` | output | 1 | 4,667 | 14 | 9,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,668 | 14 | 9,336 |
Tags: implementation, math
Correct Solution:
```
import math
n,m,k=map(int,input().split())
l=math.ceil(k/(2*m))
se=math.ceil((k-((l-1)*2*m))/2)
print(l,se,end=' ')
if k%2==0:print('R')
else:print('L')
``` | output | 1 | 4,668 | 14 | 9,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,669 | 14 | 9,338 |
Tags: implementation, math
Correct Solution:
```
n,m,k = map(int,input().split())
a = []
p = 1
for i in range(m): a += [[p,p+1]]; p += 2
p -= 1
x = -(-k//p)
if k % 2 == 0: z = "R"
else: z = "L"
if k % p == 0: y = m
else:
for i in range(m):
if k%p in a[i]: y = i+1; break
print(x,y,z)
``` | output | 1 | 4,669 | 14 | 9,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,670 | 14 | 9,340 |
Tags: implementation, math
Correct Solution:
```
# Santa Claus and a Place in a Class
def santa(n, m, k):
direction = 'R'
if k & 1 == 1:
direction = 'L'
lane = 2
while True:
if k <= (m * lane):
prev = (m * (lane - 2)) + 1
desk = 1
while True:
... | output | 1 | 4,670 | 14 | 9,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,671 | 14 | 9,342 |
Tags: implementation, math
Correct Solution:
```
n,m,k=map(int,input().split())
a=k%2
x={1:"L",0:"R"}
r=k//(2*m)
if(k%(2*m)!=0):
r+=1
d=(k-(m*(r-1)*2))
if(d%2!=0):
d+=1
d=d//2
print(r,d,x[a])
``` | output | 1 | 4,671 | 14 | 9,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,672 | 14 | 9,344 |
Tags: implementation, math
Correct Solution:
```
n, m, k = map(int, input().split())
z = (k + 2 * m - 1) // (2 * m)
q = k % (2 * m)
if q == 0:
q = 2 * m
q = (q + 1) // 2
w = q % 2
if k % 2:
w = 'L'
else:
w = 'R'
print(z, q, w)
``` | output | 1 | 4,672 | 14 | 9,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,673 | 14 | 9,346 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
def solve(n, m, k):
t = ceil(k / 2)
x = m if t % m == 0 else t % m
y = ceil(t / m)
p = 'L' if k % 2 == 1 else 'R'
return f'{y} {x} {p}'
def main():
n, m, k = list(map(int, input().split()))
print(solve(n, m, k))
m... | output | 1 | 4,673 | 14 | 9,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes ar... | instruction | 0 | 4,674 | 14 | 9,348 |
Tags: implementation, math
Correct Solution:
```
# A. Santa Claus and a Place in a Class
n, m, k = map(int, input().split())
r = k // (2 * m)
if k % (2 * m) != 0:
r += 1
d = (k - (r - 1) * 2 * m) // 2
if (k - (r - 1) * 2 * m) % 2 != 0:
d += 1
s = "L" if k % 2 != 0 else "R"
print(r, d, s)
``` | output | 1 | 4,674 | 14 | 9,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the final part of fashion show all models come to the stage and stay in one row and fashion designer stays to right to model on the right. During the rehearsal, Izabella noticed, that row... | instruction | 0 | 4,747 | 14 | 9,494 |
No | output | 1 | 4,747 | 14 | 9,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the final part of fashion show all models come to the stage and stay in one row and fashion designer stays to right to model on the right. During the rehearsal, Izabella noticed, that row... | instruction | 0 | 4,748 | 14 | 9,496 |
No | output | 1 | 4,748 | 14 | 9,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the final part of fashion show all models come to the stage and stay in one row and fashion designer stays to right to model on the right. During the rehearsal, Izabella noticed, that row... | instruction | 0 | 4,749 | 14 | 9,498 |
No | output | 1 | 4,749 | 14 | 9,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
During the final part of fashion show all models come to the stage and stay in one row and fashion designer stays to right to model on the right. During the rehearsal, Izabella noticed, that row... | instruction | 0 | 4,750 | 14 | 9,500 |
No | output | 1 | 4,750 | 14 | 9,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none. Additionally, each person has exactly one chil... | instruction | 0 | 5,211 | 14 | 10,422 |
Tags: constructive algorithms, divide and conquer, dp, math, trees
Correct Solution:
```
from heapq import *
import sys
def ng():
print("NO")
exit()
n, k = map(int,input().split())
if (n,k)==(1,0):
print("YES")
print(0)
exit()
ans = [0] * n
popcnt = lambda x: bin(x).count("1")
if n & 1 == 0 or n... | output | 1 | 5,211 | 14 | 10,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none. Additionally, each person has exactly one chil... | instruction | 0 | 5,212 | 14 | 10,424 |
Tags: constructive algorithms, divide and conquer, dp, math, trees
Correct Solution:
```
from heapq import *
import sys
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.s... | output | 1 | 5,212 | 14 | 10,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none. Additionally, each person has exactly one chil... | instruction | 0 | 5,213 | 14 | 10,426 |
Tags: constructive algorithms, divide and conquer, dp, math, trees
Correct Solution:
```
from heapq import *
import sys
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.s... | output | 1 | 5,213 | 14 | 10,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none. Additionally, each person has exactly one chil... | instruction | 0 | 5,214 | 14 | 10,428 |
Tags: constructive algorithms, divide and conquer, dp, math, trees
Correct Solution:
```
def ng():print("NO");exit()
n, k = map(int,input().split())
if (n,k)==(1,0):print("YES");print(0);exit()
ans = [0] * n;u = 0;popcnt = lambda x: bin(x).count("1")
if n & 1 == 0 or n < 2 * k + 3 or (popcnt(n + 1) > 1 and k == 0): ng(... | output | 1 | 5,214 | 14 | 10,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none. Additionally, each person has exactly one chil... | instruction | 0 | 5,215 | 14 | 10,430 |
Tags: constructive algorithms, divide and conquer, dp, math, trees
Correct Solution:
```
def ng():
print("NO")
exit()
n, k = map(int,input().split())
if (n,k)==(1,0):
print("YES")
print(0)
exit()
ans = [0] * n
popcnt = lambda x: bin(x).count("1")
if n & 1 == 0 or n < 2 * k + 3 or (popcnt(n + 1) >... | output | 1 | 5,215 | 14 | 10,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none.... | instruction | 0 | 5,216 | 14 | 10,432 |
No | output | 1 | 5,216 | 14 | 10,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none.... | instruction | 0 | 5,217 | 14 | 10,434 |
No | output | 1 | 5,217 | 14 | 10,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none.... | instruction | 0 | 5,218 | 14 | 10,436 |
No | output | 1 | 5,218 | 14 | 10,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan is fond of genealogy. Currently he is studying a particular genealogical structure, which consists of some people. In this structure every person has either both parents specified, or none.... | instruction | 0 | 5,219 | 14 | 10,438 |
No | output | 1 | 5,219 | 14 | 10,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya came up to the blackboard and wrote out n distinct integers from 1 to n in some order in a circle. Then he drew arcs to join the pairs of integers (a, b) (a ≠ b), that are either each other's immediate neighbors in the circle, ... | instruction | 0 | 5,301 | 14 | 10,602 |
Tags: brute force, dfs and similar, implementation
Correct Solution:
```
#!/usr/local/bin/python3
from __future__ import print_function
import sys
DEBUG = '-d' in sys.argv
def debug(*args, **kwargs):
if DEBUG:
print(*args, file=sys.stderr, **kwargs)
return None
def main():
n = int(input())
... | output | 1 | 5,301 | 14 | 10,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya came up to the blackboard and wrote out n distinct integers from 1 to n in some order in a circle. Then he drew arcs to join the pairs of integers (a, b) (a ≠ b), that are either each other's immediate neighbors in the circle, ... | instruction | 0 | 5,302 | 14 | 10,604 |
Tags: brute force, dfs and similar, implementation
Correct Solution:
```
from sys import stdin
all_in = stdin.readlines()
n = int(all_in[0])
pairs = list(map(lambda x: tuple(map(int, x.split())), all_in[1:]))
if n == 5:
print(1, 2, 3, 4, 5)
exit()
neigs = {i: set() for i in range(1, n + 1)}
for (a, b) in p... | output | 1 | 5,302 | 14 | 10,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,391 | 14 | 10,782 |
Tags: binary search, implementation
Correct Solution:
```
import sys
import math
a=int(input())
b=list(map(int,input().split()))
c=int(input())
d=list(map(int,input().split()))
e=[]
f=0
for i in b:
#print(f,i)
e.append(f+i)
f=i+f
g=[0]*(e[-1]+1)
h=0
for i in range(a):
for j in range(h,e[i]+1):
... | output | 1 | 5,391 | 14 | 10,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,392 | 14 | 10,784 |
Tags: binary search, implementation
Correct Solution:
```
a=int(input())
b= list(map(int,input().split()))
c=int(input())
d= list(map(int,input().split()))
for k in range(1,a):
b[k] += b[k-1]
for j in d:
l=0
r= a-1
while l<= r:
if j <= b[0]:
mid=0
... | output | 1 | 5,392 | 14 | 10,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,393 | 14 | 10,786 |
Tags: binary search, implementation
Correct Solution:
```
def read():
input()
sizes = list(map(int, input().split()))
input()
queries = list(map(int, input().split()))
return sizes, queries
def calc_indexes(sizes):
start_indexes = [1]
for i in range(len(sizes)):
start_indexes.append... | output | 1 | 5,393 | 14 | 10,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,394 | 14 | 10,788 |
Tags: binary search, implementation
Correct Solution:
```
import bisect as bs
n = int(input())
A = list(map(int, input().split()))
m = int(input())
B = list(map(int, input().split()))
S = [0]
for a in A:
S.append(S[-1] + a)
for b in B:
print(bs.bisect_left(S, b))
``` | output | 1 | 5,394 | 14 | 10,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,395 | 14 | 10,790 |
Tags: binary search, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
m=int(input())
q=list(map(int,input().split()))
d=[0]
for i in range(n):
d.append(d[i]+a[i])
d.append(1000001)
for i in range(m):
start=0;end=len(d)-1
while start<end:
k=(start+end)//2
i... | output | 1 | 5,395 | 14 | 10,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,396 | 14 | 10,792 |
Tags: binary search, implementation
Correct Solution:
```
input()
d=[]
m=1
for i in map(int,input().split()):
for j in range(i):
d.append(m)
m+=1
input()
for i in map(int,input().split()):
print(d[i-1])
``` | output | 1 | 5,396 | 14 | 10,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,397 | 14 | 10,794 |
Tags: binary search, implementation
Correct Solution:
```
n=int(input())
x=list(map(int,input().split()))
t=int(input())
y=list(map(int,input().split()))
ans=[]
for i in range(len(x)):
ans.extend([i+1 for j in range(x[i])])
for i in y:
print(ans[i-1])
``` | output | 1 | 5,397 | 14 | 10,795 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile... | instruction | 0 | 5,398 | 14 | 10,796 |
Tags: binary search, implementation
Correct Solution:
```
n=int(input())
s=list(map(int,input().split()))
n1=int(input())
s1=list(map(int,input().split()))
w=[]
i=-1
d=n-1
r=0
while i!=d:
i+=1
for j in range(s[i]):
r+=1
w.append(r)
ans=[]
for i in range(n1):
l,r=-1,n
while (l+1<r):
m... | output | 1 | 5,398 | 14 | 10,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 5,428 | 14 | 10,856 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
from sys import stdin, stdout
def input(): return stdin.readline().strip()
def print(x, end='\n'): stdout.write(str(x) + end)
n, lst = int(input()), list(map(int, input().split()))
nse, pse, stk, ans = [n for i in range(n)], [-1 for i in range(n)], []... | output | 1 | 5,428 | 14 | 10,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 5,429 | 14 | 10,858 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
from sys import stdin, stdout
def input(): return stdin.readline().strip()
def print(x, end='\n'): stdout.write(str(x) + end)
n, lst = int(input()), list(map(int, input().split()))
nse, pse, stk, ans = [n for i in range(n)], [-1 for i in range(n)], []... | output | 1 | 5,429 | 14 | 10,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 5,431 | 14 | 10,862 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
# import math,string,itertools,fractions,heapq,collections,re,array,bisect
# from itertools import chain, dropwhile, permutations, combinations
# from collections import defaultdict
def VI(): return list(map(int,input().split()))
def main_old(n,a):
... | output | 1 | 5,431 | 14 | 10,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,498 | 14 | 10,996 |
Tags: math
Correct Solution:
```
l = []
r = []
sum_r = 0
sum_l = 0
max_diff_r = 0
max_r = 0
max_diff_l = 0
max_l = 0
for i in range(0, int(input())):
x, y = input().split(' ')
l.append(int(x))
sum_l+=l[i]
r.append(int(y))
sum_r+=r[i]
if max_diff_r < r[i] - l[i]:
max_r=i+1
max_dif... | output | 1 | 5,498 | 14 | 10,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,499 | 14 | 10,998 |
Tags: math
Correct Solution:
```
n = int(input())
ls = []
rs = []
for i in range(n):
l, r = [int(x) for x in input().split()]
ls.append(l)
rs.append(r)
lss = sum(ls)
rss = sum(rs)
best = abs(lss - rss)
ans = None
for i in range(n):
lss1 = lss - ls[i] + rs[i]
rss1 = rss - rs[i] + ls[i]
if abs(lss1 - rss1) > best... | output | 1 | 5,499 | 14 | 10,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,500 | 14 | 11,000 |
Tags: math
Correct Solution:
```
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(ma... | output | 1 | 5,500 | 14 | 11,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,501 | 14 | 11,002 |
Tags: math
Correct Solution:
```
n = int(input())
t = []
for i in range(n):
l, r = map(int, input().split())
t.append((l, r))
L = 0
R = 0
for i in t:
L += i[0]
R += i[1]
m = abs(L - R)
mi = 0
for i in range(n):
l, r = t[i][0], t[i][1]
if l == r:
continue
d = abs((L - l + r) - (R ... | output | 1 | 5,501 | 14 | 11,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,502 | 14 | 11,004 |
Tags: math
Correct Solution:
```
n = int(input())
l, r = [0]*n, [0]*n
for i in range(n):
l[i], r[i] = map(int, input().split(" "))
L, R = sum(l), sum(r)
index, beauty = -1, abs(L-R)
for i in range(n):
t = abs((L-l[i]+r[i]) - (R-r[i]+l[i]))
if t > beauty:
index, beauty = i, t
print(index+1)
``` | output | 1 | 5,502 | 14 | 11,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,503 | 14 | 11,006 |
Tags: math
Correct Solution:
```
n = int(input())
left = []
right = []
R = 0
L = 0
for i in range(n):
a, b = map(int, input().split())
left.append(a)
L += a
R += b
right.append(b)
base = abs(L - R)
m = base
cur = -1
for i in range(n):
L1 = L - left[i] + right[i]
R1 = R - right[i] + left[i]
... | output | 1 | 5,503 | 14 | 11,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,504 | 14 | 11,008 |
Tags: math
Correct Solution:
```
n = int(input())
sum = 0
a = []
b = []
for i in range(0, n):
c = input()
c = c.split()
a.append(int(c[0]))
b.append(int(c[1]))
sum += a[i] - b[i]
v = abs(sum)
ans = -1
for i in range(0, n):
vv = sum - 2*(a[i] - b[i])
vv = abs(vv)
if(vv > v):
v = v... | output | 1 | 5,504 | 14 | 11,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to mar... | instruction | 0 | 5,505 | 14 | 11,010 |
Tags: math
Correct Solution:
```
n = int(input())
l,r = [],[]
for i in range(n):
x = list(map(int,input().split()))
l.append(x[0])
r.append(x[1])
L,R = sum(l),sum(r)
ans = abs(L-R)
ind = 0
for i in range(n):
x = L-l[i]+r[i]
y = R-r[i]+l[i]
if ans<abs(x-y):
ans = max(ans,abs(x-y))
... | output | 1 | 5,505 | 14 | 11,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not ev... | instruction | 0 | 5,506 | 14 | 11,012 |
Yes | output | 1 | 5,506 | 14 | 11,013 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.