Problem B. gCube Google APAC 2016 University Test Round A

这一题的数据量直接暴力N^2枚举即可。a[L]*a[L+1]*...*a[R]=x^D。

等式左边直接相乘可能会溢出，所以求1/D次方，再相乘。a[L]^(1/D)*a[L+1]^(1/D)*...*a[R]^(1/D)=x。

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>

using namespace std;

//2016 Round A Problem B. gCube
int T;
const int maxn=1010;
const double eps=1e-9;
int a[maxn];
int L;
int R;
int N;
int M;
int main()
{
    freopen("B-large-practice.in","r",stdin);
//    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    scanf("%d",&T);
    for(int ca=1;ca<=T;ca++)
    {
        printf("Case #%d:\n",ca);
        memset(a,0,sizeof(a));
        scanf("%d %d",&N,&M);
        for(int i=0;i<N;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=0;i<M;i++)
        {
            scanf("%d %d",&L,&R);
            int D=R-L+1;
            double ans=1;
            for(int x=L;x<=R;x++)
            {
                ans*=pow(1.0*a[x],1.0/D);
                //cout<<ans<<endl;
            }
            printf("%.9f\n",ans);
        }

    }
    return 0;
}