Project Euler
_Mr_Robot_
这个作者很懒,什么都没留下…
展开
-
Euler project3: the largest prime factor
问题描述:The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?C++:#includeusing namespace std;int main(){ long long n,ans=2; c原创 2017-07-30 16:41:45 · 210 阅读 · 0 评论 -
Proiect Euler problem 4 : Largest palindrome product
回文数必被11整除;从第三点得到的启发还是很大的。我们可以从下面的关系式得出这个结论:P = 100000x + 10000y + 1000z + 100z + 10y + xP = 100001x + 10010y + 1100zP = 11 * (9091x + 910y + 100z)原创 2017-07-31 18:37:55 · 248 阅读 · 0 评论 -
Prioject Euler problem2 :Even Fibonacci numbers
问题描述:Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...By cons原创 2017-07-28 22:59:27 · 277 阅读 · 0 评论 -
Priject Euler problem 1:multiples of 3 or 5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Find the sum of all the multiples of 3 or 5 below 1000.#include us原创 2017-07-28 22:31:51 · 301 阅读 · 0 评论