I adapted my code in Re^4: Brute force vs algorithm (PWC # 100) to maximize the Euler#67 problem and it took 4 ms on my laptop to generate best weight and path for the provided triangle with 100 rows.
I don't wanna spoil it, but does $cost have 4 digits out of (2 3 7) ? :)
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
In reply to Re^2: Brute force vs algorithm (PWC # 100)
by LanX
in thread Brute force vs algorithm (PWC # 100)
by 1nickt
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |