|
|
|
| Syntactic Confectionery Delight | |
| PerlMonks |
RE: There can be only one!by Anonymous Monk |
| on May 15, 2000 at 21:18 UTC ( [id://11680]=note: print w/replies, xml ) | Need Help?? |
|
HAHA! you had to "one" up two cents eh? well, time for someone to get zero. Let's get cracking! maybe we can get every number from 0 to 100!
In Section
Obfuscated Code
|
|
||||||||||||||||||||||