.net

Recursos de programación de .net
Web
03-09-2014
This is my solution in Clojure to the ninth problem from Euler project: - por Garajeando
Web
03-09-2014
This is my solution in Clojure to the eighth problem from Euler project: - por Garajeando
Web
02-09-2014
This is my solution in Clojure to the seventh problem from Euler project: It works but it's quite slow. - por Garajeando
Web
01-09-2014
This is my solution in Clojure to the sixth problem from Euler project: - por Garajeando
Web
31-08-2014
I solved the fifth problem from Euler project in Clojure. My first approach was not successful: Even though it could compute the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder, it didn't work for 1 to 20. It consumed to much memory. So I used pen and paper to devise a better approach to solve the problem. I saw that the numbers from 1 to 10 which multiplied produce 2520 are 9, 8, 7 and 5. What these numbers have in common is that they all have one p...
Web
31-08-2014
This is my solution in Clojure to the fourth problem from Euler project: It was nice to practise with for. - por Garajeando
Web
25-08-2014
This is my solution in Clojure to the third problem from Euler project: The largests-prime-factor function can be also written in this alternative way using Clojure's ->> macro: - por Garajeando
Web
17-08-2014
I've just watched this great talk by Tomas Petricek: Domain Specific Languages, the functional way - por Garajeando