![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
project euler
shangbin1983
这个作者很懒,什么都没留下…
展开
-
project euler 03
<br />The prime factors of 13195 are 5, 7, 13 and 29.<br />What is the largest prime factor of the number 600851475143 ?<br /> <br /> <br />long n = 600851475143;<br /> long max = 0;<br /> for (long i = n; i > 2; i--)<br />原创 2010-08-19 15:38:00 · 234 阅读 · 0 评论 -
project euler 04
<br />A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99.<br />Find the largest palindrome made from the product of two 3-digit numbers.<br /> <br /> <br /> <br /> int temp =原创 2010-08-19 15:39:00 · 206 阅读 · 0 评论 -
project euler 06
<br />The sum of the squares of the first ten natural numbers is,12 + 22 + ... + 102 = 385<br />The square of the sum of the first ten natural numbers is,(1 + 2 + ... + 10)2 = 552 = 3025<br />Hence the difference between the sum of the squares of the first原创 2010-08-19 15:42:00 · 172 阅读 · 0 评论 -
project 01
<br />If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.<br />Find the sum of all the multiples of 3 or 5 below 1000.<br /> <br />源码如下:<br /> int K = 0;<br /> for (int i = 1; i原创 2010-08-19 15:35:00 · 209 阅读 · 0 评论