擅长:python、mysql、java
<p>Euler 5项目</p>
<p>考虑到主要因素:</p>
<pre><code>1 = 1
2 = 2
3 = 3
4 = 2^2
5 = 5
6 = 2 * 3
7 = 7
8 = 2^3
9 = 3^3
10 = 2 * 5
11 = 11
12 = 2^2 * 3
13 = 13
14 = 2 * 7
15 = 3 * 5
16 = 2^4
17 = 17
18 = 2 * 3^2
19 = 19
20 = 2^2 * 5
</code></pre>
<p>那么这个问题真的是:
乘积((a素数)**(此公因数的最大倍数),所有公因数)</p>
^{pr2}$
<p>顺便说一句,你似乎不是第一个落入暴力陷阱的人:<a href="https://stackoverflow.com/questions/8024911/project-euler-5-in-python-how-can-i-optimize-my-solution">Project Euler 5 in Python - How can I optimize my solution?</a></p>
<p>现在找出如何在代码中实现这一点。在</p>