#Project Eulter/Python/Problem7.py
#Matthew Ellison
# Created: 01-29-19
#Modified: 03-28-19
#What is the 10001th prime number?
#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 getNumPrimes

__numPrimes = 10001		#The number of the prime number desired


def Problem7():
	#Get the correct number of primes
	primes = getNumPrimes(__numPrimes)

	#Print the results
	print("The " + str(__numPrimes) + "th prime number is " + str(primes[__numPrimes - 1]))

#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
	Problem7()		#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 10001th prime number is 104743
It took 139.545 milliseconds to run this algorithm
"""