Codeforces 1288A Deadline

Topic links:

codeforces 1288A Deadline

ideas:

that is seeking $x+ceil(\frac{d}{x+1})$ Minimum value will exceed $n$
by an inequality $a+b\leq2\sqrt{ab}$Left formula can be obtained is the minimum value $2ceil(\sqrt{d})-1$

Code:

#include<bits/stdc++.h>

using namespace std;

int main() {
#ifdef MyTest
	freopen("Sakura.txt", "r", stdin);
#endif	
	int kase;
	cin >> kase;
	while(kase--){
		int n, d;
		cin >> n >> d;
		int ans = ceil(2.0 * sqrt(1.0 * d) - 1);
		if(ans <= n) puts("Yes");
		else puts("No");
	}
	return 0;
}