#ifndef _TEMPLATE_ROOT #define _TEMPLATE_ROOT #include "bits/stdc++.h" using namespace std; #define rep(i, a, b) for(int i = a; i < (b); ++i) #define repl(i, a, b) for(ll i = a; i < (b); ++i) #define repd(i, a, b) for(int i = a; i >= (b); --i) #define repdl(i, a, b) for(ll i = a; i >= (b); --i) #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() typedef long long ll; typedef pair pii; typedef vector vi; template bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; } template bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; } #endif #ifndef _TEMPLATE_IO #define _TEMPLATE_IO template void read(H& head) { cin >> head; } template void read(H& head, T& ...tail) { cin >> head; read(tail...); } template void write(H head) { cout << head << '\n'; } template void write(H head, T ...tail) { cout << head << " "; write(tail...); } template void writef(T ...tail) { write(tail...); cout << flush; } template void die(T ...tok) { write(tok...); exit(0); } template ostream& operator<<(ostream& out, const vector& v) { if (v.size()) { rep(i, 0, sz(v) - 1) out << v[i] << " "; out << v.back(); } return out; } #endif using namespace std; typedef long double ld; ld fsqrt(ld x) { if (x == 0) return 0; ld a = x; rep(i, 0, 30) a -= (a * a - x) / (2 * a); return a; } int main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); int n; read(n); typedef long double ld; ld sum = 0.0; char buf[50]; rep(i, 0, n) { ld x; read(x); sum += fsqrt(x); sprintf(buf, "%.20Lf", sum); rep(j, 0, 19) cout << buf[j]; cout << '\n'; } }