https://acm.ecnu.edu.cn/contest/126/problem/E/

题解：

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp;
int a[N];
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //scanf("%d",&n);
    scanf("%d",&t);
    while(t--){
        double sum=0;
        double ans=0;
        for(int i=1;i<=6;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        for(int i=1;i<=6;i++){
            ans=max(ans,a[i]/sum*i);
        }
        printf("%.13lf\n",ans);
    }


    //cout << "Hello world!" << endl;
    return 0;
}