POJ 3071 Football

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-6;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c = getchar();
    x = 0;
    while(!isdigit(c)) c = getchar();
    while(isdigit(c))
    {
        x = x * 10 + c - ‘0‘;
        c = getchar();
    }
}

int n;
double p[200][200],dp[10][200];
int POW[10];

int main()
{
    POW[0]=1; for(int i=1;i<=8;i++) POW[i]=2*POW[i-1];
    while(~scanf("%d",&n))
    {
        if(n==-1) break;

        for(int i=0;i<(1<<n);i++)
            for(int j=0;j<(1<<n);j++)
                scanf("%lf",&p[i][j]);

        for(int i=0;i<(1<<n);i++) dp[0][i]=1;
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<(1<<n);j++)
            {
                double sum=0;
                for(int k=0;k<(1<<n);k++)
                {
                    int a=j,b=k;
                    if(a/POW[i-1]!=b/POW[i-1]&&a/POW[i]==b/POW[i])
                        sum=sum+dp[i-1][j]*dp[i-1][k]*p[j][k];
                }
                dp[i][j]=sum;
            }
        }

        double ans=dp[n][0]; int pos=1;
        for(int i=1;i<(1<<n);i++) if(ans<dp[n][i]) ans=dp[n][i], pos=i+1;
        printf("%d\n",pos);
    }
    return 0;
}