[Haskell-cafe] Project Euler: request for comments
kc1956 at gmail.com
Sun Aug 28 02:26:30 CEST 2011
Think of the simplest version of the problem that isn't totally trivial.
e.g. A one dimensional list of numbers.
What would you do?
Note: you only want to touch each element once.
The 2 dimensional case could be handled by putting into lists: rows,
columns, major diagonals, and minor diagonals.
This isn't the fastest way of doing the problem but it has the
advantage of avoiding "indexitis".
On Fri, Aug 26, 2011 at 6:15 PM, Oscar Picasso <oscarpicasso at gmail.com> wrote:
> is bigger than
> If so I need to think about how to formalize it.
> Thanks for the hint.
> On Fri, Aug 26, 2011 at 8:55 PM, KC <kc1956 at gmail.com> wrote:
>> Is Problem 11 the 4 consecutive #'s problem?
>> If so what must be true for 4 #'s to have a large product?
>> Hint: x * y * z * 2 is that going to be larger?
More information about the Haskell-Cafe