fork download
copy 
  1. # your code goes here
Success #stdin #stdout 0.09s 14100KB
comments (?)
stdin
copy 
arr = [1, 2, 3, 4, 5, 6]
even_numbers = [x for x in arr if x % 2 == 0]
K = len(even_numbers)
print("Even numbers:", even_numbers)
print("Count (K):", K)

arr = [1, 2, 3, 4, 5, 6]
odd_numbers = [x for x in arr if x % 2 != 0]
K = len(odd_numbers)
print("Odd numbers:", odd_numbers)
print("Count (K):", K)

arr = [3.0, 1.0, 4.0, 1.0, 5.0, 9.0, 2.0, 6.0]
result = [arr[i] for i in range(1, len(arr)) if arr[i] < arr[i-1]]
K = len(result)
print("Numbers less than left neighbor:", result)
print("Count (K):", K)

arr = [3.0, 1.0, 4.0, 1.0, 5.0, 9.0, 2.0, 6.0]
result = [arr[i] for i in range(len(arr)-1) if arr[i] > arr[i+1]]
K = len(result)
print("Numbers greater than right neighbor:", result)
print("Count (K):", K)

arr = [1, 2, 3, 4, 5]
is_increasing = all(arr[i] <= arr[i+1] for i in range(len(arr)-1))
print("Is increasing:", is_increasing)

arr = [5.0, 4.0, 3.0, 2.0, 1.0]
if all(arr[i] >= arr[i+1] for i in range(len(arr)-1)):
    print(0)
else:
    for i in range(len(arr)-1):
        if arr[i] < arr[i+1]:
            print(i)
            break
            
arr = [1, 0, 2, 3, 0, 4]
first_zero = arr.index(0)
second_zero = arr.index(0, first_zero + 1)
if second_zero - first_zero == 1:
    print(0)
else:
    print(sum(arr[first_zero+1:second_zero]))
    
arr = [5, 4, 3, 2, 1]
if all(arr[i] >= arr[i+1] for i in range(len(arr)-1)):
    print(0)
else:
    for i in range(len(arr)-1):
        if arr[i] < arr[i+1]:
            print(i)
            break
            
arr = [1, 0, 2, 3, 0, 4]
last_zero = len(arr) - 1 - arr[::-1].index(0)
second_last_zero = len(arr) - 1 - arr[::-1].index(0, len(arr) - last_zero)
if last_zero - second_last_zero == 1:
    print(0)
else:
    print(sum(arr[second_last_zero+1:last_zero]))
    
arr = [1, -2, 3, 4, -5, 6]
even_positive = [x for x in arr if x > 0 and x % 2 == 0]
print("Even positive numbers:", even_positive)

arr = [1.0, 0.0, 2.0, 3.0, 0.0, 4.0]
non_zero = [x for x in arr if x != 0]
product = 1
for x in non_zero:
    product *= x
print("Non-zero elements:", non_zero)
print("Product:", product)

arr = [3, 1, 4, 1, 5, 9, 2, 6]
max_idx = arr.index(max(arr))
min_idx = arr.index(min(arr))
arr[max_idx], arr[min_idx] = arr[min_idx], arr[max_idx]
print("Array after swap:", arr)

arr = [3.0, 1.0, 4.0, 1.0, 5.0, 9.0, 2.0, 6.0]
max_idx = arr.index(max(arr))
arr[max_idx], arr[-1] = arr[-1], arr[max_idx]
print("Array after swap:", arr)

arr = [3, 1, 4, 1, 5, 9, 2, 6]
max_idx = arr.index(max(arr))
arr[:max_idx+1] = [0] * (max_idx + 1)
print("Array after replacement:", arr)

arr = [3, 1, 4, 1, 5, 9, 2, 6]
max_idx = arr.index(max(arr))
print("Elements after max:", arr[max_idx+1:])

arr = [3.0, 1.0, 4.0, 1.0, 5.0, 9.0, 2.0, 6.0]
min_idx = arr.index(min(arr))
arr[min_idx+1:] = [0] * (len(arr) - min_idx - 1)
print("Array after replacement:", arr)

arr = [1, 0, 2, 0, 3, 0, 4]
for i in range(len(arr)):
    if arr[i] == 0 and i > 0:
        arr[i], arr[i-1] = arr[i-1], arr[i]
print("Array after moving zeros:", arr)

arr = [1, 2, 3, 0, 4, 5]
zero_idx = arr.index(0)
print("Elements up to zero:", arr[:zero_idx])

arr = [3.0, 1.0, 4.0, 1.0, 5.0, 9.0, 2.0, 6.0]
max_idx = arr.index(max(arr))
min_idx = arr.index(min(arr))
arr[max_idx], arr[min_idx] = arr[min_idx], arr[max_idx]
print("Array after swap:", arr)

arr = [3, 1, 4, 1, 5, 9, 2, 6]
min_idx = arr.index(min(arr))
print("Elements before min:", arr[:min_idx])
stdout
copy 
Standard output is empty
https://ideone.com/hnIyhN
language:
Python 3 (python  3.12)
created:
18 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!