UVA 11346 Probability （积分）

#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"YES\n";
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e3+100;
const int lz=0;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
double a,b,s;
int main(){/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    int t;scanf("%d",&t);
    while(t--){
        scanf("%lf%lf%lf",&a,&b,&s);
        if(s==0) {puts("100.000000%");continue;}
        if(s>=a*b) {puts("0.000000%");continue;}
        printf("%.6f",(1.0-s*(1+log(a*b/s))/(a*b))*100.0);
        puts("%");
    }
    return 0;
}