mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
43 lines
844 B
Python
43 lines
844 B
Python
"""
|
||
Problem 20: https://projecteuler.net/problem=20
|
||
|
||
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(num: int = 100) -> int:
|
||
"""Returns the sum of the digits in the factorial of num
|
||
>>> 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(num))))
|
||
|
||
|
||
if __name__ == "__main__":
|
||
print(solution(int(input("Enter the Number: ").strip())))
|