文件名称:The-Triangle
介绍说明－－下载内容均来自于网络，请自行研究使用
The Triangle
时间限制：1000 ms | 内存限制：65535 KB
难度：4
描述
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
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.
输入
Your program is to read from standard input. 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.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
样例输出
30-The Triangle
Time Limit: 1000 ms | Memory Limit: 65535 KB
Difficulty: 4
Descr iption
7
38
810
2744
45265
(Figure 1)
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.
Enter
Your program is to read from standard input 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.
Export
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
5
7
38
810
2744
45265
Sample Output
30
时间限制：1000 ms | 内存限制：65535 KB
难度：4
描述
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
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.
输入
Your program is to read from standard input. 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.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
样例输出
30-The Triangle
Time Limit: 1000 ms | Memory Limit: 65535 KB
Difficulty: 4
Descr iption
7
38
810
2744
45265
(Figure 1)
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.
Enter
Your program is to read from standard input 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.
Export
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
5
7
38
810
2744
45265
Sample Output
30
(系统自动生成,下载前可以参看下载内容)
下载文件列表
The Triangle.txt
test.txt
ProgramA.cpp