#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair; using vb=vector;using vs=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; templateostream&operator<<(ostream&o,const pair&p){o<<'('<>> Q(200); rep(i, M_) { int a_, b_; double t; scanf("%d%d%lf", &a_, &b_, &t); Q[a_ * 16 + b_].emplace_back(t, i); } rep(a, 11) rep(b, 11) { int k_ = a * 16 + b; if (sz(Q[k_]) == 0) continue; vector> &vq = Q[k_]; if (a == 0 || b == 0) { forr(ti, vq) { double t = ti.fst; int idx = ti.snd; if (a == 0) ans[idx] = pow(M_E, pow(t, 1.0/b)); else ans[idx] = pow(t, 1.0/a); } continue; } int n = sz(vq); sort(all(vq), greater>()); //cout << "vq:"; rep(ii,sz(vq)) cout << ' ' << vq[ii]; cout << endl; double x = vq[0].fst + 10; const double EPS = 1e-10; rep(i, n) { double t = vq[i].fst; int idx = vq[i].snd; if (i && t == vq[i-1].fst) { ans[idx] = ans[vq[i-1].snd]; continue; } rep(it, 500) { double lgx = log(x); double fx = POW(x, a) * POW(lgx, b) - t; double gx = POW(x, a-1) * POW(lgx, b-1) * (a * lgx + b); double d = fx / gx; x -= d; if (abs(d) < EPS) { //_p("%d: %d\n", i, it); break; } //if (it == 499) puts("!"); } ans[idx] = x; } } rep(i, M_) { _p("%.12f\n", ans[i]); } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); Main(); return 0; }