Description
正在上传…
取消
Figure 1 shows a number triangle. Write a program that calculates
the highest sum of numbers passed on a route that starts at the top and ends somewhere
on the base. Each step can go either diagonally down to the left or diagonally down
to the right.
Input
The input consists of several test cases.
For each testcase,The first line contains one integer N: the number of rows in the triangle.
The following N lines describe the data of the triangle.
The number of rows in the triangle is > 1 but <= 100.
The numbers in the triangle, all integers, are between 0 and 99.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Each testcase output one line.
Sample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
代码1
代码2
代码3