// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second #define INF (numeric_limits::max()/2-1) #ifdef LOCAL #define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__) #define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl; #define debug if (1) void dump_impl(const char*) { cerr << endl; } template void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); } #else #define dump(...) #define say(x) #define debug if (0) #endif template using pque_max = priority_queue; template using pque_min = priority_queue, greater >; template ::value>::type> ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; } template ::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template ostream& operator<<(ostream& os, pair const& p) { return os << "(" << p.first << ", " << p.second << ")"; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } template typename enable_if= tuple_size::value>::type output_tuple(ostream&, T const&) { } template typename enable_if::value>::type output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get(t); output_tuple(os,t); } template ostream& operator<<(ostream& os, tuple const& t) { return output_tuple(os,t), os; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; } template constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } // <<< int32_t main() { int a,b,c; cin >> a >> b >> c; if (a == 0) { if (b == 0) { if (c == 0) { quit(-1); } else { quit(0); } } else { cout << 1 << endl; cout << double(-c)/b << endl; } } else { __int128 d = __int128(b)*b - __int128(a)*c*4; if (d < 0) { quit(0); } else if (d == 0) { cout << 1 << endl; cout << double(-b)/(2*a) << endl; } else { cout << 2 << endl; double x = (-sqrt(double(d))-b) /(2*a); // double y = (+sqrt(double(d))-b) /(2*a); double y = double(-2*c)/(+sqrt(double(d))+b); if (a < 0) swap(x,y); cout << x << endl; cout << y << endl; } } }