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. -- https://mail.python.org/mailman/listinfo/python-list