project-euler-100

[RADIOACTIVE] solutions to the first 100 challenges of project euler
git clone git://git.figbert.com/project-euler-100.git
Log | Files | Refs | README

commit 5b2b51069ba1a30fff86139a767cfbfff44b6d27
parent c184e97a5dcd2503c240119098cd690bdd77f3ca
Author: therealFIGBERT <figbertwelner@gmail.com>
Date:   Sat, 25 Jan 2020 15:49:11 -0800

Remove redundant function from solution to problem 7

Diffstat:
Mproblem007.py | 13+++++--------
1 file changed, 5 insertions(+), 8 deletions(-)

diff --git a/problem007.py b/problem007.py @@ -15,12 +15,9 @@ def sieveOfEratosthenes(limit): prime[0:2] = [False, False] return [p for p in range(limit + 1) if prime[p]] -def search(): - searchRange = 1000 +searchRange = 1000 +returnValue = sieveOfEratosthenes(searchRange) +while len(returnValue) < 10001: + searchRange += 1000 returnValue = sieveOfEratosthenes(searchRange) - while len(returnValue) < 10001: - searchRange += 1000 - returnValue = sieveOfEratosthenes(searchRange) - print("The 10,001st prime number is %s" % returnValue[10000]) - -search() +print("The 10,001st prime number is %s" % returnValue[10000])