
ProjectEuler
文章平均质量分 73
cfeibiao
这个作者很懒,什么都没留下…
展开
-
Problem 1:Multiples of 3 and 5
原始地址:http://projecteuler.net/problem=1Multiples of 3 and 5Problem 1If 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 mu原创 2013-08-01 23:05:32 · 1042 阅读 · 0 评论 -
Problem 20:Factorial digit sum
原题链接:http://projecteuler.net/problem=20n! means n (n 1) ... 3 2 1For example, 10! = 10 9 ... 3 2 1 = 3628800,and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 +原创 2013-09-11 23:35:11 · 1126 阅读 · 0 评论 -
Problem 19:Counting Sundays
原题链接:http://projecteuler.net/problem=19You are given the following information, but you may prefer to do some research for yourself.1 Jan 1900 was a Monday.Thirty days has September,Apri原创 2013-09-11 23:09:36 · 936 阅读 · 0 评论 -
Problem 16:Power digit sum
原题链接:http://projecteuler.net/problem=16215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.What is the sum of the digits of the number 21000?题目大意是:215 = 32768 并且其各位之和为 is 3原创 2013-09-08 22:15:01 · 929 阅读 · 0 评论 -
Problem 18:Maximum path sum I
原题链接:http://projecteuler.net/problem=18By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 6原创 2013-09-08 23:06:59 · 1268 阅读 · 0 评论 -
Problem 14:Longest Collatz sequence
原题链接:http://projecteuler.net/problem=14The following iterative sequence is defined for the set of positive integers:n n/2 (n is even)n 3n + 1 (n is odd)Using the rule above and sta原创 2013-09-08 19:38:29 · 967 阅读 · 0 评论 -
Problem 15:Lattice paths
原题链接:http://projecteuler.net/problem=15Starting in the top left corner of a 22 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.原创 2013-09-08 20:51:11 · 1076 阅读 · 0 评论 -
Problem 13:Large sum
原题链接:http://projecteuler.net/problem=13Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.37107287533902102798797998220837590246510135740250463769376774原创 2013-09-08 18:57:51 · 784 阅读 · 0 评论 -
Problem 12:Highly divisible triangular number
原题链接:http://projecteuler.net/problem=12The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The firs原创 2013-09-08 18:20:48 · 1135 阅读 · 0 评论 -
Problem 10:Summation of primes
原文地址:http://projecteuler.net/problem=10Summation of primesProblem 10The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million.原创 2013-08-03 23:52:28 · 644 阅读 · 0 评论 -
Problem 5:Smallest multiple
原文地址:http://projecteuler.net/problem=5Smallest multipleProblem 52520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.What is th原创 2013-08-02 23:05:17 · 859 阅读 · 0 评论 -
Problem 4:Largest palindrome product
原文地址:http://projecteuler.net/problem=4Largest palindrome productProblem 4A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit nu原创 2013-08-01 23:53:09 · 1035 阅读 · 0 评论 -
Problem 7:10001st prime
原文地址:http://projecteuler.net/problem=710001st primeProblem 7By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.What is the 10 001st原创 2013-08-02 23:17:18 · 983 阅读 · 2 评论 -
Problem 3:Largest prime factor
原文地址:http://projecteuler.net/problem=3Largest prime factorProblem 3The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?原创 2013-08-01 23:42:19 · 1114 阅读 · 0 评论 -
Problem 2:Even Fibonacci numbers
原文地址:http://projecteuler.net/problem=2Even Fibonacci numbersProblem 2Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2,原创 2013-08-01 23:31:18 · 847 阅读 · 0 评论 -
Problem 9:Special Pythagorean triplet
原文地址:http://projecteuler.net/problem=9Special Pythagorean tripletProblem 9A Pythagorean triplet is a set of three natural numbers, a b c, for which,a2 + b2 = c2For example, 3原创 2013-08-02 23:58:21 · 758 阅读 · 0 评论 -
Problem 11:Largest product in a grid
原文地址:http://projecteuler.net/problem=11Largest product in a gridProblem 11In the 2020 grid below, four numbers along a diagonal line have been marked in red.08 02 22 97 38 15 00 40原创 2013-08-04 00:06:45 · 1062 阅读 · 0 评论 -
Problem 8:Largest product in a series
原文地址:http://projecteuler.net/problem=8Largest product in a seriesProblem 8Find the greatest product of five consecutive digits in the 1000-digit number.7316717653133062491922511967原创 2013-08-02 23:34:41 · 1049 阅读 · 0 评论 -
Problem 17:Number letter counts
原题链接:http://projecteuler.net/problem=17If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.If all the n原创 2013-09-08 22:36:51 · 1363 阅读 · 2 评论