mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
54 lines
972 B
Python
54 lines
972 B
Python
# -*- coding: utf-8 -*-
|
|
"""
|
|
By listing the first six prime numbers:
|
|
|
|
2, 3, 5, 7, 11, and 13
|
|
|
|
We can see that the 6th prime is 13. What is the Nth prime number?
|
|
"""
|
|
from __future__ import print_function
|
|
import math
|
|
import itertools
|
|
|
|
try:
|
|
raw_input # Python 2
|
|
except NameError:
|
|
raw_input = input # Python 3
|
|
|
|
|
|
def primeCheck(number):
|
|
if number % 2 == 0 and number > 2:
|
|
return False
|
|
return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))
|
|
|
|
|
|
def prime_generator():
|
|
num = 2
|
|
while True:
|
|
if primeCheck(num):
|
|
yield num
|
|
num += 1
|
|
|
|
|
|
def solution(n):
|
|
"""Returns the n-th prime number.
|
|
|
|
>>> solution(6)
|
|
13
|
|
>>> solution(1)
|
|
2
|
|
>>> solution(3)
|
|
5
|
|
>>> solution(20)
|
|
71
|
|
>>> solution(50)
|
|
229
|
|
>>> solution(100)
|
|
541
|
|
"""
|
|
return next(itertools.islice(prime_generator(), n - 1, n))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(raw_input().strip())))
|