2 jiafengfu

尚未进行身份认证

我要认证

C++,Python,算法,AI/ML

等级
TA的排名 3w+

Project Euler Problem 87 (Python和C++代码实现和解析)

Problem 87 : Prime power triplesThe smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be...

2019-03-12 16:15:34

Project Euler Problem 86 (Python和C++代码实现和解析)

Problem 86 : Cuboid routeA spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest “st...

2019-03-12 15:30:44

Python编程: 多个PDF文件合并以及网页上自动下载PDF文件

1. 需求有时候,我们下载了多个PDF文件, 但希望能把它们合并成一个PDF文件。例如:你下载的数个PDF文件资料或者电子发票,你可以使用python程序合并成一个PDF文件,无论是阅读或是打印都更方便些。2. 分析首先,我们要读取某一个目录(为了简化,我们假设Python代码和PDF文件都放在此目录下)的所有PDF文件,然后调用 PdfFileMerger 库进行合并,最后打印输出文件完成...

2019-02-28 11:48:05

Project Euler Problem 85 (C++和Python代码实现和解析)

Problem 85 : Counting rectanglesBy counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:Although there exists no rectangular grid that contains ex...

2019-02-26 15:10:00

Project Euler Problem 84 (C++和Python代码实现和解析)***

Problem 84 : Monopoly oddsIn the game, Monopoly, the standard board is set up in the following way:A player starts on the GO square and adds the scores on two 6-sided dice to determine the number o...

2019-02-25 14:09:09

100道Python编程练习题

100+ Python challenging programming exercise100道Python编程练习题,这些题如果能坚持每天至少完成一道,一定可以帮大家轻松 get Python 的编程技能。目前,这个项目已经获得了 2924 Stars,2468 Forks。首先,这 100+ 练习题根据难易程度分为三个等级:Level 1、2 和 3。下面对如何定义这三个 Level 进行...

2019-01-31 17:15:57

Project Euler Problem 83 (C++和Python代码实现和解析)***

Problem 83 : Path sum: four waysNOTE: This problem is a significantly more challenging version of Problem 81.In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, b...

2019-01-30 10:23:26

Project Euler Problem 82 (C++和Python代码实现和解析)

Problem 82 : Path sum: three waysNOTE: This problem is a more challenging version of Problem 81.The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finish...

2019-01-28 16:16:47

Project Euler Problem 81 (C++和Python代码实现和解析)

Problem 81 : Path sum: two waysIn the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2...

2019-01-25 18:12:49

Project Euler Problem 80 (C++和Python代码实现和解析)

Problem 80 : Square root digital expansionIt is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite...

2019-01-24 14:51:09

Project Euler Problem 79 (C++和Python代码实现和解析)

Problem 79 : Passcode derivationA common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask ...

2019-01-22 18:19:42

Project Euler Problem 78 (C++和Python代码实现和解析)

Problem 78 : Coin partitionsLet p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven differen...

2019-01-17 19:04:21

Project Euler Problem 77 (C++和Python代码实现和解析)

Problem 77 : Prime summationsIt is possible to write ten as the sum of primes in exactly five different ways:7 + 35 + 55 + 3 + 23 + 3 + 2 + 22 + 2 + 2 + 2 + 2What is the first value which can b...

2019-01-16 15:21:03

Project Euler Problem 76 (C++和Python代码实现和解析)

Problem 76 : Counting summationsIt is possible to write five as a sum in exactly six different ways:4 + 13 + 23 + 1 + 12 + 2 + 12 + 1 + 1 + 11 + 1 + 1 + 1 + 1How many different ways can one...

2019-01-16 13:35:29

Project Euler Problem 75 (C++和Python代码实现和解析)

Problem 75 : Singular integer right trianglesIt turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are ma...

2019-01-15 15:49:58

Project Euler Problem 74 (C++和Python代码实现和解析)

Problem 74 : Digit factorial chainsThe number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:1! + 4! + 5! = 1 + 24 + 120 = 145Perhaps less well known...

2019-01-15 11:45:43

Project Euler Problem 73 (C++和Python代码实现和解析)

Problem 73 : Counting fractions in a rangeConsider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of redu...

2019-01-14 15:35:56

Project Euler Problem 72 (C++和Python代码实现和解析)

Problem 72 : Counting fractionsConsider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper ...

2019-01-13 20:07:16

Project Euler Problem 71 (C++和Python代码实现和解析)

Problem 71 : Ordered fractionsConsider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper f...

2019-01-13 19:56:14

Project Euler Problem 70 (C++和Python代码实现和解析)

Problem 70 : Totient permutationEuler’s Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n which are relatively pr...

2019-01-11 17:31:37

查看更多

勋章 我的勋章
  • 签到新秀
    签到新秀
    累计签到获取,不积跬步,无以至千里,继续坚持!
  • 专栏达人
    专栏达人
    授予成功创建个人博客专栏的用户。专栏中添加五篇以上博文即可点亮!撰写博客专栏浓缩技术精华,专栏达人就是你!
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!