mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-19 19:03:02 +08:00
Project Euler problems 06, 20 (#1419)
* added sol3.py for problem_20 * added sol4.py for problem_06
This commit is contained in:

committed by
Christian Clauss

parent
906c985de3
commit
11e2207182
39
project_euler/problem_20/sol3.py
Normal file
39
project_euler/problem_20/sol3.py
Normal file
@ -0,0 +1,39 @@
|
||||
"""
|
||||
n! means n × (n − 1) × ... × 3 × 2 × 1
|
||||
|
||||
For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
|
||||
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.
|
||||
|
||||
Find the sum of the digits in the number 100!
|
||||
"""
|
||||
from math import factorial
|
||||
|
||||
|
||||
def solution(n):
|
||||
"""Returns the sum of the digits in the number 100!
|
||||
>>> solution(1000)
|
||||
10539
|
||||
>>> solution(200)
|
||||
1404
|
||||
>>> solution(100)
|
||||
648
|
||||
>>> solution(50)
|
||||
216
|
||||
>>> solution(10)
|
||||
27
|
||||
>>> solution(5)
|
||||
3
|
||||
>>> solution(3)
|
||||
6
|
||||
>>> solution(2)
|
||||
2
|
||||
>>> solution(1)
|
||||
1
|
||||
>>> solution(0)
|
||||
1
|
||||
"""
|
||||
return sum(map(int, str(factorial(n))))
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
print(solution(int(input("Enter the Number: ").strip())))
|
Reference in New Issue
Block a user