Sum of Prime Numbers In the Input
Given a list of integers, write a program to print the sum of all prime numbers in the list of integers.
Note: One is neither prime nor composite number.Input
The input will be a single line containing space-separated integers..Output
The output should be a single line containing the sum of all prime numbers from 1 to N.Explanation
For example, if the given list of integers are
2 4 5 6 7 3 8
As 2, 3, 5 and 7 are prime numbers, your code should print the sum of these numbers. So the output should be 17.
Sample Input 1
2 4 5 6 7 3 8
Sample Output 1
17
Sample Input 2
65 87 96 31 32 86 57 69 20 42
Sample Output 2
31
def sum_primes(n):
s1 = 0
for i in range(0,len(n)):
num = n[i]
if num > 1:
if all(num%j != 0 for j in range(2, int(num**0.5)+1)):
s1 = s1 + num
else:
s1 = 0
return(s1)
Example
In : n = [65, 87, 96, 31, 32, 86, 57, 69, 20, 42]
In : sum_primes(n)
Out : 31
Comments
Leave a comment