/** * code generated by JHelper * More info: https://github.com/AlexeyDmitriev/JHelper * @author aajisaka */ #include using namespace std; void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr) #define rep(i,n) for(int i=0; i<(int)(n); i++) #define all(v) v.begin(), v.end() template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } using ll = long long; using ull = unsigned long long; using P = pair; constexpr long double PI = 3.14159265358979323846264338327950288L; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); class No1230HallAndMe { public: void solve(istream& cin, ostream& cout) { SPEED; vector a(3); rep(i, 3) cin >> a[i]; sort(a.rbegin(), a.rend()); cout << setprecision(10) << fixed; if (a[0] >= a[1]+a[2]) { cout << (double)a[0]/(a[0]+a[1]+a[2]) << endl; } else { cout << (double)(a[1]+a[2])/(a[0]+a[1]+a[2]) << endl; } } }; signed main() { No1230HallAndMe solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; }