project euler Problem 34
2013-03-24 17:01
459 查看
def JieCheng(n): sum=1 for i in range(2,n+1): sum=sum*i return sum def Judge(n): s=str(n) sum=0 for i in s: sum+=JieCheng(int(i)) if(sum==n): return True else: return False sum=0 for i in range(3,100000): if(Judge(i)): sum+=i print sum
相关文章推荐
- http://projecteuler.net/problem=34 [Answer:40730]
- Project Euler Problem 34 Digit factorials
- Project Euler problem 34
- Project Euler Problem 13 Large sum
- Project Euler Problem 25
- Project Euler Problem 17
- Project Euler problem 16
- Project Euler problem 26 分数化小数
- Project Euler problem 48 处理乘法取模爆long long的方法
- 欧拉,projecteuler Problem 83
- Project Euler Problem 3
- project euler Problem 39
- project euler Problem 13
- project euler Problem 13
- http://projecteuler.net/problem=1 [解法参考]
- http://projecteuler.net/problem=6 【参考解法】
- http://projecteuler.net/problem=36 [Answer:872187]
- http://projecteuler.net/problem=40 [Answer:210]
- Project Euler -> problem 1
- Project Euler problem 63