Submission #2410981

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

int N; long double H, W;

int main() {
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> H >> W;
		long double L = 0, R = sqrtl(H*H + W*W), M, maxn = 0;

		for (int j = 0; j < 80; j++) {
			M = (L + R) / 2;
			long double P1 = 0; if (M >= H) P1 = sqrtl(M*M - H*H);
			long double P2 = 0; if (M >= W) P2 = sqrtl(M*M - W*W);
			long double P3 = sqrtl((W - P1)*(W - P1) + (H - P2)*(H - P2));
			maxn = max(maxn, min({ sqrtl(H*H + P1*P1),sqrtl(W*W + P2*P2),P3 }));
			if (M < P3) { L = M; }
			else { R = M; }
		}
		printf("%.12Lf\n", maxn);
	}
	return 0;
}

Submission Info

Judge Result