Okay, now 77 (if you don't miss the trailing newline):
$i=9;do{print"\n",map{(sort abs$_-$ARGV[0],abs$i-$ARGV[1])[-1]}1..9}wh
+ile--$i
Russ | [reply] [d/l] |
$i=9;do{print$/,map{(sort abs$_-$ARGV[0],abs$i-$ARGV[1])[1]}1..9}while
+--$i
| [reply] [d/l] |
A for-loop is usually shorter than a do{...}while-loop. 70 :-)
$t=abs$ARGV[1]+$_,print$/,map{(sort$t,abs$ARGV[0]-$_)[1]}1..9for-9..-1
If you want the newlines "right", I end up at 72:
$t=abs$ARGV[1]+$_,print map((sort$t,abs$ARGV[0]-$_)[1],1..9),$/for-9..-1
Update: Well, what do you know ... the string
$ARGV[1]+$_ is longer than the strings
($s=pop) and $s taken together.
Make those 69 and 71 (both with tie-breaker at 30 different
characters):
$t=abs,print$/,map+(sort$t,abs$ARGV[0]-$_)[1],1..9for($s=pop)-9..$s-1
... and ...
$t=abs,print map((sort$t,abs$ARGV[0]-$_)[1],1..9),$/for($s=pop)-9..$s-1
The Sidhekin
print "Just another Perl ${\(trickster and hacker)},"
| [reply] [d/l] [select] |