自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

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

Problem 87 : Prime power triples The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, th...

2019-03-12 16:15:34 66 0

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

Problem 86 : Cuboid route A 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 tra...

2019-03-12 15:30:44 66 0

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

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

2019-02-28 11:48:05 528 1

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

Problem 85 : Counting rectangles By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles: Alth...

2019-02-26 15:10:00 81 1

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

Problem 84 : Monopoly odds In the game, Monopoly, the standard board is set up in the following way: A player starts on the GO square and adds th...

2019-02-25 14:09:09 130 3

转载 100道Python编程练习题

100+ Python challenging programming exercise 100道Python编程练习题,这些题如果能坚持每天至少完成一道,一定可以帮大家轻松 get Python 的编程技能。目前,这个项目已经获得了 2924 Stars,2468 Forks。 首先,这 1...

2019-01-31 17:15:57 10314 3

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

Problem 83 : Path sum: four ways NOTE: This problem is a significantly more challenging version of Problem 81. In the 5 by 5 matrix below, the mini...

2019-01-30 10:23:26 154 1

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

Problem 82 : Path sum: three ways NOTE: This problem is a more challenging version of Problem 81. The minimal path sum in the 5 by 5 matrix below, ...

2019-01-28 16:16:47 144 1

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

Problem 81 : Path sum: two ways In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right ...

2019-01-25 18:12:49 67 2

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

Problem 80 : Square root digital expansion It is well known that if the square root of a natural number is not an integer, then it is irrational. Th...

2019-01-24 14:51:09 139 2

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

Problem 79 : Passcode derivation A common security method used for online banking is to ask the user for three random characters from a passcode. Fo...

2019-01-22 18:19:42 107 1

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

Problem 78 : Coin partitions Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins c...

2019-01-17 19:04:21 94 1

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

Problem 77 : Prime summations It is possible to write ten as the sum of primes in exactly five different ways: 7 + 3 5 + 5 5 + 3 + 2 3 + 3 + 2 +...

2019-01-16 15:21:03 183 1

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

Problem 76 : Counting summations It is possible to write five as a sum in exactly six different ways: 4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 ...

2019-01-16 13:35:29 178 1

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

Problem 75 : Singular integer right triangles It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right...

2019-01-15 15:49:58 174 3

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

Problem 74 : Digit factorial chains The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145: 1! +...

2019-01-15 11:45:43 180 1

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

Problem 73 : Counting fractions in a range Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is ...

2019-01-14 15:35:56 83 1

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

Problem 72 : Counting fractions Consider the fraction, n/d, where n and d are positive integers. If n<d and H...

2019-01-13 20:07:16 76 2

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

Problem 71 : Ordered fractions Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it...

2019-01-13 19:56:14 113 1

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

Problem 70 : Totient permutation Euler’s Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive num...

2019-01-11 17:31:37 85 2

原创 Project Euler Problem 69 (C++和Python代码实现和解析)

Problem 69 : Totient maximum Euler’s Totient function, φ(n) [sometimes called the phi function], is used to determine the number of numbers less tha...

2019-01-11 13:20:47 122 2

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

Problem 68 : Magic 5-gon ring Consider the following “magic” 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine. Working cl...

2019-01-09 17:54:49 99 8

原创 Python入门到提高

1. 列表 1.1 列表赋值 下面是比较经典的列表赋值方法: my_list = [] for i in range(1, 11): my_list.append(i) print(my_list) 我们使用了 my_list.append(i) 来赋值。 或者 m...

2019-01-07 17:49:56 107 0

原创 Python快速入门

1. Python 入门 1.1 Python 简介 Python 是一种易于学习又功能强大的编程语言。它提供了高效的高级数据结构,还有简单有效的面向对象编程。Python 优雅的语法和动态类型,以及解释型语言的本质,使它成为多数平台上写脚本和快速开发应用的理想语言。 Python 解释器及...

2019-01-06 15:32:12 203 0

原创 Project Euler Problem 67 (C++和Python)

Problem 67 : Maximum path sum II By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total fro...

2019-01-05 15:57:40 92 2

原创 Project Euler Problem 66 (C++和Python)

Problem 17 : Diophantine equation Consider quadratic Diophantine equations of the form: x2 – Dy2 = 1 For example, when D=13, the minimal solution ...

2019-01-04 18:57:21 85 1

原创 Project Euler Problem 65 (C++和Python)

Problem 65 : Convergents of e Hence the sequence of the first ten convergents for √2 are: 1, 3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408, 139...

2018-12-30 21:10:52 137 1

原创 Project Euler Problem 64 (C++和Python)

Problem 64 : Odd period square roots All square roots are periodic when written as continued fractions and can be written in the form: It can be ...

2018-12-29 16:38:47 77 1

原创 Project Euler Problem 63 (C++和 Python)

Problem 63 : Powerful digit counts The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number, 134217728=89, is a ninth powe...

2018-12-28 19:28:27 141 1

原创 Project Euler Problem 62 (C++和Python)

Problem 62 : Cubic permutations The cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). In fact,...

2018-12-27 18:12:23 75 1

原创 Project Euler Problem 61 (C++和Python)

Problem 61 : Cyclical figurate numbers Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbe...

2018-12-27 16:19:48 69 1

原创 Project Euler Problem 60 (C++和Python)

Problem 60 : Prime pair sets The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the r...

2018-12-26 13:49:42 84 3

原创 Project Euler Problem 59 (C++和Python)

Problem 59 : XOR decryption Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for I...

2018-12-23 21:38:08 108 2

原创 Project Euler Problem 58 (C++和Python)

Problem 58 : Spiral primes Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed. 37 36 3...

2018-12-21 18:50:45 105 2

原创 Project Euler Problem 57 (C++和Python)

Problem 57 : Square root convergents It is possible to show that the square root of two can be expressed as an infinite continued fraction. √ 2 = 1...

2018-12-21 17:53:27 87 1

原创 Project Euler Problem 56 (C++和Python)

Problem 56 : Powerful digit sum A googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one fo...

2018-12-21 16:39:30 74 1

原创 Project Euler Poblem 55 (C++和Python)

Problem 55 : Lychrel numbers If we take 47, reverse and add, 47 + 74 = 121, which is palindromic. Not all numbers produce palindromes so quickly. F...

2018-12-20 17:23:46 113 1

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

Problem 54: Poker hands In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way: High ...

2018-12-19 14:58:45 237 2

原创 Project Euler Problem 53 (C++和Python)

Problem 53: Combinatoric selections There are exactly ten ways of selecting three from five, 12345: 123, 124, 125, 134, 135, 145, 234, 235, 245, an...

2018-12-19 14:29:54 67 1

原创 Project Euler Problem 52 (C++和Python)

Problem 52: Permuted multiples It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different o...

2018-12-19 14:18:12 54 1

提示
确定要删除当前文章?
取消 删除