"be consistent" | |
PerlMonks |
Guess what it does ... and a challengeby liverpole (Monsignor) |
on May 24, 2008 at 17:42 UTC ( [id://688317]=obfuscated: print w/replies, xml ) | Need Help?? |
First, can you guess what the following code does before running it? ...
This node by shmem gave me the idea, and may give you a hint as well. Now for the challenge ... what's the shortest program which does the same thing? My guess is the obvious:
How about the smallest program that does the same thing slowly? The following takes about 11 seconds on my laptop: I have no idea if a shorter such program exists. s''(q.S:$/9=(T1';s;(..)(..);$..=substr+crypt($1,$2),2,3;eg;print$..$/
Back to
Obfuscated Code
|
|