#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = int64_t; using P = pair; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep1(i, n) for (int i = 1; i < (n); ++i) #define repn(i, a, b) for(int i = (a); i < (b); ++i) #define rep_inv(i, n) for (int i = (n); i >= 0; --i) #define all(vec) vec.begin(), vec.end() #define cend printf("\n") //constexpr lint mod = 998'244'353LL; constexpr lint Mod = 1000'000'007LL; constexpr lint Inf = 4'500'000'000'000'000'007LL; //4.5e18+7 constexpr double Pi = 3.141592653589793; template using prique = priority_queue; template using prique_inv = priority_queue, greater>; templateinline istream& operator>>(istream& is, pair& rhs) { return is >> rhs.first >> rhs.second; } templateinline ostream& operator<<(ostream& os, const pair& rhs) { return os << rhs.first << " " << rhs.second; } template void arrin(InputIterator first, InputIterator last) { for (; first != last; ++first) cin >> (*first); } template void arrout(InputIterator first, InputIterator last) { for (; first != last; ++first) { cout << (*first) << ((first + 1) != last ? " " : "\n"); } } bool pri(lint x) { for (lint i = 2; i * i <= x; ++i) { if (x % i == 0) return false; } return 1 < x; } lint fact[3000000]; void fact_init(lint n, lint m = Mod) { if (3000000 <= n) return; fact[0] = fact[1] = 1; for (lint i = 2; i <= n; ++i) { fact[i] = i * fact[i - 1] % m; } } lint modpow(lint x, lint n, lint m = Mod) { lint res = 1; while (n > 0) { if (n & 1) res = res * x % m; x = x * x % m; n >>= 1; } return res; } lint intpow(lint x, lint n) { lint res = 1; while (n > 0) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } lint comb(lint n, lint r, lint m = Mod) { if (r == 0 || r == n) return 1; lint res = fact[n] * modpow(fact[n - r], m - 2, m) % m * modpow(fact[r], m - 2, m) % m; return res < 0 ? res + m : res; } map factring(lint n) { map res; for (lint i = 2; i * i <= n; ++i) { while (n % i == 0) { n /= i; ++res[i]; } } if (n != 1) ++res[n]; return res; } int main() { double a, b, c; cin >> a >> b >> c; double d = b * b - 4 * a * c; if (d < 0.0) cout << "imaginary\n"; else if (fabs(d) < 1e-12) { cout << -0.5 * b / a << endl; } else { double x1, x2, t; if (0.0 < b) { t = -b - sqrt(d); } else { t = -b + sqrt(d); } x1 = 2 * c / t; x2 = 0.5 * t / a; if (x1 > x2) swap(x1, x2); cout << x1 << " " << x2 << endl; } }