原创 https://projecteuler.net/problem=3
Largest prime factor Problem 3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of t
原创 Maximum path sum I
https://projecteuler.net/problem=18 Maximum path sum I Problem 18 By starting at the top of the triangle below and
原创 https://projecteuler.net/problem=1
自己做題玩 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
原创 壓死一隻貓,很內疚
今天下班回家的路上,開車在小路上50KM/H左右,眼睛一直在盯着前方的車,突然發現一隻黑貓飛跑過來,在前方2m,左側1-2m之間,當時感覺急剎車來不及了,而且後面還有一輛車,沒有急剎車也沒有減速,向右打了一下方向盤,感覺碰到了東西,就趕緊
原创 https://projecteuler.net/problem=2
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the f
原创 https://projecteuler.net/problem=4
Largest palindrome product Problem 4 A palindromic number reads the same both ways. The largest palindrome made from
原创 https://projecteuler.net/problem=7
10001st prime Problem 7 Published on Friday, 28th December 2001, 06:00 pm; Solved by 257306; Difficulty rating: 5%
原创 https://projecteuler.net/problem=5
歐拉問題集,第五題,最小公倍數 Smallest multiple Problem 5 2520 is the smallest number that can be divided by each of the number
原创 https://projecteuler.net/problem=6
Sum square difference Problem 6 The sum of the squares of the first ten natural numbers is, 12 + 22 + ... + 102 =
原创 Non-abundant sums
https://projecteuler.net/problem=23 Non-abundant sums Problem 23 A perfect number is a number for which the sum of i
原创 Digit fifth powers
https://projecteuler.net/problem=30 Digit fifth powers Problem 30 Surprisingly there are only three numbers that ca
原创 Coin sums
https://projecteuler.net/problem=31 Coin sums Problem 31 In England the currency is made up of pound, £, and pence,
原创 Reciprocal cycles
https://projecteuler.net/problem=26 Reciprocal cycles Problem 26 A unit fraction contains 1 in the numerator. The d
原创 Lattice paths
Lattice paths Problem 15 Starting in the top left corner of a 2×2 grid, and only being able to move to the right and
原创 Distinct powers
https://projecteuler.net/problem=29 Distinct powers Problem 29 Consider all integer combinations of ab for 2 ≤ a ≤