Write a Python function called sieve of E sum that takes an integer argument N a

Question

Write a Python function called sieve of E sum that takes an integer argument N and uses the Sieve of Eratosthenes to return a tuple of both the number of primes less than or equal to N as well as the sum of all primes less than or equal to N (in that order). Example: sieve-ot_r_sum(10)-(4, 17) Example: sieve of E sum(100000) - (9592, 45396537) This problem has a timeout limit of 1 second and a memory usage limit of 1MB, so be sure to write semi-efficient codel The values of N in each test-case satisfy 2 s N s 1000000. For example: Result Test

Explanation / Answer

import math
N = int(raw_input("Enter the value of N (more than 1) "))

def seive_of_E_sum(N):
   bool_array=[1]*(N+1)
   for i in range(2,int(math.sqrt(N))+1):
       if bool_array[i]==1:
           for j in range(i*i,N+1,i):
               bool_array[j]=0
   count=0
   sum_of_prime=0
   for i in range(2,N+1):
       if bool_array[i]==1:
           count=count+1
           sum_of_prime=sum_of_prime+i
   return count,sum_of_prime

number_of_prime,sum_of_all_prime=seive_of_E_sum(N)

print number_of_prime,sum_of_all_prime

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.