UVA 11346 Possibility

#include<bits/stdc++.h>
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<math.h>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<algorithm>
#include<stack>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
#endif // ONLIN
    int t;
    scanf("%d",&t);
    double a,b;double s;
    while(t--)
    {
        cin>>a>>b>>s;
        if(s>=a*b){cout<<"0.000000%"<<endl;continue;}
        else if(fabs(s)<0.00000000001){cout<<"100.000000%"<<endl;continue;}
        double m=a*b;
        double ans=(m-s-s*log(m/s))/m;
        ans*=100;
        printf("%.6f%\n",ans);
    }
}