#include using namespace std; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { std::cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector c(n);for(auto& i:c) cin>>i; #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define pb pop_back #define fi first #define se second #define get(a, i) get(a) typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; #define mini min_element #define maxi max_element #define sum(a, b) accumulate(a, b) #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} double solve() { var(double, xa, ya, xb, yb); double low = min(ya, yb), high = max(ya, yb); double mid, t1, t2, t; map m; m[ya] = xa + hypot(xb, abs(ya - yb)); m[yb] = xb + hypot(xa, abs(ya - yb)); rep(i, 0, 100) { mid = (low + high) / 2; t1 = hypot(xa, abs(mid - ya)); t2 = hypot(xb, abs(mid - yb)); t = t1 + t2; m[mid] = t; if (abs(m[low] - m[mid]) > abs(m[high] - m[mid])) { low = mid; } else { high = mid; } } return mid; } int main() { print(solve()); return 0; }