随笔分类 -  ProjectEuler

Project Euler Problem 24 Lexicographic permutations
摘要:Lexicographic permutationsProblem 24A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation ... 阅读全文

posted @ 2017-03-28 08:22 海岛Blog 阅读(213) 评论(0) 推荐(0)

Project Euler Problem 19 Counting Sundays
摘要:Counting SundaysProblem 19You are given the following information, but you may prefer to do some research for yourself.1 Jan 1900 was ... 阅读全文

posted @ 2017-03-27 04:01 海岛Blog 阅读(170) 评论(0) 推荐(0)

Project Euler Problem 17 Number letter counts
摘要:Number letter countsProblem 17If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + ... 阅读全文

posted @ 2017-03-26 15:57 海岛Blog 阅读(317) 评论(0) 推荐(0)

Project Euler Problem 92 Square digit chains
摘要:Square digit chainsProblem 92A number chain is created by continuously adding the square of the digits in a number to form a new numbe... 阅读全文

posted @ 2017-03-25 08:37 海岛Blog 阅读(141) 评论(0) 推荐(0)

Project Euler Problem 543 Prime-Sum Numbers
摘要:Prime-Sum NumbersProblem 543Define function P(n,k) = 1 ifn can be written as the sum of k prime numbers (with repetitions allowed), an... 阅读全文

posted @ 2017-03-24 08:04 海岛Blog 阅读(167) 评论(0) 推荐(0)

Project Euler Problem 99 Largest exponential
摘要:Largest exponentialProblem 99Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would con... 阅读全文

posted @ 2017-03-23 21:12 海岛Blog 阅读(116) 评论(0) 推荐(0)

Project Euler Problem 21 Amicable numbers
摘要:Amicable numbersProblem 21Let d(n) be defined as the sum of proper divisors ofn (numbers less thann which divide evenly into n).If d(a... 阅读全文

posted @ 2017-03-23 09:11 海岛Blog 阅读(154) 评论(0) 推荐(0)

Project Euler Problem 25 1000-digit Fibonacci number
摘要:1000-digit Fibonacci numberProblem 25The Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F... 阅读全文

posted @ 2017-03-23 06:35 海岛Blog 阅读(198) 评论(0) 推荐(0)

Project Euler Problem 20 Factorial digit sum
摘要:Factorial digit sumProblem 20n! means n × (n − 1) × ... × 3 × 2 × 1For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,and the sum o... 阅读全文

posted @ 2017-03-23 00:11 海岛Blog 阅读(158) 评论(0) 推荐(0)

Project Euler Problem 67 Maximum path sum II
摘要:Maximum path sum IIProblem 67By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum... 阅读全文

posted @ 2017-03-22 23:06 海岛Blog 阅读(136) 评论(0) 推荐(0)

导航