-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path1166.cpp
More file actions
55 lines (44 loc) · 901 Bytes
/
Copy path1166.cpp
File metadata and controls
55 lines (44 loc) · 901 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>
#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;
double n, l, w, h;
bool check(double mid)
{
if (floor(l / mid) * floor(w / mid) * floor(h / mid) < n)
return false;
return true;
}
int main()
{
cin >> n >> l >> w >> h;
double lo = 0;
double hi = 1000000000;
for (int i = 0; i < 100; i++)
{
double mid = (lo + hi) * 0.5;
if (check(mid))
lo = mid;
else
hi = mid;
}
printf("%.10lf\n", lo);
return 0;
}