Your skill will accomplish what the force of many cannot 

PerlMonks 
Comment on 
( #3333=superdoc: print w/ replies, xml )  Need Help?? 
I was simply translating my Perl5 oneliners on ProjectEuler into Perl6's code.
These are all on its first problem: This is my fastest solution in Perl5: (not in the code #1..4 above) perl5 e '$n=3;print 2,3x$n,1 .6x$n+2' The following is the origin of code #1, which works beyond the limit of 64 bit int, since it uses string op: $n=3;print 2,(3x$n.1 .6x$n.8)=~s/^18/3/r This is the origin of code #2: $n=3;$_=2 .3x$n.1 .6x$n;substr($_,1)+=2;print So code #3 is a more general solution for $N which is typically not an integer exponentiation of 10: map{$s+=int$_*($i=abs int 999/$_)*++$i/2}(3,5,15);print$s They all give the same result: 233168 for $n=3, but work for other $n as well. In reply to Re^2: How to change these small oneliners into Perl6 code?
by ABCXYZ

