import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const A = readLong(); const B = readLong(); const C = readLong(); const a = cast(real)(A); const b = cast(real)(B); const c = cast(real)(C); if (A != 0) { const D = B * B - 4 * A * C; if (D > 0) { {import core.stdc.stdlib;exit(1);} const d = sqrt(cast(real)(D)); real[] ts; ts ~= (-b - d) / (2.0L * a); ts ~= (-b + d) / (2.0L * a); ts.sort; writeln(2); writefln("%.15f", ts[0]); writefln("%.15f", ts[1]); } else if (D == 0) { writeln(1); writefln("%.15f", -b / (2.0L * a)); } else { writeln(0); } } else if (B != 0) { writeln(1); writefln("%.15f", -c / b); } else if (C != 0) { writeln(0); } else { writeln(-1); } } } catch (EOFException e) { } }