Problem :

Description:

text(file_get_contents($problem['file_description'])); ?>

Solution: file_get_contents($problem['file_code']), 'url' => $problem['url_raw'], 'interactive' => !$problem['abbreviated'], 'speed' => $problem['steps'] < 500000 ? 2 : 3, 'editable' => false, ]; echo require (__DIR__ . '/../fragments/befunge93_runner.php'); if ($problem['abbreviated']) echo 'This program is too big to display/execute here, click [download] to get the full program.
'; ?>
Explanation:

text(file_get_contents($problem['file_explanation'])); ?>

Interpreter steps:
Execution time (BefunExec):	(' . (($problem['time']===0) ? '?' : number_format(($problem['steps']/$problem['time'])/1000, 2, '.', '')) . ' MHz)'; ?>
Program size:	(fully conform befunge-93)'; ?>
Solution:
Solved at:

\n"; for($i2=0;$i2<2;$i2++) { echo "

\n"; for($i3=0;$i3<2;$i3++) { echo "

\n"; for($i4=0;$i4<5;$i4++) { $ii = $i1*20 + $i2*10 + $i3*5 + $i4 + 1; if ($ii > $max) {$break = true; break;} $pii = str_pad($ii, 3, '0', STR_PAD_LEFT); if ($ii == $problem['number']) echo "

" . $pii . "

\n"; else if (key_exists($ii, $arr)) echo "" . $pii . "\n"; else echo "

" . $pii . "

\n"; } echo "

\n"; if ($break) break; } echo "

\n"; if ($break) break; } ?>