0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-24 14:48:48 +00:00
OI-codes/Luogu/problem/P1163/P1163.cpp
2021-01-02 15:30:52 +08:00

22 lines
417 B
C++

#include <bits/stdc++.h>
using namespace std;
int main() {
double n, m, k, l, r, mid;
cin >> n >> m >> k;
l = 00.0;
r = 10.0;
while (r - l >= 0.0001) {
mid = (l + r) / 2;
if (pow(1.0 / (1.0 + mid), k) >= 1 - n / m * mid) {
r = mid;
}
else {
l = mid;
}
}
cout << fixed << setprecision(1) << l * 100 << endl;
return 0;
}