package adv2019; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; // sqrtを正確に求めないといけない系? public class D17 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long a = nl(), b = nl(), c = nl(); long[][] res = solveQuad(a, b, c); if(res == null){ out.println(-1); }else{ out.println(res.length); for(long[] u : res){ out.printf("%.14f\n", (u[0] + u[1] * Math.sqrt(u[2])) / u[3]); } } } public static long[][] solveQuad(long A, long B, long C) { if(A == 0){ if(B == 0){ return C == 0 ? null : new long[0][]; }else{ return new long[][]{reducex(new long[]{-C, 0, 0, B})}; } } long D = B*B-4*A*C; if(D < 0){ return new long[0][]; }else if(D == 0){ return new long[][]{reducex(new long[]{-B, 0, 0, 2L*A})}; }else{ if(A > 0){ return new long[][]{ reducex(new long[]{-B, -1, D, 2L*A}), reducex(new long[]{-B, 1, D, 2L*A}) }; }else{ return new long[][]{ reducex(new long[]{-B, 1, D, 2L*A}), reducex(new long[]{-B, -1, D, 2L*A}) }; } } } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } public static long[] reducex(long[] f) { long g = gcd(f[0], f[3]); for(long p = 2;p*p <= g;p++){ if(g % p == 0 && f[2] % (p*p) == 0){ f[2] /= p*p; g /= p; f[0] /= p; f[3] /= p; } } return f; // // f[2] < 0 ?? // if(f[2] == 0)f[1] = 0; // if(f[1] == 0)f[2] = 0; // if(f[2] == 0 || f[1] == 0){ // // normal fraction // if(f[3] == 0) { // n/0 // f[0] = 1; // }else if(f[0] == 0) { // 0/n // f[3] = 1; // }else { // if(f[3] < 0) { // -a/-b ->a/b // f[0] = -f[0]; // f[3] = -f[3]; // } // long a = Math.abs(f[0]), b = f[3]; // while (b > 0) { // long c = a; // a = b; // b = c % b; // } // f[0] /= a; // f[3] /= a; // } // }else{ // for(long p = 2;p * p <= f[2];p++){ // while(f[2] % (p*p) == 0){ // f[1] *= p; // f[2] /= p*p; // } // } // if(f[3] == 0) { // n/0 // f[0] = 1; // f[1] = f[2] = 0; // }else { // if(f[3] < 0) { // -a/-b ->a/b // f[0] = -f[0]; // f[1] = -f[1]; // f[3] = -f[3]; // } // long a = Math.abs(f[0]), b = f[3]; // while (b > 0) { // long c = a; // a = b; // b = c % b; // } // b = Math.abs(f[1]); // while (b > 0) { // long c = a; // a = b; // b = c % b; // } // // f[0] /= a; // f[1] /= a; // f[3] /= a; // } // } // return f; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D17().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }