uva 10417

機率問題

排出一個字串像是測資第一筆03

並且做permutation，然後從0~4選出一個最好的答案

記得要除BOX的NUMBER，因為有可能會拿到別人提供的BOX

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 55
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-9
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int g[6];
int str[1000];
int len;
bool used[1000];
int now[1000];
double p[20][6];
double ap[6];
int pnum;
void dfs(int n){
    if(n==len){
//        for(int i=0;i<len;i++){
//            printf("%d",now[i]);
//        }Pln();
        double tmp=1;
        for(int i=0;i<len;i++){
            tmp*=p[i][now[i]];
        }
        ap[now[0]]+=tmp;
        return;
    }
    int b=-1;
    for(int i=0;i<len;i++){
        if(b!=str[i]&&!used[i]){
            used[i]=1;
            b=str[i];
            now[n]=str[i];
            dfs(n+1);
            used[i]=0;
        }
    }
}
void solve(){
    Set(used,0);
    dfs(0);
    double all=0;
    for(int i=0;i<5;i++){
        all+=ap[i];
    }
    double maxans=0;
    int index;
    for(int i=0;i<5;i++){
        if(ap[i]/all/g[i]>maxans+eps){
            maxans=ap[i]/all/g[i];
            index=i;
        }
    }
    printf("%d %.3lf\n",index+1,maxans);
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        scanf("%d",&pnum);
        Set(str,0);
        Set(ap,0);
        len=0;
        for(int i=0;i<5;i++)scanf("%d",&g[i]);
        for(int i=0;i<5;i++){
            for(int j=0;j<g[i];j++){
                str[len++]=i;
            }
        }
        for(int i=0;i<pnum;i++){
            for(int j=0;j<5;j++){
                scanf("%lf",&p[i][j]);
            }
        }
        solve();
    }
















}