in reply to Completely different algorithm
in thread Is Perl less compact than Ruby? (Kind of competition)
sub p{$_=pop@n} sub w{push@n,@_} $/=$T;$_=uc<>; s#.#+{qw( H 0p;w$n[-1-abs];$_>0&&splice@n,-2-$_,1 T 1$t=p;p&&goto"L$t" A 2w$L+1 O 3print+chr+p I 4w+($_=getc)?ord:-1 N 5w$N++ S 6w-(p)+p E 7$0=p;p;w+int$_/$0,$_%$0 )}->{$&}=~/./&&"\$N?$&>6?\$N=0:w $&+7*p:do{$'};\n"#eg; s/^/L${\++$i}:\$L=$i;/mg; eval; L0:
_____________________________________________________
Jeff[japhy]Pinyan:
Perl,
regex,
and perl
hacker, who'd like a (from-home) job
s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
*** japhy's qw is GODLIKE ***
by locked_user mtve (Deacon) on Feb 20, 2002 at 21:13 UTC | |
by japhy (Canon) on Feb 20, 2002 at 21:40 UTC | |
by Matts (Deacon) on Feb 21, 2002 at 08:08 UTC | |
by japhy (Canon) on Feb 21, 2002 at 08:57 UTC | |
by japhy (Canon) on Feb 20, 2002 at 21:19 UTC | |
by locked_user mtve (Deacon) on Feb 20, 2002 at 21:27 UTC | |
by japhy (Canon) on Feb 20, 2002 at 21:46 UTC | |
by locked_user mtve (Deacon) on Feb 21, 2002 at 07:22 UTC |