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 fb2c1588073ceba757086d8120fc6ac5e944553b
parent baa72a3bc51784bfd4d8e975d8eac155a6e7bf78
Author: therealFIGBERT <figbertwelner@gmail.com>
Date:   Sat, 25 Jan 2020 12:46:37 -0800

Add more details to the output of the solution to problem 7

Diffstat:
Mproblem007.py | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problem007.py b/problem007.py @@ -24,6 +24,6 @@ def search(): while len(returnValue) < 10001: searchRange += 1000 returnValue = sieveOfEratosthenes(searchRange) - print(returnValue[10000]) + print("The 10,001st prime number is %s" % returnValue[10000]) search()