IMO
Dużo programów odpadnie na teście dokładnościowym.
Potem będzie loteria.
A na koniec wygra najladniejszy kod.
<?php for( $i = 0; $i < $n; ++$i ){ }
<?php $i = $n; while( $i-- ){ }
$xdebug_time_index = xdebug_time_index(); $xdebug_memory_usage = xdebug_memory_usage(); $xdebug_peak_memory_usage = xdebug_peak_memory_usage(); mysql_query('INSERT INTO xdebug (script, xdebug_memory_usage, xdebug_peak_memory_usage, xdebug_time_index) VALUES ("'.$_SERVER['REQUEST_URI'].'", '.$xdebug_memory_usage.', '.$xdebug_peak_memory_usage.', '.$xdebug_time_index.')');
<?php while( $n-- ){ }
<?php while( $n-- ){ $len = 0; }
<?php function a() { $invcode='9876543210ZYXWVUTSRQPONMLKJIHGFEDCBA9876543210ZYXWVUTSRQPONMLKJIHGFEDCBA'; $p=-1; $last=$prelast='0'; do { $of=$move%36; $idx=ord($argv[1][++$p]); ($idx<65)?$v=$invcode[57-$idx+$of]:$v=$invcode[100-$idx+$of]; $vv=ord($v)-48; if ($vv>-1&&$vv<10) { switch($last) { case'K': $k=$vv; break; case'W': $w=$vv; break; case'A': $a=$vv; break; case'Z': $z=$vv; break; case'1': if($prelast=='K')$k=10+$vv; elseif($prelast=='W')$w=10+$vv; break; case'2': if($prelast=='K')$k=20; elseif($prelast=='W')$w=20; break; } } $prelast=$last; $last=$v; $step=$move; $move+=$l; $l=$step; }while(--$i); $pt='0123456789'; $bar='------------------------------- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- -*****************************- '; $ii=(int)$w*$k; $bar[$k+33]='-'; $s=33; $t=($w<<5); $off=33; $off2=$t+1; $off3=$t+$k; $K=$k>>1; $s=$off2+32; do { $bar[++$s]='-'; ++$s; }while(--$K); $bar[$off3+32]='-'; $bar3=$bar2=$bar; $v=$a; $vec=1; $vec2=-32; do { $bar[$off]=$pt[$v]; $bar2[$off2]=$pt[$v]; $bar3[$off3--]=$pt[$v]; if ($bar[$off+$vec]!='*')switch($vec) { case'1':$vec=32; break; case'32':$vec=-1; break; case'-1':$vec=-32; break; case'-32':$vec=1; } $off+=$vec; $off2+=$vec2; if ($bar2[$off2]!='*') { $vec2=-$vec2; $off2+=$vec2+1; } if($bar3[$off3]!='*')$off3-=32-$k; ($v==$z)?$v=$a:++$v; }while(--$ii); $eff3=$eff2=$eff=''; $off=33; $W=$w; do { $K=$k; do { $eff.=$bar[$off]; $eff2.=$bar2[$off]; $eff3.=$bar3[$off++]; }while(--$K); $eff.=' '; $eff2.=' '; $eff3.=' '; $off+=32-$k; }while(--$W); ',$eff2,' ',$eff3,' '; } a();
$prog = 'moj.php'; $param = 'VTRNH7R1VZXZZ137DN3TZVXVVTTZ4CU1U40C2137DN3TZVXVVTRNH7R1VZXZZ137DN3TZV'; for ($i=0; $i<1000; $i++) { }
<?php /** * Polcode Code Contest PHP-2010.10 * Nick: pauluZ */ $t['A'] = 0; $t['B'] = 1; $t['C'] = 2; $t['D'] = 3; $t['E'] = 4; $t['F'] = 5; $t['G'] = 6; $t['H'] = 7; $t['I'] = 8; $t['J'] = 9; $t['K'] = 10; $t['L'] = 11; $t['M'] = 12; $t['N'] = 13; $t['O'] = 14; $t['P'] = 15; $t['Q'] = 16; $t['R'] = 17; $t['S'] = 18; $t['T'] = 19; $t['U'] = 20; $t['V'] = 21; $t['W'] = 22; $t['X'] = 23; $t['Y'] = 24; $t['Z'] = 25; $t['0'] = 26; $t['1'] = 27; $t['2'] = 28; $t['3'] = 29; $t['4'] = 30; $t['5'] = 31; $t['6'] = 32; $t['7'] = 33; $t['8'] = 34; $t['9'] = 35; $str = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'; $arg = $argv[1]; $out = ''; $fib[-2] = 0; $fib[-1] = $lenght; for ($i = 0; $i < $lenght; $i++) { $fib[$i] = $fib[$i-2] + $fib[$i-1]; $j = ($t[$arg{$i}] - $fib[$i]) % 36; $out .= $str[(($j<0)?($j+36):$j)]; } for ($i = 0; $i < 4; $i++) { } // ---------------------------------------------------- // pierwszy prostokat - 1 $p = $A; $sx = 1; $sy = 1; $kx = $K; $ky = $W; while (true) { for ($x=$sx; $x<=$kx; $x++) { $result[$x][$sy] = $p; ($p==$Z) ? $p = $A : $p++; } $sy++; if ($sy > $ky) break; for ($y=$sy; $y<=$ky; $y++) { $result[$kx][$y] = $p; ($p==$Z) ? $p = $A : $p++; } $kx--; if ($sx > $kx) break; for ($x=$kx; $x>=$sx; $x--) { $result[$x][$ky] = $p; ($p==$Z) ? $p = $A : $p++; } $ky--; if ($sy > $ky) break; for ($y=$ky; $y>=$sy; $y--) { $result[$sx][$y] = $p; ($p==$Z) ? $p = $A : $p++; } $sx++; if ($sx > $kx) break; } for ($y=1; $y<=$W; $y++) { for ($x=1; $x<=$K; $x++) { } } // ---------------------------------------------------- // drugi prostokat - 2 $p = $A; $x = 1; while ($x <= $K) { if ($x % 2 == 1) { for ($y=$W; $y>=1; $y--) { $result[$x][$y] = $p; ($p==$Z) ? $p = $A : $p++; } } else { for ($y=1; $y<=$W; $y++) { $result[$x][$y] = $p; ($p==$Z) ? $p = $A : $p++; } } $x++; } for ($y=1; $y<=$W; $y++) { for ($x=1; $x<=$K; $x++) { } } // ---------------------------------------------------- // trzeci prostokat - 3 $R = $K*$W; $remain = $R - ($groups * ($Z-$A+1)); $sek_s = ''; for ($i=$Z; $i>=$A; $i--) { $sek_s .= $i; } $sek = ''; for ($i=1; $i<=$groups; $i++) { $sek .= $sek_s; } for ($i=$A; $i<=$A+$remain-1; $i++) { $sek = $i . $sek; }