#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#include //#include //#include //#include //#include //#include //#include //#include //#if __cplusplus >= 201103L //#include //#include //#include //#include // //#define cauto const auto& //#else //#endif using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; typedef vector vint; typedef vector > vvint; typedef vector vll, vLL; typedef vector > vvll, vvLL; #define VV(T) vector > template void initvv(vector > &v, int a, int b, const T &t = T()){ v.assign(a, vector(b, t)); } template void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define reep(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) reep((i),0,(n)) #define ALL(v) (v).begin(),(v).end() #define PB push_back #define F first #define S second #define mkp make_pair #define RALL(v) (v).rbegin(),(v).rend() #define DEBUG #ifdef DEBUG #define dump(x) cout << #x << " = " << (x) << endl; #define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; #else #define dump(x) #define debug(x) #endif #define MOD 1000000007LL #define EPS 1e-10 #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL #define maxs(x,y) x=max(x,y) #define mins(x,y) x=min(x,y) #define double long double double powmod(double x,int y){ double a=1; while(y){ if(y&1) a=a*x; x=x*x; y>>=1; } return a; } inline double f(int a, int b, double x){ return powmod(x, a) * powmod(logl(x), b); } double pre[11][11][100010]; int a,b; double t; double solve(int a, int b, double x){ double l = 0; double r = 1024; rep(i,100){ double mid = (l+r)/2; double val = f(a, b, mid); if(x=0;k--){ // if(pre[i][j][k]==0){ // pre[i][j][k]=pre[i][j][k+1]; // } // } // } // } assert(m<100000); rep(_,m){ scanf("%d%d%Lf", &a, &b, &t); if(a==0){ double ans = pow(M_E, pow(t, 1./b)); printf("%.12Lf\n", ans); continue; } else if(b==0){ double ans = pow(t, 1./a); printf("%.12Lf\n", ans); continue; } int tt = t * 10000; // double l = pre[a][b][tt]-5; // double r = pre[a][b][tt]+5; double l = 1; double r = 1024; rep(i,1000){ double mid = (l+r)/2; double val = f(a, b, mid); // cout << mid << " " << val << endl; if(t <= val) r = mid; else l = mid; } printf("%.10Lf\n", r); } } signed main() { mainmain(); }