projecteuler---->problem=20----Factorial digit sum
2014-06-05 08:26
471 查看
n! means n
![](https://projecteuler.net/images/symbol_times.gif)
(n
![](https://projecteuler.net/images/symbol_minus.gif)
1)
![](https://projecteuler.net/images/symbol_times.gif)
...
![](https://projecteuler.net/images/symbol_times.gif)
3
![](https://projecteuler.net/images/symbol_times.gif)
2
![](https://projecteuler.net/images/symbol_times.gif)
1
For example, 10! = 10
![](https://projecteuler.net/images/symbol_times.gif)
9
![](https://projecteuler.net/images/symbol_times.gif)
...
![](https://projecteuler.net/images/symbol_times.gif)
3
![](https://projecteuler.net/images/symbol_times.gif)
2
![](https://projecteuler.net/images/symbol_times.gif)
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!
翻译:
n的阶乘即n! = n × (n - 1) × ... × 3 × 2 × 1。
例如,10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,并且其结果的每位数的和为3 + 6 + 2 + 8 + 8 + 0 + 0 = 27。
请求出100!的结果的每一位数的和。
![](https://projecteuler.net/images/symbol_times.gif)
(n
![](https://projecteuler.net/images/symbol_minus.gif)
1)
![](https://projecteuler.net/images/symbol_times.gif)
...
![](https://projecteuler.net/images/symbol_times.gif)
3
![](https://projecteuler.net/images/symbol_times.gif)
2
![](https://projecteuler.net/images/symbol_times.gif)
1
For example, 10! = 10
![](https://projecteuler.net/images/symbol_times.gif)
9
![](https://projecteuler.net/images/symbol_times.gif)
...
![](https://projecteuler.net/images/symbol_times.gif)
3
![](https://projecteuler.net/images/symbol_times.gif)
2
![](https://projecteuler.net/images/symbol_times.gif)
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!
翻译:
n的阶乘即n! = n × (n - 1) × ... × 3 × 2 × 1。
例如,10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,并且其结果的每位数的和为3 + 6 + 2 + 8 + 8 + 0 + 0 = 27。
请求出100!的结果的每一位数的和。
m=1 for i in range(1,101): m*=i resu=0 while m>0: resu+=m%10 m/=10 print resu
相关文章推荐
- projecteuler---->problem=16----Power digit sum
- Problem 20 Factorial digit sum (阶乘数和)
- Project Euler Problem 20 Factorial digit sum
- Problem 20:Factorial digit sum
- projecteuler---->problem=33----Digit canceling fractions
- projecteuler---->problem=6----Sum square difference
- Matlab 编程 Project Euler Problem 20 Factorial digit sum
- projecteuler---->problem=18----Maximum path sum I
- projecteuler---->problem=25----1000-digit Fibonacci number
- projecteuler---->problem=30----Digit fifth powers
- Project Euler:Problem 20 Factorial digit sum
- projecteuler---->problem=14----Longest Collatz sequence
- projecteuler---->problem=3----Largest prime factor
- projecteuler---->problem=28----Number spiral diagonals
- projecteuler---->problem=27----Quadratic primes
- projecteuler---->problem=8----Largest product in a series
- projecteuler---->problem=21----Amicable numbers
- projecteuler---->problem=19----Counting Sundays
- projecteuler---->problem=31----Coin sums 无限背包计算可能存在的次数
- Project Euler 20 Factorial digit sum(大数乘法)