Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!news2.arglkargh.de!news.swapon.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail
From: Nobody <nobody@nowhere.invalid>
Newsgroups: comp.lang.python
Subject: Re: Neat little programming puzzle
Date: Tue, 16 Dec 2014 08:24:21 +0000
Organization: A noiseless patient Spider
Lines: 12
Message-ID: <pan.2014.12.16.08.24.20.455000@nowhere.invalid>
References: <mailman.16996.1418709166.18130.python-list@python.org>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Info: mx02.eternal-september.org; posting-host="152d4dee6f95183c956ee6fa63d7e69f"; logging-data="12120"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+ZEDSoBPGwDYDshWluK1dE"
User-Agent: Pan/0.14.2 (This is not a psychotic episode. It's a cleansing moment of clarity.)
Cancel-Lock: sha1:aDD4tQbFXlc0gTMw6vJNvoSZsmA=
Xref: csiph.com comp.lang.python:82579

On Tue, 16 Dec 2014 00:46:16 -0500, Jason Swails wrote:

> I liked this problem because naive solutions scale as O(2^N), begging for
> a more efficient approach.

Project Euler has this one, twice; problems 18 and 67.

The difference between the two is that problem 18 has 15 rows while
problem 67 has 100 rows. Problem 18 can realistically be solved by a
brute-force approach, problem 67 can't.