This Python program reads a list of numbers, stores them in an array, calculates the sum of all prime numbers, and then prints only the numbers that are greater than that sum.
def is_prime(n: int) -> bool:
if n < 2:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
def sum_primes(arr: list[int]) -> int:
return sum(x for x in arr if is_prime(x))
def filter_greater_than(arr: list[int], threshold: int) -> list[int]:
return [x for x in arr if x > threshold]
# Read input from user
raw_input = input("Enter numbers separated by space: ")
numbers = list(map(int, raw_input.strip().split()))
prime_sum = sum_primes(numbers)
greater_numbers = filter_greater_than(numbers, prime_sum)
print(f"\nSum of prime numbers: {prime_sum}")
print("Numbers greater than that sum:")
print(" ".join(map(str, greater_numbers)))
Input: 3 5 8 10 17 20
Sum of prime numbers: 25
Numbers greater than that sum: 30 40 50