Programming is my life~!
Thursday, June 2, 2016
Project Euler 501 Eight Divisors
I think much time to solve this problem.
but easily i got depressed
because finding primes under 10^12 is too big.
my computer can only 10^9 by using Prime sieve.
so I had to find how to count primeCount under some number.
finally I solved it~!
June 02, 2016
Share to Twitter
Share to Facebook
Share to Pinterest
Post a Comment
Post Comments (Atom)