第八届蓝桥杯省赛 承压计算

标题：承压计算X星球的高科技实验室中整齐地堆放着某批珍贵金属原料。每块金属原料的外形、尺寸完全一致，但重量不同。金属材料被严格地堆放成金字塔形。                             7                            5 8                           7 8 8                          9 2 7 2                         8 1 4 9 1                        8 1 8 8 4 1                       7 9 6 1 4 5 4                      5 6 5 5 6 9 5 6                     5 5 4 7 9 3 5 5 1                    7 5 7 9 7 4 7 3 3 1                   4 6 4 5 5 8 8 3 2 4 3                  1 1 3 3 1 6 6 5 5 4 4 2                 9 9 9 2 1 9 1 9 2 9 5 7 9                4 3 3 7 7 9 3 6 1 3 8 8 3 7               3 6 8 1 5 3 9 5 8 3 8 1 8 3 3              8 3 2 3 3 5 5 8 5 4 2 8 6 7 6 9             8 1 8 1 8 4 6 2 2 1 7 9 4 2 3 3 4            2 8 4 2 2 9 9 2 8 3 4 9 6 3 9 4 6 9           7 9 7 4 9 7 6 6 2 8 9 4 1 8 1 7 2 1 6          9 2 8 6 4 2 7 9 5 4 1 2 5 1 7 3 9 8 3 3         5 2 1 6 7 9 3 2 8 9 5 5 6 6 6 2 1 8 7 9 9        6 7 1 8 8 7 5 3 6 5 4 7 3 4 6 7 8 1 3 2 7 4       2 2 6 3 5 3 4 9 2 4 5 7 6 6 3 2 7 2 4 8 5 5 4      7 4 4 5 8 3 3 8 1 8 6 3 2 1 6 2 6 4 6 3 8 2 9 6     1 2 4 1 3 3 5 3 4 9 6 3 8 6 5 9 1 5 3 2 6 8 8 5 3    2 2 7 9 3 3 2 8 6 9 8 4 4 9 5 8 2 6 3 4 8 4 9 3 8 8   7 7 7 9 7 5 2 7 9 2 5 1 9 2 6 5 3 9 3 5 7 3 5 4 2 8 9  7 7 6 6 8 7 5 5 8 2 4 7 7 4 7 2 6 9 2 1 8 2 9 8 5 7 3 6 5 9 4 5 5 7 5 5 6 3 5 3 9 5 8 9 5 4 1 2 6 1 4 3 5 3 2 4 1X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X其中的数字代表金属块的重量（计量单位较大）。最下一层的X代表30台极高精度的电子秤。假设每块原料的重量都十分精确地平均落在下方的两个金属块上，最后，所有的金属块的重量都严格精确地平分落在最底层的电子秤上。电子秤的计量单位很小，所以显示的数字很大。工作人员发现，其中读数最小的电子秤的示数为：2086458231请你推算出：读数最大的电子秤的示数为多少？注意：需要提交的是一个整数，不要填写任何多余的内容。

思路 

转成2维数组，每一个元素值通过上一行的两个元素进行计算，最后求出最大值和最小值，还需要一个转换过程

#include<iostream>#include<algorithm>#include<string.h>#include<cstdio>#include<cmath>using namespace std;int main(){double MAX = -999999,MIN=999999; double a[30][40]={{7,0},{5,8,0},{7,8,8,0},{9,2,7,2,0},{8,1,4,9,1,0},{8,1,8,8,4,1,0},{7,9,6,1,4,5,4,0},{5,6,5,5,6,9,5,6,0},{5,5,4,7,9,3,5,5,1,0},{7,5,7,9,7,4,7,3,3,1,0},{4,6,4,5,5,8,8,3,2,4,3,0},{1,1,3,3,1,6,6,5,5,4,4,2,0},{9,9,9,2,1,9,1,9,2,9,5,7,9,0},{4,3,3,7,7,9,3,6,1,3,8,8,3,7,0},{3,6,8,1,5,3,9,5,8,3,8,1,8,3,3,0},{8,3,2,3,3,5,5,8,5,4,2,8,6,7,6,9,0},{8,1,8,1,8,4,6,2,2,1,7,9,4,2,3,3,4,0},{2,8,4,2,2,9,9,2,8,3,4,9,6,3,9,4,6,9,0},{7,9,7,4,9,7,6,6,2,8,9,4,1,8,1,7,2,1,6,0},{9,2,8,6,4,2,7,9,5,4,1,2,5,1,7,3,9,8,3,3,0},{5,2,1,6,7,9,3,2,8,9,5,5,6,6,6,2,1,8,7,9,9,0},{6,7,1,8,8,7,5,3,6,5,4,7,3,4,6,7,8,1,3,2,7,4,0},{2,2,6,3,5,3,4,9,2,4,5,7,6,6,3,2,7,2,4,8,5,5,4,0},{7,4,4,5,8,3,3,8,1,8,6,3,2,1,6,2,6,4,6,3,8,2,9,6,0},{1,2,4,1,3,3,5,3,4,9,6,3,8,6,5,9,1,5,3,2,6,8,8,5,3,0},{2,2,7,9,3,3,2,8,6,9,8,4,4,9,5,8,2,6,3,4,8,4,9,3,8,8,0},{7,7,7,9,7,5,2,7,9,2,5,1,9,2,6,5,3,9,3,5,7,3,5,4,2,8,9,0},{7,7,6,6,8,7,5,5,8,2,4,7,7,4,7,2,6,9,2,1,8,2,9,8,5,7,3,6,0},{5,9,4,5,5,7,5,5,6,3,5,3,9,5,8,9,5,4,1,2,6,1,4,3,5,3,2,4,1,0},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}}; for (int i=1; i<30; i++){for (int j=0; j<=i; j++){double x=0,y=0;int q = j-1;x = a[i-1][j]/2.0;if (q >= 0){y = a[i-1][q]/2.0;}a[i][j] += x+y;}}for (int i=0; a[29][i]!=0; i++){if (a[29][i]>MAX){MAX = a[29][i];}if (a[29][i] < MIN){MIN = a[29][i];}//printf("%lf ",a[29][i]);}printf("%lf\n%lf\n",MAX,MIN);printf("%lf",2086458231/MIN*MAX);return 0;}