Initial data commit

Task/Maximum-triangle-path-sum/Chipmunk-Basic/maximum-triangle-path-sum.basic

@@ -0,0 +1,41 @@
+100 DIM LN$(19)
+110 LN$(1) = "55"
+120 LN$(2) = "94 48"
+130 LN$(3) = "95 30 96"
+140 LN$(4) = "77 71 26 67"
+150 LN$(5) = "97 13 76 38 45"
+160 LN$(6) = "07 36 79 16 37 68"
+170 LN$(7) = "48 07 09 18 70 26 06"
+180 LN$(8) = "18 72 79 46 59 79 29 90"
+190 LN$(9) = "20 76 87 11 32 07 07 49 18"
+200 LN$(10) = "27 83 58 35 71 11 25 57 29 85"
+210 LN$(11) = "14 64 36 96 27 11 58 56 92 18 55"
+220 LN$(12) = "02 90 03 60 48 49 41 46 33 36 47 23"
+230 LN$(13) = "92 50 48 02 36 59 42 79 72 20 82 77 42"
+240 LN$(14) = "56 78 38 80 39 75 02 71 66 66 01 03 55 72"
+250 LN$(15) = "44 25 67 84 71 67 11 61 40 57 58 89 40 56 36"
+260 LN$(16) = "85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52"
+270 LN$(17) = "06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15"
+280 LN$(18) = "27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93"
+290 LN$(19) = "end"
+300 DIM MATRIX(20,20)
+310 X = 1
+320 TAM = 0
+330 FOR N = 1 TO 19
+340   LN2$ = LN$(N)
+350   FOR Y = 1 TO X
+360     MATRIX(X,Y) = VAL(LEFT$(LN2$,2))
+370     IF LEN(LN2$) > 4 THEN LN2$ = MID$(LN2$,4,LEN(LN2$)-4)
+380   NEXT Y
+390   X = X+1
+400   TAM = TAM+1
+410 NEXT N
+420 FOR Z = TAM-1 TO 1 STEP -1
+430   FOR Y = 1 TO Z
+440     S1 = MATRIX(Z+1,Y)
+450     S2 = MATRIX(Z+1,Y+1)
+460     IF S1 > S2 THEN MATRIX(Z,Y) = MATRIX(Z,Y)+S1
+470     IF S1 <= S2 THEN MATRIX(Z,Y) = MATRIX(Z,Y)+S2
+480   NEXT Y
+490 NEXT Z
+500 PRINT "  maximum triangle path sum = ";MATRIX(1,1)