The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:

          7
        3   8
      8   1   0
    2   7   4   4
  4   5   2   6   5

Then the other cows traverse the triangle starting from its tip and moving "down" to one of the two diagonally adjacent cows until the "bottom" row is reached. The cow's score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame.

Given a triangle with N (1 <= N <= 100) rows, determine the highest possible sum achievable.

* Original problem has the limit of N by N <= 350.

#1685 upload 31 done 15 how_to_reg 13

숫자삼각형 timer 1s memory 64MB

#1685

숫자삼각형 1s 64MB