Hello Geoff;
It looks like 2^79 possibilities, not that that shortens things.
As long as we're confessing our Project Euler frustrations, for #151. I
only seem to get the same number of A5 sheets for all possible ways of
cutting. Can some one show me two ways of cutting that result in
different numbers of A5's? My theory is that I'm misreading the
question somehow. Perhaps the examples will show me how I'm misreading.
TIA... >: ...
Geoff Canyon wrote:
On May 1, 2007, at 1:21 AM, Mike Day wrote:
Apologies to Chris - I suspect this should be Jchat....
And apologies to Geoff. I'd be interested to know which message
proved so inscrutable - perhaps he would let me know privately
or publicly (ie via the forum).
It was the maximal running sum. I'm just still having trouble figuring
out how a particular train will play out, and there's only so many
times I'm willing to bug the list with my ignorance ;-)
I'll get it eventually, I'm sure. My insistence on diving into
implicit tacit form probably isn't helping ;-)
On problem 152 I'm a bit stumped as well. Brute force seems out of the
question with 2^80 possibilities, so I'll have to wait until I'm clever.
Still waiting...
;-)
regards,
Geoff
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
