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

Reduce allocations and refactoring

Browse Source
This commit is contained in:
David Doblas Jiménez 2022-10-12 20:46:48 +02:00
parent 3cf341159b
commit 4bac47687b
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/Julia/Problems001-050/Problem015.jl
View File

@ -1,4 +1,4 @@
using Base:Integer
using Base: Integer
#=
Created on 25 Jul 2021
@ -17,8 +17,11 @@ function Problem15()
right corner.
How many such routes are there through a 20×20 grid? =#
n = 20
return Integer(factorial(big(2n)) / (factorial(big(n)) * factorial(big(2n - n))))
n::Int8 = 20
numerator::BigInt = factorial(big(2n))
denominator1::BigInt = big(factorial(n))
denominator2::BigInt = big(factorial(2n - n))
return BigInt(numerator / (denominator1 * denominator2))
end