#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); int m; double a[1000010], b[1000010], t[1000010]; int idx; double f(double x) { double res = 1.0, lg = log(x); for (int i = 0; i < a[idx]; i++) res *= x; for (int i = 0; i < b[idx]; i++) res *= lg; return res - t[idx]; } double df(double x) { double res = 1.0, lg = log(x); for (int i = 0; i < a[idx]-1; i++) res *= x; for (int i = 0; i < b[idx]-1; i++) res *= lg; return res * (a[idx] * lg + b[idx]); } double newton(double x) { for (int i = 0; i < 200; i++) { x = x - f(x) / df(x); } return x; } void solve() { for (int i = 0; i < m; i++) { if (b[i] == 0) { cout << pow(t[i], 1.0/a[i]) << endl; } else if (a[i] == 0) { cout << exp(pow(t[i], 1.0/b[i])) << endl; } else { idx = i; cout << newton(pow(t[i], 1.0/a[i])) << endl; } } } void input() { cin >> m; for (int i = 0; i < m; i++) cin >> a[i] >> b[i] >> t[i]; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(12); input(); solve(); }