Project Euler（欧拉计划）解题报告【不断更新】

先写在前头，里面所有的题大都是我的个人解题报告，由于我的能力，不可避免的有许多不足，如果有解题有错误或者遗漏，还望指出，谢谢。

先简单介绍下 $ProjectEuler$

Project Euler欧拉计划（Project Euler）是一系列有挑战性的数学与计算机编程题；要解开它们，需要的不止是数学知识：尽管数学能够帮助你找到一些优雅而有效的方法，大多数题目仍需要借助计算机和编程技巧来完成解答。

---

I’ve written my program but should it take days to get to the answer?
Absolutely not! Each problem has been designed according to a “one-minute rule”, which means that although it may take several hours to design a successful algorithm with more difficult problems, an efficient implementation will allow a solution to be obtained on a modestly powered computer in less than one minute.

---

上面说了，一般来说每道题都是基于一分钟原则，这意味着虽然设计一个成功的算法可能需要几个小时才能解决更多难题，但是有效的实施将允许在一个适度的计算机上获得解决方案。不到一分钟。所以没有最好的算法，只有更好的算法，靠着零零散散的时间来切切题，还是建议独立思考，毕竟这里面的题，都是十分经典，真是没思路了，再参考下思路。

这里是PE的中文翻译，有兴趣的可以带走：http://pe-cn.github.io/problems/ （注意这个网站有时可能打不开，多打几下就好了）

这是我的ID以及刷题记录：https://projecteuler.net/profile/nobleman.png
这是我的交友码：1281638_n8IuNTLfsBJ63O9HxFKGCYTVwekJn2uf

欢迎互相沟通学习
每道题的答案都会在留言的首条，自取。
码字不易，如果可以帮助到您，举手之劳，希望可以赞一个，谢谢

ID	Description / Title	Concluding Report And Algorithm type
1	Multiples of 3 and 5	解题 【暴力】【容斥】
2	Even Fibonacci numbers
3	Largest prime factor
4	Largest palindrome product
5	Smallest multiple
6	Sum square difference
7	10001st prime
8	Largest product in a series
9	Special Pythagorean triplet
10	Summation of primes
11	Largest product in a grid
12	Highly divisible triangular number
13	Large sum
14	Longest Collatz sequence
15	Lattice paths
16	Power digit sum
17	Number letter counts
18	Maximum path sum I
19	Counting Sundays
20	Factorial digit sum
21	Amicable numbers
22	Names scores
23	Non-abundant sums
24	Lexicographic permutations
25	1000-digit Fibonacci number
26	Reciprocal cycles
27	Quadratic primes
28	Number spiral diagonals
29	Distinct powers
30	Digit fifth powers
31	Coin sums
32	Pandigital products
33	Digit cancelling fractions
34	Digit factorials
35	Circular primes
36	Double-base palindromes
37	Truncatable primes
38	Pandigital multiples
39	Integer right triangles
40	Champernowne’s constant
41	Pandigital prime
42	Coded triangle numbers
43	Sub-string divisibility
44	Pentagon numbers
45	Triangular, pentagonal, and hexagonal	题解 【二分】【暴力】
46	Goldbach’s other conjecture	题解 【暴力】【素数筛】
47	Distinct primes factors	题解 【素数筛】【暴力】
48	Self powers	解题 【暴力】【同余定理】
49	Prime permutations	解题 【枚举】【暴力】
50	Consecutive prime sum	解题 【暴力】【素数筛】【尺取法】
51	Prime digit replacements	题解 【暴力】【按位枚举】【stringstream】
52	Permuted multiples	题解 【暴力】
53	Combinatoric selections	题解 【组合数】
54	Poker hands	题解 【模拟】
55	Lychrel numbers	题解【暴力】
56	Powerful digit sum	题解 【暴力】
57	Square root convergents	题解 【模拟】
58	Spiral primes
59	XOR decryption
60	Prime pair sets
61	Cyclical figurate numbers
62	Cubic permutations
63	Powerful digit counts	题解 【暴力】
64	Odd period square roots
65	Convergents of e
66	Diophantine equation
67	Maximum path sum II
68	Magic 5-gon ring
69	Totient maximum
70	Totient permutation
71	Ordered fractions
72	Counting fractions
73	Counting fractions in a range
74	Digit factorial chains
75	Singular integer right triangles
76	Counting summations
77	Prime summations
78	Coin partitions
79	Passcode derivation
80	Square root digital expansion
81	Path sum: two ways
82	Path sum: three ways
83	Path sum: four ways
84	Monopoly odds
85	Counting rectangles
86	Cuboid route
87	Prime power triples
88	Product-sum numbers
89	Roman numerals
90	Cube digit pairs
91	Right triangles with integer coordinates
92	Square digit chains
93	Arithmetic expressions
94	Almost equilateral triangles
95	Amicable chains
96	Su Doku
97	Large non-Mersenne prime	题解 【快速幂】
98	Anagramic squares
99	Largest exponential
100	Arranged probability

阅读好习惯：点赞 + 收藏~