Project Euler -> problem 4
2013-08-22 15:33
369 查看
4. 一个回文数指的是从左向右和从右向左读都一样的数字。最大的由两个两位数乘积构成的回文数是
9009 = 91 * 99。找出最大的有由个三位数乘积构成的回文数。
int main(void)
{
int
i,j,t,k,n=0;
for(i=100;i<=999;i++)
for(j=100;j<=999;j++){
//求回问数算法
for(t=0,k=i*j;k>0;k/=10)
t=t*10+k;
if(t==i*j){
n=i*j>n?i*j:n;
}
}
printf("The largest palindrome
made from the product of two 3-digit numbers is:%d\n",n);
return
0;
}
9009 = 91 * 99。找出最大的有由个三位数乘积构成的回文数。
int main(void)
{
int
i,j,t,k,n=0;
for(i=100;i<=999;i++)
for(j=100;j<=999;j++){
//求回问数算法
for(t=0,k=i*j;k>0;k/=10)
t=t*10+k;
if(t==i*j){
n=i*j>n?i*j:n;
}
}
printf("The largest palindrome
made from the product of two 3-digit numbers is:%d\n",n);
return
0;
}
Answer: | 906609 |
相关文章推荐
- Project Euler -> problem 2
- Project Euler -> problem 3
- Project Euler -> problem 5
- Project Euler -> problem 6
- Project Euler -> problem 7
- Project Euler -> problem 8
- Project Euler -> problem 9
- Project Euler -> problem 12
- Project Euler -> problem 1
- Project Euler -> prob 4000 lem 11
- project euler Problem 18 & 36
- projecteuler---->problem=33----Digit canceling fractions
- Project Euler Problem 30
- ZOJ 3686 A Simple Tree Problem(将对树的操作转化成区间=>线段树)
-  |"|&|<|>等html字符转义
- The7th Zhejiang Provincial Collegiate Programming Contest->Problem A:A - Who is Older?
- Test11_6&nbsp;指针用p-&gt;X和(*p).X等价
- JSP 之 JSTL_04:<c:forTokens>
- Linux-world-2012-January->16(mini2440 uboot201103 系统移植)->3(machine ID problem)
- project euler Largest prime factor&Largest palindrome product