On 05 Dec 2001 09:51:33AM -0600, Michael Chaney ([EMAIL PROTECTED]) said: > getting your coffee. It shouldn't make us feel too good though, > especially considering that we may be able to find an O(n^3) dynamic > programming solution (as that's the usual method of solving optimal
Excellent, excellent work! I was playing around with the idea of using fewer nines and then building up from there with a sort of induction, but apparently my brain was too small to keep track of all the numbers. =) Beautiful solution! Sacha 8) _ Philippine Linux Users Group. Web site and archives at http://plug.linux.org.ph To leave: send "unsubscribe" in the body to [EMAIL PROTECTED] To subscribe to the Linux Newbies' List: send "subscribe" in the body to [EMAIL PROTECTED]
