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 IsPrime(n):
if n < 0:
raise ValueError('Negative value')
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
i = 3
while(i * i < n):
if n % i == 0:
return False
i += 2
return True
sum = 0
for n in [int(i) for i in input().split()]:
if IsPrime(n) == True:
sum += n
print(sum)
Comments
Leave a comment