20 lines
776 B
PHP
20 lines
776 B
PHP
|
<?php
|
||
|
|
|
||
|
|
return
|
||
|
|
[
|
||
|
|
'number' => 67,
|
||
|
|
'title' => 'Maximum path sum II',
|
||
|
|
'description' => function(){ return file_get_contents(__DIR__ . '/euler_067_description.md'); },
|
||
|
|
'code' => function(){ return file_get_contents(__DIR__ . '/euler_067_code.txt'); },
|
||
|
|
'explanation' => function(){ return file_get_contents(__DIR__ . '/euler_067_explanation.md'); },
|
||
|
|
'url_euler' => 'http://projecteuler.net/problem=067',
|
||
|
|
'url_raw' => 'https://raw.githubusercontent.com/Mikescher/Project-Euler_Befunge/master/processed/Euler_Problem-067.b93',
|
||
|
|
'url_github' => 'https://github.com/Mikescher/Project-Euler_Befunge',
|
||
|
|
'abbreviated' => true,
|
||
|
|
'steps' => 650537,
|
||
|
|
'time' => 266,
|
||
|
|
'width' => 299,
|
||
|
|
'height' => 101,
|
||
|
|
'value' => 7273,
|
||
|
|
];
|