#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i,n) for(int (i)=0; (i)<(n) ;++(i)) #define REPN(i,a,n) FOR((i),(a),(a)+(n)) #define FOR(i,a,b) for(int (i)=(a); (i)<(b) ;++(i)) #define PB push_back #define MP make_pair #define SE second #define FI first #define DBG(a) cerr<<(a)< PLL; typedef vector VLL; typedef pairPI; typedef vector VI; const LL LINF=334ll<<53; const int INF=15<<26; const LL MOD=1E9+7; double eps=1e-13; double solve(int a, int b, double t){ double l=0.1,u=22222.0; while(u-l>5e-10 or (u-l)/l>5e-10){ double m=(l+u)/2.0; if(pow(m,(double)a)*pow(log(m),(double)b)> m; double t,l,u,mid; REP(i,m){ cin >> a >> b >> t; pt=floor((t+0.00005)*100); l=pre[a][b][pt],u=pre[a][b][pt+1]; if(a==0 and b==2){ cout << exp(t)<5e-10 or (u-l)/l>5e-10){ mid=(l+u)/2.0; if(pow(mid,(double)a)*pow(log(mid),(double)b)