Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

statics data

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-08 17:39:50 +01:00
parent 11a38315cd
commit faee825af9
532 changed files with 8189 additions and 99 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
www/statics/euler/euler_081_explanation.md Normal file
View File

@@ -0,0 +1,9 @@
Well, this is practically extremely simple path finding.
We generate an array where we remember the shortest distance from [0,0] to this node.
Initially we can set `distance[0, 0] = data[0,0]`
The we got through our data row by row and column by column.
The distance of every node we visit is the minimum of `top-node-distance + own value` and `left-node-distance + own value`.
Then after we iterated through every single node the result is written in the bottom right corner.