20 lines
792 B
PHP
20 lines
792 B
PHP
<?php
|
|
|
|
return
|
|
[
|
|
'number' => 18,
|
|
'title' => 'Maximum path sum I',
|
|
'description' => function(){ return file_get_contents(__DIR__ . '/Euler_Problem-018_description.md'); },
|
|
'code' => function(){ return file_get_contents(__DIR__ . '/Euler_Problem-018.b93'); },
|
|
'explanation' => function(){ return file_get_contents(__DIR__ . '/Euler_Problem-018_explanation.md'); },
|
|
'url_euler' => 'http://projecteuler.net/problem=018',
|
|
'url_raw' => 'https://raw.githubusercontent.com/Mikescher/Project-Euler_Befunge/master/processed/Euler_Problem-018.b93',
|
|
'url_github' => 'https://github.com/Mikescher/Project-Euler_Befunge',
|
|
'abbreviated' => false,
|
|
'steps' => 15048,
|
|
'time' => 16,
|
|
'width' => 120,
|
|
'height' => 16,
|
|
'value' => 1074,
|
|
];
|