daviddoji/project-euler
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Refactoring for memory allocation improvement

Browse Source
This commit is contained in:
David Doblas Jiménez
2021-07-22 14:52:09 +02:00
parent 7e6e92b13e
commit da0f1ba9a6
1 changed files with 3 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/Julia/Problem012.jl
View File

@@ -36,19 +36,11 @@ function Problem12()
=# =#
function num_divisors(n) function num_divisors(n)
res = floor(Int, sqrt(n)) r = isqrt(n)
divs = Int[] 2 * count(n % i == 0 for i in 1:r) - (r^2 == n)
for i = 1:res
if n % i == 0
append!(divs, i)
end
end
if res^2 == n
pop!(divs)
end
return 2 * length(divs)
end end
triangle = 0 triangle = 0
for i in Iterators.countfrom(1) for i in Iterators.countfrom(1)
triangle += i triangle += i