#include #define LLI long long int #define FOR(v, a, b) for(LLI v = (a); v < (b); ++v) #define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(LLI v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define popcount __builtin_popcount #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include #else #define dump(...) ((void)0) #endif #define gcd __gcd using namespace std; template constexpr T lcm(T m, T n){return m/gcd(m,n)*n;} template void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost< istream& operator>>(istream &is, vector &v){for(auto &a : v) is >> a; return is;} template bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template bool chmax(T &a, const U &b){return (a void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); cerr << fixed << setprecision(12); } }init; vector quadratic_equation(double a, double b, double c){ double d = b*b-4*a*c; if(d < 0) return {}; double x1 = (-b - sqrt(d))/(2*a); double x2 = (-b + sqrt(d))/(2*a); return {x1,x2}; } int main(){ LLI a,b,c; while(cin >> a >> b >> c){ if(a == 0){ if(b == 0){ if(c == 0){ cout << -1 << endl; }else{ cout << 0 << endl; } }else{ cout << 1 << endl; cout << (double)c / (-b) << endl; } }else{ LLI d = b*b-4*a*c; if(d == 0){ cout << 1 << endl; cout << (double)b / (-2*a) << endl; }else if(d < 0){ cout << 0 << endl; }else{ cout << 2 << endl; double x = (-(double)b - sqrt(d)) / (2*a); double y = (-(double)b + sqrt(d)) / (2*a); if(x > y) swap(x, y); cout << x << endl; cout << y << endl; } } } return 0; }