Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.python > #82579

Re: Neat little programming puzzle

From Nobody <nobody@nowhere.invalid>
Newsgroups comp.lang.python
Subject Re: Neat little programming puzzle
Date 2014-12-16 08:24 +0000
Organization A noiseless patient Spider
Message-ID <pan.2014.12.16.08.24.20.455000@nowhere.invalid> (permalink)
References <mailman.16996.1418709166.18130.python-list@python.org>

Show all headers | View raw

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.

Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Neat little programming puzzle Jason Swails <jason.swails@gmail.com> - 2014-12-16 00:46 -0500
  Re: Neat little programming puzzle Nobody <nobody@nowhere.invalid> - 2014-12-16 08:24 +0000
  Re: Neat little programming puzzle neng.zhou@gmail.com - 2014-12-16 09:36 -0800
  Re: Neat little programming puzzle sohcahtoa82@gmail.com - 2014-12-16 10:04 -0800

csiph-web