简单数学题,主要利用相似变成比例来求解
AcCode
#include<iostream>
#include<cstdio>
#include<set>
#include<algorithm>
#include<vector>
#include<cmath>
#include<iomanip>
using namespace std;
const int N = 500010;
int n, rmax = -1;
int arr[N];
bool vis[N];
vector<int> vec;
signed main() {
int r, a, b, h;
cin >> r >> a >> b >> h;
if (2 * r <= b) {
cout << "Drop" << endl;
return 0;
}
double d = 1.0 * b * h / (a - b);
double sq = sqrt(b * b + 4 * d * d);
double ans = 1.0 * r * sq / b;
ans -= d;
cout << "Stuck" << endl;
cout <<setiosflags(ios::fixed) <<setprecision(8)<<ans << endl;
}