当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

7053:Smzzl with Tropical Taste

题目描述
A boy, whose ID is smzzl, loves drinking Black Ice Tea(BIT), especially the tropical taste one.

The shop owner knows that, and she prepares a swimming pool so that there would be enough space for her to store BIT. When the boy knows that the owner prepared a swimming pool, he starts to drink in the swimming pool. While the owner is pouring BIT into the swimming pool, the boy is drinking it, too.

Assuming that there are $V$ liters of BIT in the swimming pool, the speed the owner pours BIT is $qV$ liters per second, and the speed the boy drinks BIT is $pV$ liters per second. Note that $V$ changes as the time goes.

Now, the owner wants to know whether the following statement is true:

For any $G>0$, there exists a $T>0$, for any $t>T$, the boy drinks more than $G$ liters of BIT after $t$ seconds.
输入解释
The input consists of multiple test cases.

The first line contains an integer $T$ ($1 \leq T \leq 100$) -- the number of test cases.

For each test case, there are two decimals $p,q$ ($0 < p,q < 10^4$, they have at most $4$ decimal places) in a single line, $p,q$ are mentioned in the statement. You may regard the initial volume of BIT as $1$ liter, and the swimming pool can contain infinity volume of BIT.
输出解释
For each test case, output a sentence in a single line.

If the statement is true, output 'N0 M0R3 BL4CK 1CE TEA!'.

If the statement is false, output 'ENJ0Y YOURS3LF!'
输入样例
2
1.1 2.2
2.05 1.4
输出样例
N0 M0R3 BL4CK 1CE TEA!
ENJ0Y YOURS3LF!

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-7053

最后修改于 2021-10-23T19:11:13+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 262144/262144K(Java/Others)