UVA 10417 Gift Exchanging

#include <iostream>
#include <cstring>
#include <stdio.h>
#include <math.h>
#define N 12
using namespace std;

int n;
int expect[]; //5种礼物的实际数量
double p[N][];
double first[];

void Input()
{
    int i,j;
    scanf("%d", &n);
    for(j=;j<=;j++)
    {
        scanf("%d", &expect[j]);
    }
    for(i=;i<n;i++)
    {
        for(j=;j<=;j++)
        {
            scanf("%lf", &p[i][j]);
        }
    }
    memset(first,,sizeof(first));
}

double dfs(int g, double c)
{
    if(g==n)
    return c;
    double t;
    double ans=;
    for(int i=;i<=;i++)
    {
        if(expect[i]&&fabs(p[g][i])>1e-)
        {
            expect[i]--;
            t = dfs(g+, c*p[g][i]);
            if(g==)
                first[i]+=t;
            expect[i]++;
            ans+=t;
        }
    }
    return ans;
}

void Do(double s)
{
    int x;
    double v=;
    for(int i=;i<=;i++)
    {
        if(first[i]/expect[i]-v > 1e-)
        {
            x=i;
            v=first[i]/expect[i];
        }
    }
    printf("%d %.3lf\n",x,v/s);
}

int main()
{
    int t;
    double s;
    scanf("%d", &t);
    while(t--)
    {
        Input();
        s=dfs(, );
        Do(s);
    }
    return ;
}