Added doctest and more explanation about Dijkstra execution. (#1014)

* 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()'
This commit is contained in:
Bruno Simas Hadlich
2019-07-16 20:09:53 -03:00
committed by cclauss
parent 2fb3beeaf1
commit 267b5eff40
100 changed files with 2621 additions and 1438 deletions

View File

@ -1,38 +1,60 @@
"""
Problem Statement:
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.
"""
from __future__ import print_function
from math import sqrt
try:
xrange #Python 2
raw_input # Python 2
except NameError:
xrange = range #Python 3
raw_input = input # Python 3
try:
xrange # Python 2
except NameError:
xrange = range # Python 3
def is_prime(n):
for i in xrange(2, int(sqrt(n))+1):
if n%i == 0:
return False
for i in xrange(2, int(sqrt(n)) + 1):
if n % i == 0:
return False
return True
return True
def sum_of_primes(n):
if n > 2:
sumOfPrimes = 2
else:
return 0
if n > 2:
sumOfPrimes = 2
else:
return 0
for i in xrange(3, n, 2):
if is_prime(i):
sumOfPrimes += i
for i in xrange(3, n, 2):
if is_prime(i):
sumOfPrimes += i
return sumOfPrimes
return sumOfPrimes
if __name__ == '__main__':
import sys
if len(sys.argv) == 1:
print(sum_of_primes(2000000))
else:
try:
n = int(sys.argv[1])
print(sum_of_primes(n))
except ValueError:
print('Invalid entry - please enter a number.')
def solution(n):
"""Returns the sum of all the primes below n.
>>> solution(2000000)
142913828922
>>> solution(1000)
76127
>>> solution(5000)
1548136
>>> solution(10000)
5736396
>>> solution(7)
10
"""
return sum_of_primes(n)
if __name__ == "__main__":
print(solution(int(raw_input().strip())))