On Thu, Oct 10, 2002 at 02:54:19PM -0400, John Tobey wrote:
> On Thu, Oct 10, 2002 at 02:21:49PM -0400, Kenneth Graves wrote:
> > I've tried unrolling the recursion:
> >
> > perl -le'@b=(1);for$n(2..9){@b=map{($_.$n,"$_+$n","$_*$n")}@b}eval==2002&&print
>for@b'
> >
> > Which gets the code string below 80 characters.
>
> 2002-eval||print
>
> $ alias p=perl
> $ p -le'@b=1;for$n(2..9){@b=map{$_.$n,"$_+$n","$_*$n"}@b}2002-eval||print for@b'
> 1*23+45*6*7+89
> 1*2+34*56+7+89
Somebody get me a life, PLEASEEEE!
$ perl -le'$_=1;for$n(2..9){s/\S+/$&$n $&+$n $&*$n/g}2002-eval||print for split'
1*23+45*6*7+89
1*2+34*56+7+89
> --
> John Tobey <[EMAIL PROTECTED]>
> \____^-^
> _______________________________________________
> Boston-pm mailing list
> [EMAIL PROTECTED]
> http://mail.pm.org/mailman/listinfo/boston-pm
--
John Tobey <[EMAIL PROTECTED]>
\____^-^
_______________________________________________
Boston-pm mailing list
[EMAIL PROTECTED]
http://mail.pm.org/mailman/listinfo/boston-pm
