<?xml version="1.0" encoding="windows-1252"?>
<node id="534891" title="Hexadecimal representation of pi" created="2006-03-07 07:07:06" updated="2006-03-07 02:07:06">
<type id="1588">
obfuscated</type>
<author id="512799">
weixi</author>
<data>
<field name="doctext">
This is actually the outcome of a game of perl golf. The task was to print a hexadecimal representation of pi, where the digits are not calculated en bloc but one after the other. The longer the program runs the more digits it produces.
&lt;p&gt;
However, the algorithm itself is rather obfuscated already and reducing the number of characters for the perl golf resulted in another level of obfuscation. So I thought the obfuscation section would be the right place for it to post anyway.

&lt;code&gt;

        $|=print 3.2;sub O{8*($@-$_)+(1,4,5,6)[$:]};sub 
       o{(-4,2,1,1)[$:]/O};while($,=++$@){for$:(0..3){
      for         (0..$@)             {for$"
                  (($/=1)             ..$_){
                 ($/*=16)             %=O};
                 $,-=$/                *o}$,
                 -=16**                 $_*o
               for-6..-                   1}printf
             "%x",$,*                   16%16}
&lt;/code&gt;
</field>
</data>
</node>
