Just a quick note to say that I’ll be doing a couple of F# talks at user groups around the UK, so if you happen to be in the area at the time do come by and say hello. Feb 3rd, 6:30pm, London BCS (near the Strand) 7 ineffective coding habits many F# programmers …
The problem description is here, and click here to see all my other Euler solutions in F#. This is a more difficult version of problem 82, and now you can move in all four directions! As before, we start by loading the input data into a 2D array: and initialize another matrix of the same …
The problem description is here, and click here to see all my other Euler solutions in F#. This is a more difficult version of problem 81, but still, as you can’t move left so we can still optimize one column at a time. First, let’s read the input file into a 2D array: and …
Since joining JUST EAT I have been much more active in attending meetups because our office is walking distance to the Code Node. In particular, I have been a regular at Phil Trelford’s F#unctional Londoners group which meets twice a month. In the last month alone, we’ve been spoiled with Phil’s Random Arts hands-on session and Mathias’s experience …
NOTE : read the rest of the series, or check out the source code. If you enjoy reading these exercises then please buy Crista’s book to support her work. Following on from the last post, we will look at the Bulletin Board style today. Style 15 – Bulletin Board Constraints Larger problem is decomposed into entities …
NOTE : read the rest of the series, or check out the source code. If you enjoy reading these exercises then please buy Crista’s book to support her work. Following on from the last post, we will look at the Hollywood style today. Style 14 – Hollywood Constraints Larger problem is decomposed into entities using some …
DISCLAIMER : as always, you should benchmark against your payload and use case, the benchmark numbers I have produced here is unlikely to be representative of your use cases and neither is anybody else’s benchmark numbers. You can use the simple test harness I created and see these example code to benchmark against your particular …
The problem description is here, and click here to see all my other Euler solutions in F#. After reading the question, a quick search on how to test if a point is in a triangle turned up this useful SO answer. Translating the algorithm to F# is pretty trivial: I saved the triangle.txt file …
DISCLAIMER : as always, you should benchmark against your payload and use case, the benchmark numbers I have produced here is unlikely to be representative of your use cases and neither is anybody else’s benchmark numbers. You can use the simple test harness I created and see these example code to benchmark against your particular …
The problem description is here, and click here to see all my other Euler solutions in F#. I based my solution on Euclid’s formula for generating Pythagorean triples. And given that max L is 1,500,000, the maximum value for m we need to consider is $latex \sqrt{\frac{L}{2}} $. Because $latex L = a + b + …
By continuing to use the site, you agree to the use of cookies. more information
The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.