#ifdef __LOCAL #include // プリコンパイル済みヘッダ ~/local/include/mytemplate.hpp.gch #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif using namespace std; // #pragma GCC target "no-avx" // gcc12.2のバグ回避用。boost使用時はコメントアウトの事 // #include // using bint = boost::multiprecision::cpp_int; using ll = long long; using vl = vector; using vvl = vector; using vb = vector; using vvb = vector; using vd = vector; using vvd = vector; using vc = vector; using vvc = vector; using pll = pair; template using min_priority_queue = priority_queue, greater>; #define REP1(i, n) REP3(i, 0, n, 1) #define REP2(i, s, n) REP3(i, s, n, 1) #define REP3(i, s, n, d) for (ll i = (ll)(s); i < (ll)(n); i += (d)) #define REP_OVERLOAD(e1, e2, e3, e4, NAME, ...) NAME #define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__) #define DEP1(i, n) DEP3(i, n, -1, 1) #define DEP2(i, n, s) DEP3(i, n, s, 1) #define DEP3(i, n, s, d) for (ll i = (ll)(n); (ll)(s) < i; i -= (d)) #define DEP_OVERLOAD(e1, e2, e3, e4, NAME, ...) NAME #define dep(...) DEP_OVERLOAD(__VA_ARGS__, DEP3, DEP2, DEP1)(__VA_ARGS__) #define fore(e, a) for (auto&& e : (a)) #define len(a) (ll)(a).size() #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() #define pb push_back #define eb emplace_back #define fi first #define se second #define th third #define fo fourth /********* C O N S T A N T **********/ constexpr ll INF = LONG_LONG_MAX / 2 - 10000LL; // 4,611,686,018,427,377,903 ~= 4.6e+18, 19桁 const double PI = acos(-1); /********* 1 2 8 b i t 整数 **********/ using int128 = __int128_t; istream& operator>>(istream& stream, int128& val); ostream& operator<<(ostream& stream, const int128& val_); /********* P A I R **********/ // 単項演算子（+ -） template pair operator+(pair a); template pair operator-(pair a); // 複合代入演算子 template pair& operator+=(pair& a, const pair b); template pair& operator-=(pair& a, const pair b); template pair& operator*=(pair& a, const pair b); template pair& operator/=(pair& a, const pair b); template pair& operator%=(pair& a, const pair b); template pair& operator+=(pair& a, const V b); template pair& operator-=(pair& a, const V b); template pair& operator*=(pair& a, const V b); template pair& operator/=(pair& a, const V b); template pair& operator%=(pair& a, const V b); // 算術演算子 template pair operator+(pair a, const V& b); template pair operator-(pair a, const V& b); template pair operator*(pair a, const V& b); template pair operator/(pair a, const V& b); template pair operator%(pair a, const V& b); // 入出力 template istream& operator>>(istream& stream, pair& a); template ostream& operator<<(ostream& stream, const pair& a); /********* V E C T O R **********/ // 単項演算子（+ -） template vector operator+(vector a); template vector operator-(vector a); // 複合代入演算子 template vector& operator+=(vector& a, const vector b); template vector& operator-=(vector& a, const vector b); template vector& operator*=(vector& a, const vector b); template vector& operator/=(vector& a, const vector b); template vector& operator%=(vector& a, const vector b); template vector& operator+=(vector& a, const U b); template vector& operator-=(vector& a, const U b); template vector& operator*=(vector& a, const U b); template vector& operator/=(vector& a, const U b); template vector& operator%=(vector& a, const U b); // 算術演算子 template vector operator+(vector a, const U& b); template vector operator-(vector a, const U& b); template vector operator*(vector a, const U& b); template vector operator/(vector a, const U& b); template vector operator%(vector a, const U& b); // 入出力 template istream& operator>>(istream& stream, vector& a); template ostream& operator<<(ostream& stream, const vector& v); template ostream& operator<<(ostream& stream, const vector>& vv); // 計算 template T Sum(const vector& v); template T Max(const vector& v); template T Min(const vector& v); template ll Argmax(const vector& v); template ll Argmin(const vector& v); template bool Contains(const vector& v, const U& a); template void Unique(vector& v); // 生成 template vector make_vector(int n, U v); template auto make_vector(int n, Args... args) { auto val = make_vector(args...); return make_vector(n, move(val)); } /********* S E T **********/ template istream& operator>>(istream& stream, set& st); template ostream& operator<<(ostream& stream, const set& st); template T Max(const set& st); template T Min(const set& st); /********* M U L T I S E T **********/ template istream& operator>>(istream& stream, multiset& st); template ostream& operator<<(ostream& stream, const multiset& st); template T Max(const multiset& st); template T Min(const multiset& st); template bool EraseOne(multiset& st, const T& x); /********* C H A R **********/ bool IsUpper(const char& c); bool IsLower(const char& c); char ToUpper(const char& c); char ToLower(const char& c); /********* S T R I N G **********/ string ToUpper(const string& s); string ToLower(const string& s); bool IsPalindrome(const string& S); /********* T R I O **********/ template struct trio { T1 first; T2 second; T3 third; // コンストラクタ・代入演算子 trio(); trio(const T1& x); trio(const T1& x, const T2& y, const T3& z); trio(const trio& t); trio& operator=(const trio& t); // 比較演算子 bool operator<(const trio& t) const; bool operator==(const trio& t) const; bool operator!=(const trio& t) const; bool operator>(const trio& t) const; bool operator<=(const trio& t) const; bool operator>=(const trio& t) const; // 単項演算子（+ -） trio operator+() const; trio operator-() const; // 入出力 template friend istream& operator>>(istream&, trio&); template friend ostream& operator<<(ostream&, const trio&); // `tie(a, b, c) = tll{3, 5, 7}`をするのに必要（コンパイラが警告？を出すのでここで定義） operator tuple() { return tie(first, second, third); } }; // 複合代入演算子 template trio& operator+=(trio& a, const trio b); template trio& operator-=(trio& a, const trio b); template trio& operator*=(trio& a, const trio b); template trio& operator/=(trio& a, const trio b); template trio& operator%=(trio& a, const trio b); template trio& operator+=(trio& a, const U b); template trio& operator-=(trio& a, const U b); template trio& operator*=(trio& a, const U b); template trio& operator/=(trio& a, const U b); template trio& operator%=(trio& a, const U b); // 算術演算子 template trio operator+(trio a, const U& b); template trio operator-(trio a, const U& b); template trio operator*(trio a, const U& b); template trio operator/(trio a, const U& b); template trio operator%(trio a, const U& b); using tll = trio; /********* Q U A R T E T **********/ template struct quartet { T1 first; T2 second; T3 third; T4 fourth; // コンストラクタ・代入演算子 quartet(); quartet(const T1& x); quartet(const T1& x, const T2& y, const T3& z, const T4& w); quartet(const quartet& t); quartet& operator=(const quartet& t); // 比較演算子 bool operator<(const quartet& t) const; bool operator==(const quartet& t) const; bool operator!=(const quartet& other) const; bool operator>(const quartet& other) const; bool operator<=(const quartet& other) const; bool operator>=(const quartet& other) const; // 単項演算子（+ -） quartet operator+() const; quartet operator-() const; // 入出力 template friend istream& operator>>(istream&, quartet&); template friend ostream& operator<<(ostream&, const quartet&); // `tie(a, b, c, d) = qll{3, 5, 7, 9}`をするのに必要（コンパイラが警告？を出すのでここで定義） operator tuple() { return tie(first, second, third, fourth); } }; // 複合代入演算子 template quartet& operator+=(quartet& a, const quartet b); template quartet& operator-=(quartet& a, const quartet b); template quartet& operator*=(quartet& a, const quartet b); template quartet& operator/=(quartet& a, const quartet b); template quartet& operator%=(quartet& a, const quartet b); template quartet& operator+=(quartet& a, const U b); template quartet& operator-=(quartet& a, const U b); template quartet& operator*=(quartet& a, const U b); template quartet& operator/=(quartet& a, const U b); template quartet& operator%=(quartet& a, const U b); // 算術演算子 template quartet operator+(quartet a, const U& b); template quartet operator-(quartet a, const U& b); template quartet operator*(quartet a, const U& b); template quartet operator/(quartet a, const U& b); template quartet operator%(quartet a, const U& b); using qll = quartet; /********* R A N D O M **********/ struct Random { mt19937_64 rnd; Random(); Random(ll seed); ll randint(ll a, ll b); double randreal(double a, double b); char randchar(char a, char b); template void shuffle(vector& vec); }; /********* T I M E R **********/ struct Timer { int time_limit; int start_time; Timer(double time_limit_sec); bool is_time_up() const; double get_elapsed_ratio() const; }; /********* P R I N T **********/ template void print(const T& e); template void print(const H& h, const T&... t); template void End(const T&... t); /********* D E B U G **********/ #ifdef __LOCAL #define debug(...) \ if (DEBUG) do { \ cout << '[' << #__VA_ARGS__ << "] "; \ debug_(__VA_ARGS__); \ } while (0) #else #define debug(...) #endif void dbg_(const long long& e); template void dbg_(const T& e); template void dbg_(const pair& p); template void dbg_(const trio& t); template void dbg_(const quartet& t); template void debug_(const T& e); template void debug_(const vector& v); template void debug_(const vector>& vv); template void debug_(const map& mp); template void debug_(const vector>& vm); template void debug_(const set& st); template void debug_(const multiset& st); template void debug_(const vector>& vs); template void debug_(const vector>& vs); template void debug_(const H& h, const T&... t); /********* O T H E R S **********/ template bool chmin(T& a, U b); template bool chmax(T& a, U b); template T Mod(const T& a, const U& m); template T Ceil(const T& x, const U& y); template T Floor(const T& x, const U& y); template ll Sign(const T& x); ll Isqrt(ll n); ll Comb(ll n, ll r); template T Pow(T x, ll n); template T Pow(T x, ll n, T mod); template T Aseries(T a, T d, ll n); template T Gseries(T a, T r, ll n); bool Bit(ll b, int i); ll Popcount(ll b); ll Mask(ll n); ll Mask(ll n, ll m); pll GetOverlap(ll l1, ll r1, ll l2, ll r2); bool IsOverlap(ll l1, ll r1, ll l2, ll r2); void PrintYesNo(bool b); /********* M O D **********/ // #include // https://atcoder.github.io/ac-library/production/document_ja/ // using namespace atcoder; // using mint = modint998244353; // modint1000000007; // istream& operator >>(istream& stream, mint& e) {ll n; stream >> n; e = n; return stream; } // ostream& operator <<(ostream& stream, const mint& e) { stream << e.val(); return stream; } // using vm = vector; // using vvm = vector; /***************************************/ constexpr bool DEBUG = true; int main() { cin.tie(nullptr); cout << fixed << setprecision(10); double c0, c1, c2, c3, l, r; cin >> c0 >> c1 >> c2 >> c3; cin >> l >> r; assert(c3 > 0); auto f = [&](double x) -> double { double y = c3 * Pow(x, 3) + c2 * Pow(x, 2) + c1 * x + c0; return abs(y); }; auto g = [&](double x) -> double { double y = c3 * Pow(x, 3) + c2 * Pow(x, 2) + c1 * x + c0; return y; }; double ans = INF; chmin(ans, f(l)); chmin(ans, f(r)); vector vec = {l, r}; if (c3 == 0 && c2 == 0 && c1 == 0) { } else if (c3 == 0 && c2 == 0) { } else if (c3 == 0) { double x = -c1 / (2 * c2); if (l <= x && x <= r) { chmin(ans, f(x)); vec.pb(x); } } else { double a = 3 * c3; double b = 2 * c2; double c = 1 * c1; double D = b * b - 4 * a * c; if (D > 0) { double x1 = (-b + sqrt(D)) / (2 * a); double x2 = (-b - sqrt(D)) / (2 * a); if (x1 > x2) swap(x1, x2); if (l <= x1 && x1 <= r) { chmin(ans, f(x1)); vec.pb(f(x1)); } if (l <= x2 && x2 <= r) { chmin(ans, f(x2)); vec.pb(f(x2)); } } } sort(all(vec)); rep(i, 1, len(vec)) { double x1 = vec[i - 1]; double x2 = vec[i]; if (g(x1) * g(x2) <= 0) ans = 0; } print(ans); } /********* 1 2 8 b i t 整数 *********/ // 128bit整数を入力. LONG_LONG_MAX超過/LONG_LONG_MIN未満もOK. istream& operator>>(istream& stream, int128& val) { string s; stream >> s; assert(s.size() > 0); val = 0; bool is_minus = false; for (int i = 0; i < (int)s.size(); i++) { if (i == 0 && s[i] == '-') { assert(s.size() > 1); is_minus = true; } else { assert('0' <= s[i] && s[i] <= '9'); val *= 10; val += s[i] - '0'; } } if (is_minus) val *= -1; return stream; } // 128bit整数を出力. ostream& operator<<(ostream& stream, const int128& val_) { auto val(val_); if (val == 0) return stream << 0; if (val < 0) { stream << '-'; val *= -1; } string s; while (val > 0) { s += (val % 10) + '0'; val /= 10; } reverse(all(s)); return stream << s; } /********* P A I R **********/ /* 単項演算子（+ -） */ template pair operator+(pair a) { return a; } template pair operator-(pair a) { return a * (-1); } /* 複合代入演算子 (pair) */ template pair& operator+=(pair& a, const pair b) { a.fi += b.fi; a.se += b.se; return a; } template pair& operator-=(pair& a, const pair b) { a.fi -= b.fi; a.se -= b.se; return a; } template pair& operator*=(pair& a, const pair b) { a.fi *= b.fi; a.se *= b.se; return a; } template pair& operator/=(pair& a, const pair b) { a.fi /= b.fi; a.se /= b.se; return a; } template pair& operator%=(pair& a, const pair b) { a.fi %= b.fi; a.se %= b.se; return a; } template pair& operator+=(pair& a, const V b) { a.fi += b; a.se += b; return a; } template pair& operator-=(pair& a, const V b) { a.fi -= b; a.se -= b; return a; } template pair& operator*=(pair& a, const V b) { a.fi *= b; a.se *= b; return a; } template pair& operator/=(pair& a, const V b) { a.fi /= b; a.se /= b; return a; } template pair& operator%=(pair& a, const V b) { a.fi %= b; a.se %= b; return a; } /* 算術演算子 (pair) */ template pair operator+(pair a, const V& b) { return a += b; } template