One way to solve the problem 411 in clojure
•
0 likes•344 views
One way to solve the Problem 411 in Clojure Clj-Syd May 2013 During the first clj-syd hack night we all discussed possible approaches on solving the ProjectEuler problem 411 and we started solving it. After few weeks I finally solved it and this is how I did it.
Recommended
Recommended
More Related Content
Viewers also liked
Viewers also liked (15)
More from Filippo Vitale
More from Filippo Vitale (6)
Recently uploaded
Recently uploaded (20)
One way to solve the problem 411 in clojure
- 1. clj-sydpep-411 "It was nice to meet you at the first clj-syd hack night"
- 2. clj-sydpep-411 "It was nice to meet you at the first clj-syd hack night" aka "One way to solve the Problem 411 in Clojure"
- 4. Problem411
- 9. Problem411stationgeneration (x, y) = (2i mod n, 3i mod n) i = [0..2n]
- 10. Problem411stationgeneration n = 22 44 stations (2n) 11 distinct stations
- 11. Problem41130instances k = [1..30] n = k5
- 12. Problem41130instances k = [1..30] n = k5 Σsolve(n)
- 13. Problem41130instances k = [1..30] n = k5 Σsolve(n)
- 14. Problem411n = k5
- 17. NaïveAlgorithmgeneratestations (x, y) = (2i mod n, 3i mod n) i = [0..2n]
- 37. QuadTree
- 38. QuadTree
- 39. PointQuadTree
- 41. *QuadTree
- 69. SortedMapofSortedSet PatienceSorting [1 3 5 8 10] [1 4 5 8 10] [1 4 6 8 10] ...
- 103. DSasaSortedSet
- 104. DSasaSortedSetFullScale? k=30 --> n=305 --> 24,300,000
- 105. DSasaSortedSetFullScale? k=30 --> n=305 --> 24,300,000 Everything --> "mod n"
- 106. DSasaSortedSetFullScale? k=30 --> n=305 --> 24,300,000
- 111. HerebeDragons
- 112. HerebeDragons
- 113. Optimisationsinnermostloops "Ifatreefallsinaforestand nooneisaroundtohearit, doesitmakeasound?"
- 115. map-pmap-r/map
- 117. *mapyoumulticore,uh?
- 118. *mapyoumulticore,uh?
- 119. what'snext?
- 124. Questions? Twitter @filippovitale BitBucket: filippovitale GitHub: filippovitale
- 125. Thankyou! Twitter @filippovitale BitBucket / GitHub: filippovitale
- 126. fin