蓝桥杯-填空题-遇到大数用python

填空题 2017 省赛 承压计算

暴力枚举
大数->python实现
题目描述
本题为填空题，只需要算出结果后，在代码中使用输出语句将所填结果输出即可。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 1 
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 

其中的数字代表金属块的重量（计量单位较大）。 最下一层的 XX 代表 3030 台极高精度的电子秤。假设每块原料的重量都十分精确地平均落在下方的两个金属块上， 最后，所有的金属块的重量都严格精确地平分落在最底层的电子秤上。电子秤的计量单位很小，所以显示的数字很大。
工作人员发现，其中读数最小的电子秤的示数为：20864582312086458231
请你推算出：读数最大的电子秤的示数为多少？

1.先用eclipse将所有数据打印输出成python的二维数组形式

import java.util.Scanner;

public class UnbderWeight {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int a[][]=new int[30][30];
		for(int i=0;i<=29;i++){
			for(int j=0;j<=i;j++){ //j<=i这样才能正确输入
				a[i][j]=s.nextInt();
			}
		}
		for(int i=0;i<=29;i++){
			System.out.print("[");
			for(int j =0;j<=i;j++){ 
				System.out.print(a[i][j]+",");
			}
			System.out.println("],");
		}
	}
}

输出结果

[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,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,],

• 要将一些多余的“，”删掉
• 在输入的时候，将最后一行的“X”换成“0”

2.用python实现计算

l=[
[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,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]
]
for i in range(1,len(l)):
    for j in range(i+1):
        if j==0:
            l[i][j]=l[i][j]+l[i-1][0]/2
        elif j==i:
            l[i][j]=l[i][j]+l[i-1][j-1]/2
        else:
            l[i][j]=l[i][j]+l[i-1][j-1]/2+l[i-1][j]/2
print(sorted(l[29]))

输出结果
[3.8863313030451536, 5.453857997432351, 15.15140070952475, 17.907931132242084, 26.523896012455225, 26.887504126876593, 34.10429563745856, 36.49885282292962, 46.664301661774516, 48.727437222376466, 58.87571814097464, 61.00548322312534, 66.29377637058496, 68.9082418307662, 72.64540585130453, 72.99317512661219, 79.91334679536521, 85.49253799952567, 86.35577190853655, 94.2685902453959, 97.74649390392005, 106.6395615004003, 108.22218933328986, 116.6373874284327, 118.50283470191061, 127.4323633145541, 128.92336338572204, 134.86469121277332, 135.12379046715796, 135.34946863353252]

3.单位换算，直接用python计算

print(2086458231/3.8863313030451536*135.34946863353252)

输出结果
72665192664.0