随笔分类 -  Project Euler

Problem5-Project Euler

摘要：Smallest multiple 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest posi 阅读全文

posted @ 2018-03-11 20:20 夜逆尘 阅读(167) 评论(1) 推荐(0)

Problem4-Project Euler

摘要：Largest palindrome product A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 阅读全文

posted @ 2018-03-10 21:30 夜逆尘 阅读(161) 评论(0) 推荐(0)

Problem2-Project Euler

摘要：Even Fibonacci numbers Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 t 阅读全文

posted @ 2018-03-09 21:32 夜逆尘 阅读(142) 评论(0) 推荐(0)

Problem1-Project Euler

摘要：Problem1-Project Euler Multiples of 3 and 5 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 阅读全文

posted @ 2018-03-08 21:59 夜逆尘 阅读(110) 评论(0) 推荐(0)