#include "bits/stdc++.h" // Begin Header {{{ using namespace std; #ifndef DEBUG #define dump(...) #endif #define all(x) x.begin(), x.end() #define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i) #define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i) #define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i) #define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__) constexpr size_t operator""_zu(unsigned long long value) { return value; }; constexpr intmax_t operator""_jd(unsigned long long value) { return value; }; constexpr uintmax_t operator""_ju(unsigned long long value) { return value; }; constexpr int INF = 0x3f3f3f3f; constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd; template > using MaxHeap = priority_queue, Compare>; template > using MinHeap = priority_queue, Compare>; inline void input() {} template inline void input(Head&& head, Tail&&... tail) { cin >> head; input(forward(tail)...); } template inline istream& operator>>(istream &is, vector &vec) { for (auto &e: vec) { is >> e; } return is; } inline void output() { cout << "\n"; } template inline void output(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail)) { cout << " "; } output(forward(tail)...); } template inline ostream& operator<<(ostream &os, const vector &vec) { static constexpr const char *delim[] = {" ", ""}; for (const auto &e: vec) { os << e << delim[&e == &vec.back()]; } return os; } template inline vector makeVector(const T &initValue, size_t sz) { return vector(sz, initValue); } template inline auto makeVector(const T &initValue, size_t sz, Args... args) { return vector(initValue, args...))>(sz, makeVector(initValue, args...)); } template class FixPoint : Func { public: explicit constexpr FixPoint(Func&& f) noexcept : Func(forward(f)) {} template constexpr decltype(auto) operator()(Args&&... args) const { return Func::operator()(*this, std::forward(args)...); } }; template static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept { return FixPoint{forward(f)}; } template struct reverse_t { Container &c; reverse_t(Container &c) : c(c) {} auto begin() { return c.rbegin(); } auto end() { return c.rend(); } }; template auto reversed(Container &c) { return reverse_t(c); } template inline bool chmax(T &a, const T &b) noexcept { return b > a && (a = b, true); } template inline bool chmin(T &a, const T &b) noexcept { return b < a && (a = b, true); } template inline T diff(const T &a, const T &b) noexcept { return a < b ? b - a : a - b; } // End Header }}} signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(10); var(double, a, b, c, d); const auto f = [&](double x) { return +x * x + a * x + b; }; [[maybe_unused]] const auto g = [&](double x) { return -x * x + c * x + d; }; const double D = (a - c) * (a - c) - 8 * (b - d); if (D < 0) { output("No"); } else if (D == 0) { output("Yes"); } else { const double x1 = (-sqrtl(a * a - 2 * a * c - 8 * b + c * c + 8 * d) - a + c) / 4; const double y1 = f(x1); const double x2 = (sqrtl(a * a - 2 * a * c - 8 * b + c * c + 8 * d) - a + c) / 4; const double y2 = f(x2); pair p1 {x1, y1}, p2 {x2, y2}; if (p1 >= p2) swap(p1, p2); dump(p1, p2); dump(f(x1), g(x1)); dump(f(x2), g(x2)); const double alpha = (p2.second - p1.second) / (p2.first - p1.first); const double t = y1 - alpha * x1; output(alpha, t); } return 0; }