forked from TheAlgorithms/Python
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsol1.py
More file actions
Latest commit
36 lines (28 loc) · 775 Bytes
/
Copy pathsol1.py
File metadata and controls
36 lines (28 loc) · 775 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
"""
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?
"""
defsolution(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
"""
num=2**power
string_num=str(num)
list_num=list(string_num)
sum_of_num=0
foriinlist_num:
sum_of_num+=int(i)
returnsum_of_num
if__name__=="__main__":
power=int(input("Enter the power of 2: ").strip())
print("2 ^ ", power, " = ", 2**power)
result=solution(power)
print("Sum of the digits is: ", result)