from math import ceil
from math import sqrt
t = int(input())
s = {}
for i in range(t):
n,d = map(int,input().split())
s[i] = [n,d]
for key,value in s.items():
n = int(value[0])
d = int(value[1])
if d > n:
flag = True
for x in range(1,ceil(sqrt(d))):
total = 0
y = ceil(float(d)/(x+1))
total = x + y
if total <= n:
flag = True
break
else:
flag = False
if flag == True:
print('YES')
else:
print('NO')
else:
print('YES')
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n,d;
cin>>t;
while(t--){
cin>>n>>d;
bool possible = false;
for (int i = 0; i < n; i++)
{
if ((i+d)/(i+1) <= n-i) {
possible = true;
break;
}
}
if (possible) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |