#include <stdio.h> #include <string> #include <cstring> #include <stdlib.h> #include <math.h> #include <algorithm> #include <vector> #include <set> #include <map> #include <queue> #include <stack> #include <list> #include <iterator> #include <assert.h> #pragma warning(disable:4996) typedef long long ll; #define MIN(a, b) ((a)>(b)? (b): (a)) #define MAX(a, b) ((a)<(b)? (b): (a)) #define LINF 9223300000000000000 #define INF 2140000000 const long long MOD = 1000000007; //const long long MOD = 998244353; using namespace std; int main(int argc, char* argv[]) { ll a,b,c; scanf("%lld%lld%lld", &a, &b, &c); if(a==0) { if(b==0) { if(c==0) { printf("-1\n"); } else { printf("0\n"); } } else { printf("1\n"); printf("%.16Lf\n", (long double)(-c)/b); } } else { const long double eps=1e-10; long double d=(long double)b*b-(long double)4*a*c; if(d<-eps) { printf("0\n"); } else if(fabs(d)<eps) { printf("1\n"); long double x=(long double)(-b)/((long double)2*a); printf("%.16Lf\n", x); } else { printf("2\n"); if(b>=0) { long double x=(long double)(-b-sqrt(d))/((long double)2*a); long double y=(long double)c/a/x; if(x>y) swap(x,y); printf("%.16Lf\n", x); printf("%.16Lf\n", y); } else { long double x=(long double)(-b+sqrt(d))/((long double)2*a); long double y=(long double)c/a/x; if(x>y) swap(x,y); printf("%.16Lf\n", x); printf("%.16Lf\n", y); } } } return 0; }