mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-01 00:41:09 +00:00
10fe9d9be4
* improvements for project euler task 45 * fixed documentation * update pe_16/sol1.py * update pe_16/sol2.py * revert solution changes for sol1 * revert solution changes for sol2 * remove trailing spaces in sol1 * Update sol1.py Co-authored-by: Dhruv <dhruvmanila@gmail.com>
31 lines
569 B
Python
31 lines
569 B
Python
"""
|
|
Problem 16: https://projecteuler.net/problem=16
|
|
|
|
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: int = 1000) -> int:
|
|
"""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())))
|