project euler Problem 36
2013-03-24 17:37
337 查看
def Judge(n): bstr=bin(n) bstr=bstr[2:] ostr=str(n) flag1=True flag2=True for i in range(len(bstr)): if bstr[i]!=bstr[len(bstr)-i-1]: flag1=False break for i in range(len(ostr)): if ostr[i]!=ostr[len(ostr)-i-1]: flag2=False break return flag1 and flag2 sum=0 for i in range(1,1000000): if Judge(i): sum+=i print sum
相关文章推荐
- Project Euler Problem 36
- http://projecteuler.net/problem=36 [Answer:872187]
- project euler Problem 18 & 36
- Project Euler Problem 36 Double-base palindromes
- project euler Problem 18 & 36
- project euler Problem 36
- Project Euler problem 36
- project euler Problem 25
- http://projecteuler.net/problem=27 [Answer:-59231]
- Project Euler -> problem 8
- Project Euler problem 68
- Project Euler Problem 58
- Project Euler Problem 47
- Project Euler Problem 9: Special Pythagorean triplet
- Project Euler Problem 21 Amicable numbers
- Project Euler Problem 31
- Project Euler Problem 80-高精度开方-牛顿逼近法
- Project Euler problem 14
- Project Euler problem 25
- Project Euler problem 45