#include #include #include #include #include #include #include using namespace std; using P = complex; long double det(long double a, long double b, long double c, long double d) { return a*d - b*c; } void solve() { int t; cin >> t; long double p, W, V, gx, gy; cin >> p >> W >> V >> gx >> gy; P g(gx, gy); P z(V + 1, W); // xi = real(z^{t-i})/2 u + imag(z^{t-i})/2 v // yi = -imag(z^{t-i})/2 u + real(z^{t-i})/2 v P zz = 1; long double A = 0; long double B = 0; long double C = 0; long double D = 0; for (int i = 0; i < t; i++) { A += real(zz) / 2 * real(zz); B += imag(zz) / 2 * real(zz); A += -imag(zz) / 2 * -imag(zz); B += real(zz) / 2 * -imag(zz); C += real(zz) / 2 * imag(zz); D += imag(zz) / 2 * imag(zz); C += -imag(zz) / 2 * real(zz); D += real(zz) / 2 * real(zz); zz *= z; } long double X = gx - real(zz); long double Y = gy - imag(zz); long double u = det(X, B, Y, D) / det(A, B, C, D); long double v = det(A, X, B, Y) / det(A, B, C, D); vector us(t); vector vs(t); zz = 1; for (int i = t - 1; i >= 0; i--) { us[i] = real(zz)/2 * u + imag(zz)/2 * v; vs[i] = -imag(zz)/2 * u + real(zz)/2 * v; zz *= z; } P a(1, 0); long double sum = 0; for (int i = 0; i < t; i++) { sum += norm(P(us[i], vs[i])); printf("%.30Lf %.30Lf\n", us[i], vs[i]); a = z*a + P(us[i], vs[i]); } cerr << a << endl; fprintf(stderr, "%.30Lf\n", sum); } int main() { int n; cin >> n; while (n--) solve(); }