Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

$A++ under constraints

by BooK (Curate)
on Sep 18, 2000 at 02:26 UTC ( #32896=obfuscated: print w/ replies, xml ) Need Help??

Oh yes, the French $A++ obfuscation contest is still raging! Here is a try with a really restricted character set:

s]]aAaa]|s~a~A^e~e|s}aa}BC^ih}e|eval

This was as fun as writing french without using the letter 'e' (as did Georges Perec in La Disparition --translated as A Void by Gilbert Adair)...

Here I only used those ASCII characters whose 7th and 6th bits are respectively set to 0 and 1, and more precisely between ASCII 64 and 127. (but DEL is not precisely the kind of char you want to use for this...)

Comment on $A++ under constraints
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://32896]
Approved by root
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (3)
As of 2015-07-05 03:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (60 votes), past polls