307022: CF1288A. Deadline
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Deadline
题意翻译
- 你需要在 $n$ 天时间内完成一个任务。正常情况下完成该任务需要 $d$ 天,但是你可以花 $x$ 天来优化,使得该任务只需花 $\lceil \frac{d}{x+1}\rceil$ 天来完成,这意味着你总共需要花费 $x+\lceil \frac{d}{x+1}\rceil$ 天来完成该任务。给定 $n,d$,判断是否存在一种策略使得该任务能在 $n$ 天内完成,若可以,输出 ```YES```,否则输出 ```NO```。 - 本题有多组数据。令数据组数为 $T$,$T\le 50$,$n\le 10^9$,$d\le 10^9$。题目描述
Adilbek was assigned to a special project. For Adilbek it means that he has $ n $ days to run a special program and provide its results. But there is a problem: the program needs to run for $ d $ days to calculate the results. Fortunately, Adilbek can optimize the program. If he spends $ x $ ( $ x $ is a non-negative integer) days optimizing the program, he will make the program run in $ \left\lceil \frac{d}{x + 1} \right\rceil $ days ( $ \left\lceil a \right\rceil $ is the ceiling function: $ \left\lceil 2.4 \right\rceil = 3 $ , $ \left\lceil 2 \right\rceil = 2 $ ). The program cannot be run and optimized simultaneously, so the total number of days he will spend is equal to $ x + \left\lceil \frac{d}{x + 1} \right\rceil $ . Will Adilbek be able to provide the generated results in no more than $ n $ days?输入输出格式
输入格式
The first line contains a single integer $ T $ ( $ 1 \le T \le 50 $ ) — the number of test cases. The next $ T $ lines contain test cases – one per line. Each line contains two integers $ n $ and $ d $ ( $ 1 \le n \le 10^9 $ , $ 1 \le d \le 10^9 $ ) — the number of days before the deadline and the number of days the program runs.
输出格式
Print $ T $ answers — one per test case. For each test case print YES (case insensitive) if Adilbek can fit in $ n $ days or NO (case insensitive) otherwise.
输入输出样例
输入样例 #1
3
1 1
4 5
5 11
输出样例 #1
YES
YES
NO