python1000以内的素数之和_找到在python第1000素数之和

I have written a program which counts the sum of the primes uptill 1000. The program is as follows:

limit = 1000

def is_prime(n):

for i in range(2, n):

if n%i == 0:

return False

return True

sum = 0

for i in range(2, int(limit+1)):

if is_prime(i):

sum = sum + i

count += 1

print sum

What changes can I make to find 1000 primes instead of upto 1000 numbers? Also, I am looking for space complexity as O(1) and time complexity as O(n) (As I know other methods can do it :-) such as "Sieve of Eratosthenes" and finding prime while iterating upto sqrt(n) http://www.geeksforgeeks.org/print-all-prime-factors-of-a-given-number/)

Please correct me if I am going wrong some where. Thank you.

解决方案

Just a small improvement based on your cod