project euler Problem 34
2014-06-13 00:00
417 查看
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
相关文章推荐
- Project Euler:Problem 34 Digit factorials
- Project Euler:Problem 34 Digit factorials
- Problem 34 Digit factorials (暴力)
- Project Euler 34
- (Problem 34)Digit factorials
- [Project Euler] Problem 5
- [Project Euler] Problem 20
- [Project Euler] Problem 30
- [Project Euler] Problem 18 & Problem 67 Python解答
- Project Euler:Problem 13 Large sum
- Project Euler:Problem 30 Digit fifth powers
- Project Euler:Problem 38 Pandigital multiples
- (Problem 34)Digit factorials
- Project Euler:Problem 52 Permuted multiples
- Project Euler:Problem 88 Product-sum numbers
- Project Euler:Problem 60 Prime pair sets
- Project Euler:Problem 70 Totient permutation
- Project Euler:Problem 75 Singular integer right triangles
- Project Euler – Problem 23
- Project Euler:Problem 39 Integer right triangles