// #include "bits/stdc++.h" using namespace std; typedef long long ll; typedef long double ld; typedef pair P; typedef pairIP; typedef vector V; typedef vector V2; typedef vector > G; void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));} void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);} #define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++) #define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++) #define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--) #define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--) template void chmax(T &a, const T &b){if(a < b){a = b;}} template void chmin(T &a, const T &b){if(a > b){a = b;}} const ll INF = 1145141919; const ll MOD = 1000000007; const ll NUM = 101010; int main(){ ll a, b, c; cin >> a >> b >> c; if(a == 0 && b == 0 && c == 0)cout << -1 << endl; else if(a == 0 && b == 0)cout << 0 << endl; else if(a == 0){ cout << 1 << endl; ld ans = -c; ans /= b; cout << fixed << setprecision(30); cout << ans << endl; } else if(b * b - 4 * a * c < 0)cout << 0 << endl; else if(b * b - 4 * a * c == 0){ cout << 1 << endl; ld ans = -b; ans /= ld(2 * a); cout << fixed << setprecision(30); cout << ans << endl; } else{ cout << 2 << endl; cout << fixed << setprecision(30); ld x1, x2; // 異符号の浮動小数点数同士の加算で有効桁数が大幅に減る if(b < 0)x1 = ld(-b) + sqrt(ld(b * b - 4 * a * c)); else x1 = ld(-b) - sqrt(ld(b * b - 4 * a * c)); x1 /= ld(2 * a); x2 = ld(c) / ld(x1 * a); cout << min(x1, x2) << endl; cout << max(x1, x2) << endl; } return 0; }