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()'
29 lines
505 B
Python
29 lines
505 B
Python
"""
|
|
2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
|
|
|
|
What is the sum of the digits of the number 2^1000?
|
|
"""
|
|
|
|
|
|
def solution(power):
|
|
"""Returns the sum of the digits of the number 2^power.
|
|
|
|
>>> solution(1000)
|
|
1366
|
|
>>> solution(50)
|
|
76
|
|
>>> solution(20)
|
|
31
|
|
>>> solution(15)
|
|
26
|
|
"""
|
|
n = 2 ** power
|
|
r = 0
|
|
while n:
|
|
r, n = r + n % 10, n // 10
|
|
return r
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(str(input()).strip())))
|