#include using namespace std; using ll = long long; using VI = vector; using VL = vector; using VS = vector; using VB = vector; using VVI = vector; using VVL = vector; using PII = std::pair; using PLL = std::pair; using TI3 = std::tuple; using TI4 = std::tuple; using TL3 = std::tuple; using TL4 = std::tuple; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9; const int mod = mod1; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template void show1dvec(const vector &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template void show2dvec(const vector> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template void show1dpair(const vector> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template void pairzip(const vector> &v, vector &t, vector &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template void maxvec(vector &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } template vector cumsum(const vector &v) { T s = 0; vector ret; rep(i, v.size()) { s += v[i]; s %= mod; ret.emplace_back(s); } return ret; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } VS split(string s, char c) { VS ret; string part; s += c; rep(i, s.length()) { if (s[i] == c) { ret.emplace_back(part); part = ""; } else if (s[i] != c) { part += s[i]; } } return ret; } string removezero(string &s) { string ret; for (auto z : s) if (z != '0') ret += z; return ret; } ll sumdigit(ll x) { ll ans{0}; while (x > 0) { ans += x % 10; x /= 10; } return ans; } template ll pow_mod(T p, S q, R mod = 1ll) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r, ret %= mod; r = (r * r) % mod, q /= 2; } return ret % mod; } template ll pow_no_mod(T p, S q) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r; r = (r * r), q /= 2; } return ret; } void make_frac_tables(VL &frac_list, VL &frac_inv_list) { rep(i, frac_list.size() - 1) { frac_list[i + 1] *= frac_list[i] * (i + 1); frac_list[i + 1] %= mod; frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod); frac_inv_list[i + 1] %= mod; } } ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) { if (a < b) return 0; if (b < 0) return 0; ll ret = frac_list[a]; ret *= frac_inv_list[b]; ret %= mod; ret *= frac_inv_list[a - b]; ret %= mod; return ret; } void solve_eq(double a, double b, double c) { if (a < 0) { a *= -1; b *= -1; c *= -1; } double l, r, mid; l = -2e9; r = -b / (2 * a); rep(i, 100) { mid = (l + r) / 2; if (a * mid * mid + b * mid + c >= 0) { l = mid; } else { r = mid; } } printf("%.30f\n", r); r = 2e9; l = -b / (2 * a); rep(i, 100) { mid = (l + r) / 2; if (a * mid * mid + b * mid + c <= 0) { l = mid; } else { r = mid; } } printf("%.30f\n", r); } int main() { cin.tie(0); ios::sync_with_stdio(false); #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif ll ai, bi, ci; double a, b, c, d, x1, x2; cin >> ai >> bi >> ci; a = 1.0 * ai; b = 1.0 * bi; c = 1.0 * ci; if (a == 0) { if (b == 0) { if (c == 0) { cout << -1 << rt; } else { cout << 0 << rt; } } else { cout << 1 << endl; printf("%.12f\n", -c / b); } } else { if (bi * bi - 4 * ai * ci > 0) { d = b * b - 4 * a * c; x1 = (-b - sqrt(d)) / (2.0 * a); x2 = (-b + sqrt(d)) / (2.0 * a); if (x1 > x2) swap(x1, x2); cout << 2 << endl; solve_eq(a, b, c); } else if (bi * bi - 4 * ai * ci == 0) { cout << 1 << endl; printf("%.12f\n", -b / (2.0 * a)); } else { cout << 0 << rt; } } return 0; }