solution.cpp

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll maxn=1e6+50;
double a[1050][1050];

int main()
{
	for(ll i=1;i<=29;i++)
	{
		for(ll j=1;j<=i;j++)
		{
			scanf("%lf",&a[i][j]);
		}
	}
	for(ll i=1;i<=29;i++)
	{
		for(ll j=1;j<=i;j++)
		{
			a[i+1][j]+=(0.5*a[i][j]);
			a[i+1][j+1]+=(0.5*a[i][j]);
		}
	}
	double minn=1000000000,maxx=-1;
	for(ll i=1;i<=30;i++)
	{
		maxx=max(maxx,a[30][i]);
		minn=min(minn,a[30][i]);
		printf("%lf\n",a[30][i]);
	}
	printf("%lf\n",maxx*2086458231/minn);
}