Tasks Details
medium
Find the minimal average of any slice containing at least two elements.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + ... + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + ... + A[Q]) / (Q − P + 1).
For example, array A such that:
A[0] = 4 A[1] = 2 A[2] = 2 A[3] = 5 A[4] = 1 A[5] = 5 A[6] = 8contains the following example slices:
- slice (1, 2), whose average is (2 + 2) / 2 = 2;
- slice (3, 4), whose average is (5 + 1) / 2 = 3;
- slice (1, 4), whose average is (2 + 2 + 5 + 1) / 4 = 2.5.
The goal is to find the starting position of a slice whose average is minimal.
Write a function:
def solution(A)
that, given a non-empty array A consisting of N integers, returns the starting position of the slice with the minimal average. If there is more than one slice with a minimal average, you should return the smallest starting position of such a slice.
For example, given array A such that:
A[0] = 4 A[1] = 2 A[2] = 2 A[3] = 5 A[4] = 1 A[5] = 5 A[6] = 8the function should return 1, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [2..100,000];
- each element of array A is an integer within the range [−10,000..10,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 16 minutes
Notes
not defined yet
Code: 01:13:57 UTC,
java,
autosave
Code: 01:16:11 UTC,
py,
autosave
def solution(A):
len_a = len(A)
if len_a == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:17:11 UTC,
py,
autosave
def solution(A):
len_a = len(A)
if len_a == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:17:37 UTC,
py,
autosave
def solution(A):
len_a = len(A)
if len_a == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1",i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print(i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:17:57 UTC,
py,
autosave
def solution(A):
len_a = len(A)
if len_a == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:19:47 UTC,
py,
autosave
def solution(A):
len_a = len(A)
if == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:19:58 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:20:12 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:20:25 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:20:46 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:20:57 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:21:24 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:21:43 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:21:58 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
# print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:22:08 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg1 = cur_avg
min_str_idx1 = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:22:20 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:22:30 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:22:41 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:22:54 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:23:07 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg_ = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:23:19 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg_1 = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg_2 = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:23:32 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg_1 = sum(A[i:i+2]) / 2
cur_avg_2 = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:23:46 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg_1 = sum(A[i:i+2]) / 2
cur_avg_2 = sum(A[i:i+3]) / 3
if cur_avg < min_avg or:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:23:58 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg_1 = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg_2 = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:24:08 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:24:18 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:24:32 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
sum(A[])
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:25:02 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
sum(A[:-2])
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:25:34 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
sum(A[:-2])
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:25:44 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
print(A[:-2])
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
sum(A[:-2])
min_avg1 = sum(A[:2]) / 2
min_str_idx1 = 0
for i in range(1, len(A)):
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg1:
print("1: ", i)
min_avg1 = cur_avg
min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Code: 01:25:47 UTC,
py,
verify,
result: Failed
def solution(A):
if len(A) == 2:
return 0
print(A[:-2])
# min_avg = sum(A[:2]) / 2
# min_str_idx = 0
# for i in range(1, len(A)-2):
# # avg for 2
# cur_avg = sum(A[i:i+2]) / 2
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# cur_avg = sum(A[i:i+3]) / 3
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# # avg for 3
# sum(A[:-2])
# min_avg1 = sum(A[:2]) / 2
# min_str_idx1 = 0
# for i in range(1, len(A)):
# cur_avg = sum(A[i:i+2]) / 2
# if cur_avg < min_avg1:
# print("1: ", i)
# min_avg1 = cur_avg
# min_str_idx1 = i
# return min_str_idx
min_avg2 = sum(A[:3]) / 3
min_str_idx2 = 0
for i in range(1, len(A)-1):
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg2:
print("2: ", i)
min_avg2 = cur_avg
min_str_idx2 = i
if min_avg1 < min_avg2:
return min_str_idx1
else:
return min_str_idx2
Analysis
expand all
Example tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_wv91tmyo/solution.py", line 42, in solution
if min_avg1 < min_avg2:
NameError: name 'min_avg1' is not defined
stdout:
[4, 2, 2, 5, 1]
Code: 01:26:02 UTC,
py,
verify,
result: Failed
def solution(A):
if len(A) == 2:
return 0
print(A[:-2])
# min_avg = sum(A[:2]) / 2
# min_str_idx = 0
# for i in range(1, len(A)-2):
# # avg for 2
# cur_avg = sum(A[i:i+2]) / 2
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# cur_avg = sum(A[i:i+3]) / 3
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# # avg for 3
# sum(A[:-2])
Analysis
expand all
Example tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
[4, 2, 2, 5, 1]
Code: 01:26:14 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
print(A[-2])
# min_avg = sum(A[:2]) / 2
# min_str_idx = 0
# for i in range(1, len(A)-2):
# # avg for 2
# cur_avg = sum(A[i:i+2]) / 2
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# cur_avg = sum(A[i:i+3]) / 3
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# # avg for 3
# sum(A[:-2])
Code: 01:26:23 UTC,
py,
verify,
result: Failed
def solution(A):
if len(A) == 2:
return 0
print(A[-2])
# min_avg = sum(A[:2]) / 2
# min_str_idx = 0
# for i in range(1, len(A)-2):
# # avg for 2
# cur_avg = sum(A[i:i+2]) / 2
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# cur_avg = sum(A[i:i+3]) / 3
# if cur_avg < min_avg:
# min_avg = cur_avg
# min_str_idx = i
# # avg for 3
# sum(A[:-2])
Analysis
expand all
Example tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
5
Code: 01:26:36 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
sum(A[:-2])
Code: 01:26:50 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
sum(A[-2]+A[-1]) / 2
Code: 01:27:01 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
if min_avg sum(A[-2]+A[-1]) / 2
Code: 01:27:14 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
if min_avg > sum(A[-2]+A[-1]) / 2:
Code: 01:27:44 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2]+A[-1]) / 2
if cur_avg > last_tw
Code: 01:27:55 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2]+A[-1]) / 2
if cur_avg > last_two_sum:
return len(A) -
Code: 01:28:09 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2]+A[-1]) / 2
if cur_avg > last_two_sum:
return len(A) - 2
else:
min_
Code: 01:28:20 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2]+A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
min_avg
Code: 01:28:29 UTC,
py,
verify,
result: Failed
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2]+A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
return min_str_idx
Analysis
expand all
Example tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_6c5dfxtp/solution.py", line 20, in solution
last_two_sum = sum(A[-2]+A[-1]) / 2
TypeError: 'int' object is not iterable
Code: 01:28:50 UTC,
py,
verify,
result: Failed
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2],A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
return min_str_idx
Analysis
expand all
Example tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 115, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/exec_user_i1lxvy8b/solution.py", line 20, in solution
last_two_sum = sum(A[-2],A[-1]) / 2
TypeError: 'int' object is not iterable
Code: 01:28:56 UTC,
py,
autosave
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = sum(A[-2]A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
return min_str_idx
Code: 01:29:06 UTC,
py,
verify,
result: Passed
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = (A[-2]+A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
return min_str_idx
Analysis
Code: 01:29:11 UTC,
py,
verify,
result: Passed
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = (A[-2]+A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
return min_str_idx
Analysis
Code: 01:29:15 UTC,
py,
final,
score:
100
def solution(A):
if len(A) == 2:
return 0
min_avg = sum(A[:2]) / 2
min_str_idx = 0
for i in range(1, len(A)-2):
# avg for 2
cur_avg = sum(A[i:i+2]) / 2
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
cur_avg = sum(A[i:i+3]) / 3
if cur_avg < min_avg:
min_avg = cur_avg
min_str_idx = i
# avg for 3
last_two_sum = (A[-2]+A[-1]) / 2
if min_avg > last_two_sum:
return len(A) - 2
else:
return min_str_idx
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.016 s
OK
2.
0.016 s
OK
3.
0.016 s
OK
4.
0.016 s
OK
1.
0.016 s
OK
2.
0.016 s
OK
1.
0.016 s
OK
1.
0.016 s
OK
1.
0.016 s
OK
2.
0.016 s
OK
3.
0.016 s
OK
expand all
Performance tests
1.
0.016 s
OK
1.
0.108 s
OK
2.
0.084 s
OK
1.
0.108 s
OK
1.
0.104 s
OK
2.
0.108 s
OK
3.
0.108 s
OK
1.
0.100 s
OK
2.
0.080 s
OK