Hi
( 02.10.10 17:09 -0400 ) Chris Devers:
Is it cheating to brute force the puzzle with a computer? :)
That's a well known problem solving strategy. Ask RSA ...
--
.--- ...
___
Boston-pm mailing list
[EMAIL PROTECTED]
Hi
( 02.10.10 17:16 -0400 ) [EMAIL PROTECTED]:
Someone needs to write a code analysis
tool to measure the complexity and
general unreadability of a piece of
perl code.
Of course, these are 2 independent metrics.
Then, when these kinds of puzzles come up,
people can compete to have the
KG == Kenneth Graves [EMAIL PROTECTED] writes:
KG1 2 3 4 5 6 7 8 9=2002
KGThe problem is to add any number of addition multiplication
KGoperations wherever you'd like on the left such that in the end
KGyou have a valid equation. So for example if it gets
On Thu, 10 Oct 2002, Uri Guttman wrote:
JT == John Tobey [EMAIL PROTECTED] writes:
JT Somebody get me a life, PLEAS!
sure, but you couldn't afford the price. :)
JT $ perl -le'$_=1;for$n(2..9){s/\S+/$$n $+$n $*$n/g}2002-eval||print for
split'
JT 1*23+45*6*7+89
JT
On Tue, 8 Oct 2002, Ron Newman wrote:
On Tuesday, October 8, 2002, at 11:18 PM, Chris Devers wrote
1 2 3 4 5 6 7 8 9=2002
The problem is to add any number of addition multiplication
operations wherever you'd like on the left such that in the
end you have a valid
On Tuesday, October 8, 2002, at 11:18 PM, Chris Devers wrote
On a different note, last weekend on NPR there was a puzzle that it
seems
to me could be solved pretty neatly by a Perl script, and I'm curious
what solutions people would try for it. Consider the following string:
1 2 3 4
