fuxino/project-euler-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Improve code

Browse Source
This commit is contained in:
daniele 2019-09-22 13:23:07 +02:00
parent 9db44b9d1f
commit 7bab173c05
Signed by: fuxino
GPG Key ID: 6FE25B4A3EE16FDA
4 changed files with 13 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Python/p010.py
View File

@ -6,10 +6,12 @@ from projecteuler import sieve
def main(): def main():
start = default_timer() start = default_timer()
primes = sieve(2000000) N = 2000000
primes = sieve(N)
sum_ = 0 sum_ = 0
for i in range(2000000): for i in range(N):
if primes[i] == 1: if primes[i] == 1:
sum_ = sum_ + i sum_ = sum_ + i

4
Python/p028.py
View File

@ -5,7 +5,9 @@ from timeit import default_timer
def main(): def main():
start = default_timer() start = default_timer()
limit = 1001 * 1001 N = 1001
limit = N * N
i = 0 i = 0
j = 1 j = 1

6
Python/p035.py
View File

@ -31,10 +31,12 @@ def main():
global primes global primes
primes = sieve(1000000) N = 1000000
primes = sieve(N)
count = 13 count = 13
for i in range(101, 1000000, 2): for i in range(101, N, 2):
if is_circular_prime(i): if is_circular_prime(i):
count = count + 1 count = count + 1

4
Python/projecteuler.py
View File

@ -45,14 +45,14 @@ def sieve(n):
primes[2] = 1 primes[2] = 1
primes[3] = 1 primes[3] = 1
for i in range(4, n, 2): for i in range(4, n -1, 2):
primes[i] = 0 primes[i] = 0
primes[i+1] = 1 primes[i+1] = 1
limit = floor(sqrt(n)) limit = floor(sqrt(n))
for i in range(3, limit, 2): for i in range(3, limit, 2):
if primes[i]: if primes[i] == 1:
for j in range(i * i, n, 2 * i): for j in range(i * i, n, 2 * i):
primes[j] = 0 primes[j] = 0