aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

June 2018 Update

Browse source
This commit is contained in:
Ingy döt Net 2018-06-22 20:57:24 +00:00
parent ba8067c3b7
commit 22f33d4004
5278 changed files with 84726 additions and 14379 deletions
Download patch file Download diff file Expand all files Collapse all files

16
Task/Maximum-triangle-path-sum/Astro/maximum-triangle-path-sum.astro
View file

@ -1,9 +1,10 @@
fun solve(!tri):
while tri.size > 1:
fun solve(tri):
var tri = tri
while tri.len > 1:
let t0 = tri.pop()
for (i, t) in enumerate(tri[!0]):
tri[!0, i] = max(t0[i], t0[i+1]) + t
tri[0, 0]
for i, t in enumerate(tri[!1]):
tri[!1, i] = max(t0[i], t0[i]) + t
tri[1, 1]
let data = """
55
@ -23,6 +24,7 @@ let data = """
44 25 67 84 71 67 11 61 40 57 58 89 40 56 36
85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52
06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15
27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93"""
27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93
"""
print solve data.lines.map |x| -> x.trim().split().map(int)
print solve data.lines.map|x| => x.split().map(int)