projecteuler---->problem=4----Largest palindrome product
2014-05-28 15:36
429 查看
title:
![](https://oscdn.geek-share.com/Uploads/Images/Content/201405/28/8c9c8a50005aa4343df01574fd30ce70.gif)
99.
Find the largest palindrome made from the product of two 3-digit numbers.
翻译;
假如一个数前后掉转后还是同一个数的话,那个数就叫做「回文数」。由两个二位数的积构成的最大回文数是9009 = 91 × 99。
请找出由两个三位数的积构成的最大回文数。
解答:
Largest palindrome product
Problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91![](https://oscdn.geek-share.com/Uploads/Images/Content/201405/28/8c9c8a50005aa4343df01574fd30ce70.gif)
99.
Find the largest palindrome made from the product of two 3-digit numbers.
翻译;
假如一个数前后掉转后还是同一个数的话,那个数就叫做「回文数」。由两个二位数的积构成的最大回文数是9009 = 91 × 99。
请找出由两个三位数的积构成的最大回文数。
解答:
def isOk(a): n=0 b=[0]*100 while a>0: b =a%10 a /= 10 n += 1 for i in range(n//2): if b[i]!=b[n-i-1]: return False return True m=0 for i in range(100,999): for j in range(100,999): if isOk(i*j) : if i*j > m: m = i*j; print m
相关文章推荐
- projecteuler---->problem=8----Largest product in a series
- projecteuler---->problem=8----Largest product in a series
- projecteuler---->problem=11----Largest product in a grid
- projecteuler---->problem=11----Largest product in a grid
- projecteuler---->problem=3----Largest prime factor
- projecteuler---->problem=22----Names scores
- projecteuler---->problem=28----Number spiral diagonals
- (Problem 4)Largest palindrome product
- (Problem 4)Largest palindrome product
- projecteuler---->problem=24----Lexicographic permutations
- projecteuler---->problem=18----Maximum path sum I
- projecteuler---->problem=27----Quadratic primes
- (Problem 4)Largest palindrome product
- projecteuler---->problem:2
- projecteuler---->problem=10----Summation of primes
- projecteuler---->problem=19----Counting Sundays
- 【Project Euler】【Problem 4】Largest palindrome product
- projecteuler---->problem=20----Factorial digit sum
- projecteuler---->problem:1
- projecteuler---->problem=13----Large sum