message stringlengths 2 433k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 113 108k | cluster float64 12 12 | __index_level_0__ int64 226 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
For example, the following sequences are good:
... | instruction | 0 | 99,462 | 12 | 198,924 |
Tags: brute force, greedy, implementation
Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
ak=[]
i=0
while 2**i <=2000000000:
ak.append(2**i)
i+=1
n=int(input())
a=list(map(int,input().split()))
d=dict()
for i,v in enumerate(a):
d[v]=d.get(v,set())
d[v].add(i)
ans=... | output | 1 | 99,462 | 12 | 198,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
For example, the following sequences are good:
... | instruction | 0 | 99,463 | 12 | 198,926 |
Tags: brute force, greedy, implementation
Correct Solution:
```
input("")
output = 0
array = dict()
for element in list(map(int, input('').split(" "))):
array[element] = array.get(element, 0) + 1
for element in array:
flag = False
for j in range(31):
if ((pow(2, j) - element) in array.keys()) and ((... | output | 1 | 99,463 | 12 | 198,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
For example, the following sequences are good:
... | instruction | 0 | 99,464 | 12 | 198,928 |
Tags: brute force, greedy, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
r = set(2**i for i in range(31))
c = {}
for i in range(n):
t = c.get(a[i], 0) + 1
c[a[i]] = t
ans = 0
for i in range(n):
f = False
for k in r:
... | output | 1 | 99,464 | 12 | 198,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
For example, the following sequences are good:
... | instruction | 0 | 99,465 | 12 | 198,930 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
d={}
ans=0
for i in l:
d[i]=d.get(i,0)+1
for i in range(n):
flag=0
for j in range(32):
p=1<<j
x=p-l[i]
m=d.get(x,0)
if (m>=2 or ( m==1 and p-l[i]!=l[i])):
... | output | 1 | 99,465 | 12 | 198,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
For example, the following sequences are good:
... | instruction | 0 | 99,466 | 12 | 198,932 |
Tags: brute force, greedy, implementation
Correct Solution:
```
b = []
l = 2
t = 0
while t<=30:
b.append(l)
l=l*2
t+=1
n = int(input())
a = list(map(int,input().split()))
from collections import defaultdict
c = defaultdict(int)
d = set()
for i in a:
c[i]+=1
for i in c:
if i in d:
continue
... | output | 1 | 99,466 | 12 | 198,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
For example, the following sequences are good:
... | instruction | 0 | 99,467 | 12 | 198,934 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
s=set()
d={}
for i in range(n):
if a[i] in s:
d[a[i]]=1
s.add(a[i])
cnt=0
for i in range(n):
temp=1
flag=False
for j in range(32):
if temp-a[i] in s:
if 2*a[i]=... | output | 1 | 99,467 | 12 | 198,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,468 | 12 | 198,936 |
Yes | output | 1 | 99,468 | 12 | 198,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,469 | 12 | 198,938 |
Yes | output | 1 | 99,469 | 12 | 198,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,470 | 12 | 198,940 |
Yes | output | 1 | 99,470 | 12 | 198,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,471 | 12 | 198,942 |
Yes | output | 1 | 99,471 | 12 | 198,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,472 | 12 | 198,944 |
No | output | 1 | 99,472 | 12 | 198,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,473 | 12 | 198,946 |
No | output | 1 | 99,473 | 12 | 198,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,474 | 12 | 198,948 |
No | output | 1 | 99,474 | 12 | 198,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a_1, a_2, ..., a_n is called good if, for each element a_i, there exists an element a_j (i ≠ j) such that a_i+a_j is a power of two (that is, 2^d for some non-negative integer d).
Fo... | instruction | 0 | 99,475 | 12 | 198,950 |
No | output | 1 | 99,475 | 12 | 198,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,503 | 12 | 199,006 |
Tags: greedy
Correct Solution:
```
n = int(input())
v = list(map(int, input().split()))
new_v = [0] * (n)
new_v[-1] = v[0]
for i in range(1, len(v)):
if v[i] > v[i - 1]:
new_v[i] = new_v[i - 1] + v[i] - v[i - 1]
else:
new_v[i] = new_v[i - 1]
new_v[-i - 1] = v[i] - new_v[i]
print(*new_v)
... | output | 1 | 99,503 | 12 | 199,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,504 | 12 | 199,008 |
Tags: greedy
Correct Solution:
```
n = int(input())
arr = list(map(int,input().split()))
ans=[0]*(n)
l = 0
h = float('inf')
for i in range(n//2):
ans[i] = max(l,arr[i]-h)
ans[n-1-i] = arr[i]-ans[i]
l = ans[i]
h = ans[n-1-i]
print(*ans)
``` | output | 1 | 99,504 | 12 | 199,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,505 | 12 | 199,010 |
Tags: greedy
Correct Solution:
```
n, b = int(input()), list(map(int, input().split()))
a = [0 for _ in range(n)]
a[n - 1], a[0] = b[0], 0
for i in range(1, n // 2):
if a[n - i] < b[i] and b[i] - a[n - i] >= a[i - 1]:
a[n - 1 - i], a[i] = a[n - i], b[i] - a[n - i]
else:
a[n - 1 - i], a[i] = b[i] - a[i - 1], a... | output | 1 | 99,505 | 12 | 199,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,506 | 12 | 199,012 |
Tags: greedy
Correct Solution:
```
import sys
import os
from math import*
input=sys.stdin.buffer.readline
n=int(input())
arr=list(map(int,input().split()))
ans=[0]*n
c=0
d=arr[0]
ans[0]=c
ans[n-1]=d
for i in range(1,n//2):
if arr[i]<=d:
d=arr[i]-c
else:
c=max(c,arr[i]-d)
d=arr[i]-c
ans[i]=c
ans[n-i-1]=d
for ... | output | 1 | 99,506 | 12 | 199,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,507 | 12 | 199,014 |
Tags: greedy
Correct Solution:
```
from bisect import bisect_right as br
from bisect import bisect_left as bl
from collections import defaultdict
from itertools import combinations
import sys
import math
MAX = sys.maxsize
MAXN = 10**6+10
MOD = 10**9+7
def isprime(n):
n = abs(int(n))
if n < 2:
return Fal... | output | 1 | 99,507 | 12 | 199,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,508 | 12 | 199,016 |
Tags: greedy
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
left = list()
right = list()
for v in arr:
if len(left) == 0:
left.append(0)
right.append(v)
else:
rvalue = min(v, right[-1])
lvalue = v - rvalue
if lvalue < left[-1]:
... | output | 1 | 99,508 | 12 | 199,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,509 | 12 | 199,018 |
Tags: greedy
Correct Solution:
```
n = int(input())
b = [int(x) for x in input().split()]
lh=[0]
rh=[b[0]]
for x in b[1:]:
if x>=rh[-1]:
y=x-rh[-1]
if y>=lh[-1]:
lh.append(y)
rh.append(rh[-1])
else:
lh.append(lh[-1])
rh.append(x-lh[-1])
els... | output | 1 | 99,509 | 12 | 199,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.
There were n classes of that subject d... | instruction | 0 | 99,510 | 12 | 199,020 |
Tags: greedy
Correct Solution:
```
n = int(input())
A = list(map(int,input().split()))
res = [0]*n
res[0] = 0
res[n-1] = A[0]
for i in range(1,n//2):
res[i] = max(res[i-1],A[i]-A[i-1] + res[i-1])
res[n-i-1] = A[i]-res[i]
print(*res)
``` | output | 1 | 99,510 | 12 | 199,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,519 | 12 | 199,038 |
Tags: dp, implementation
Correct Solution:
```
#!/usr/bin/python3.6
'''
.__ .__ _______ _______ _________
______| |__ |__| ____ ____ _______ _____ \ _ \ \ _ \\______ \
/ ___/| | \ | | / \ / _ \\_ __ \\__ \ / /_\ \ / /_\ \ / /
\___ \ ... | output | 1 | 99,519 | 12 | 199,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,520 | 12 | 199,040 |
Tags: dp, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
ans=[[0]*(2**20+5) for i in range(2)]
ans[1][0]=1
x,an=0,0
for i in range(n):
x^=a[i]
an+=ans[i%2][x]
ans[i%2][x]+=1
print(an)
``` | output | 1 | 99,520 | 12 | 199,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,521 | 12 | 199,042 |
Tags: dp, implementation
Correct Solution:
```
list_int_input = lambda inp: list(map(int, inp.split()))
int_input = lambda inp: int(inp)
string_to_list_input = lambda inp: list(inp)
n=int(input())
a=list_int_input(input())
a=[0]+a
xl=[]
for ind,val in enumerate(a):
if ind>0:
val=xl[-1]^val
xl.append(va... | output | 1 | 99,521 | 12 | 199,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,522 | 12 | 199,044 |
Tags: dp, implementation
Correct Solution:
```
input()
N=1<<20
d=[1]+[0]*N,[0]*N
r=s=i=0
for x in map(int,input().split()):s^=x;i^=1;r+=d[i][s];d[i][s]+=1
print(r)
``` | output | 1 | 99,522 | 12 | 199,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,523 | 12 | 199,046 |
Tags: dp, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
cnt = [[0 for i in range(int(2 << 20)+10)],
[0 for i in range(int(2 << 20)+10)]]
cnt[1][0] =1
x = 0
ans = 0
for i in range(n):
x ^= a[i]
ans += cnt[i % 2][x]
cnt[i % 2][x] += 1
print(ans)
``` | output | 1 | 99,523 | 12 | 199,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,524 | 12 | 199,048 |
Tags: dp, implementation
Correct Solution:
```
import sys
import math
def getAndParseInt(num=1):
string = (sys.stdin.readline()).strip()
if num==1:
return int(string)
else:
return [int(part) for part in string.split()]
def getAndParseString(num=1,delim=" "):
string = (sys.stdin.readline... | output | 1 | 99,524 | 12 | 199,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,525 | 12 | 199,050 |
Tags: dp, implementation
Correct Solution:
```
def inpl(): return list(map(int, input().split()))
from operator import xor
from itertools import accumulate, chain
from collections import Counter
N = int(input())
A = list(accumulate([0] + inpl(), xor))
B = [a for i, a in enumerate(A) if i%2]
A = [a for i, a in enumerat... | output | 1 | 99,525 | 12 | 199,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn't an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve... | instruction | 0 | 99,526 | 12 | 199,052 |
Tags: dp, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
n=int(input())
A=list(map(int,input().split()))
AX=[0,A[0]]
for i in range(1,n):
AX.append(AX[i]^A[i])
LIST=sorted(set(AX))
DICT=dict()
for i in range(len(LIST)):
DICT[LIST[i]]=i
NUMLIST=[[] for i in range(len(LIST))]
f... | output | 1 | 99,526 | 12 | 199,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,535 | 12 | 199,070 |
Tags: greedy
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
if n == 1:
print(1)
print('1 1')
else:
d = [[]]*(n-1)
d[0] = a
for i in range(1,n-1):
d[i] = [d[i-1][j]+a[j+i] for j in range(0,n-i)]
d2 = {}
for i,d_ in enumerate(d):
for j,x in enumerate... | output | 1 | 99,535 | 12 | 199,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,536 | 12 | 199,072 |
Tags: greedy
Correct Solution:
```
from collections import defaultdict
n = int(input())
arr = [int(i) for i in input().split()]
prefix = [0 for i in range(n)]
segments = defaultdict(list)
prefix[0] = arr[0]
for i in range(1,n):
prefix[i] = prefix[i - 1] + arr[i]
long = 0
long_i = 0
for i in range(n):
for j... | output | 1 | 99,536 | 12 | 199,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,537 | 12 | 199,074 |
Tags: greedy
Correct Solution:
```
n = int(input())
lst = list(map(int,input().split()))
d,res,summa = {},{},0
for i,y in enumerate(lst):
summa+=y
s=summa
for j in range(i+1):
if d.get(s)==None:
d[s]=[0,-1]
res[s]=[]
if d[s][1]<j:
d[s][0]+=1
d[... | output | 1 | 99,537 | 12 | 199,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,538 | 12 | 199,076 |
Tags: greedy
Correct Solution:
```
from collections import defaultdict
def main():
n = int(input())
values = list(map(int, input().split(' ')))
# print(values)
ans = defaultdict(list)
for i in range(n):
s = 0
# print("---------- i = {} ----------".format(i))
for j in range(i,... | output | 1 | 99,538 | 12 | 199,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,539 | 12 | 199,078 |
Tags: greedy
Correct Solution:
```
from itertools import accumulate
def main():
n = int(input())
arr = list(map(int, input().split()))
arr_sums = [0] + list(accumulate(arr))
blocks = {}
for i in range(1, n+1):
for j in range(i):
total = arr_sums[i] - arr_sums[j]
if... | output | 1 | 99,539 | 12 | 199,079 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,540 | 12 | 199,080 |
Tags: greedy
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
dic={}
for i in range(n):
sm=0
for j in range(i,n):
sm+=a[j]
if sm in dic:
dic[sm].append((i,j))
else:
dic[sm]=[(i,j)]
ans=0
anskey=-1
for key in dic:
cnt=0
last=-1
for ... | output | 1 | 99,540 | 12 | 199,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,541 | 12 | 199,082 |
Tags: greedy
Correct Solution:
```
n = int(input())
arr= list(map(int, input().split()))
sums = {0: []}
for i in range(n):
sum = 0
for j in range(i, -1, -1):
sum += arr[j]
if sum not in sums.keys():
sums[sum] = []
sums[sum].append((j,i))
#print(sums)
ans = (0, [])
for k in s... | output | 1 | 99,541 | 12 | 199,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r]... | instruction | 0 | 99,542 | 12 | 199,084 |
Tags: greedy
Correct Solution:
```
n=int(input())
arr=list(map(int,input().split()))
dict1={}
for i in range(n):
val=0
for j in range(i,n):
val+=arr[j]
try:
dict1[val].append((i,j))
except:
KeyError
dict1[val]=[(i,j)]
ans=0
ansarr=[]
for i in dict1.keys():
if(len(dict1[i])>ans):
arr2=[]
for j in r... | output | 1 | 99,542 | 12 | 199,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,543 | 12 | 199,086 |
Yes | output | 1 | 99,543 | 12 | 199,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,544 | 12 | 199,088 |
Yes | output | 1 | 99,544 | 12 | 199,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,545 | 12 | 199,090 |
Yes | output | 1 | 99,545 | 12 | 199,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,546 | 12 | 199,092 |
Yes | output | 1 | 99,546 | 12 | 199,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,547 | 12 | 199,094 |
No | output | 1 | 99,547 | 12 | 199,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,548 | 12 | 199,096 |
No | output | 1 | 99,548 | 12 | 199,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,549 | 12 | 199,098 |
No | output | 1 | 99,549 | 12 | 199,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem is given in two editions, which differ exclusively in the constraints on the number n.
You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous... | instruction | 0 | 99,550 | 12 | 199,100 |
No | output | 1 | 99,550 | 12 | 199,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We have a secret array. You don't know this array and you have to restore it. However, you know some facts about this array:
* The array consists of n distinct positive (greater than 0) integers.
* The array contains two elements x and... | instruction | 0 | 99,614 | 12 | 199,228 |
Tags: brute force, math, number theory
Correct Solution:
```
#!/usr/bin/env python3
# encoding: utf-8
#----------
# Constants
#----------
#----------
# Functions
#----------
# The function that solves the task
def calc(n, x, y):
best_maximum, best_k = 1000000001, 0
for m in range(1, n):
k = (y -... | output | 1 | 99,614 | 12 | 199,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We have a secret array. You don't know this array and you have to restore it. However, you know some facts about this array:
* The array consists of n distinct positive (greater than 0) integers.
* The array contains two elements x and... | instruction | 0 | 99,615 | 12 | 199,230 |
Tags: brute force, math, number theory
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Mon Aug 3 21:10:40 2020
@author: dennis
"""
import atexit
import io
import sys
_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUF... | output | 1 | 99,615 | 12 | 199,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We have a secret array. You don't know this array and you have to restore it. However, you know some facts about this array:
* The array consists of n distinct positive (greater than 0) integers.
* The array contains two elements x and... | instruction | 0 | 99,616 | 12 | 199,232 |
Tags: brute force, math, number theory
Correct Solution:
```
def answer(n,x,y):
diff=y-x
d=-1
for i in range(n-1,0,-1):
if diff%i==0:
d=diff//i
break
l=[y]
q=y-d
while len(l)<n and q>0:
l.append(q)
q=q-d
q=y+d
while l... | output | 1 | 99,616 | 12 | 199,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We have a secret array. You don't know this array and you have to restore it. However, you know some facts about this array:
* The array consists of n distinct positive (greater than 0) integers.
* The array contains two elements x and... | instruction | 0 | 99,617 | 12 | 199,234 |
Tags: brute force, math, number theory
Correct Solution:
```
t=int(input())
w=[]
def func(t,h):
i=1
boo=True
while boo:
if t % i==0:
if t< i * h:
boo=False
return i
else:
i=i+1
else:
i=i+1
for i in range(t):... | output | 1 | 99,617 | 12 | 199,235 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.