Files
ProjectEulerPython/Problem10.py

54 lines
1.9 KiB
Python

#Project Euler/Python/Problem10.py
#Matthew Ellison
# Created: 01-30-19
#Modified: 03-28-19
#Find the sum of all the primes below two million
#Unless otherwise listed, all of my non-standard imports can be gotten from my pyClasses repository at https://bitbucket.org/Mattrixwv/pyClasses
"""
Copyright (C) 2019 Matthew Ellison
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
"""
from Stopwatch import Stopwatch
from Algorithms import getPrimes
__numberGreaterThanPrimes = 2000000 #Get all primes <= this number
def Problem10():
#Get all of the primes < 2000000
primes = getPrimes(__numberGreaterThanPrimes - 1)
#Get the sum of the list
primeSum = sum(primes)
#Print the results
print("The sum of all the prime numbers less than " + str(__numberGreaterThanPrimes) + " is " + str(primeSum))
#If you are running this file, automatically start the correct function
if __name__ == "__main__":
timer = Stopwatch() #Determines the algorithm's run time
timer.start() #Start the timer
Problem10() #Call the function that answers the question
timer.stop() #Stop the timer
#Print the results of the timer
print("It took " + timer.getString() + " to run this algorithm")
"""Results:
The sum of all the prime numbers less than 2000000 is 142913828922
It took 5.926 seconds to run this algorithm
"""