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

建议使用的浏览器:

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

3752:Is the one been second-killed first?

题目描述
Long long ago, a problem was spread all over the world , but no one could solve it . Now, due to the Internet , it has been solved perfectly(See figure 1).

Now here’s a problem much harmonious.
ErEr has big cake weighing m grams , at the same time he has n children . and every children want a part of the cake weighs even number(偶数) of grams. The children are extremely hungry and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the cake in the way they want. For sure, each of them should get a part of positive weight.
输入解释
The first line of input gives the number of cases, T (at most 100).
each case has there numbers m,n. (1<=m<=10000,1<=n<=100)
输出解释
Print YES, if the boys can divide the cake into n parts, each of them weighing even number of kilos; and NO in the opposite case.
输入样例
2
10 2
11 2
输出样例
YES
NO
来自杭电HDUOJ的附加信息
Author ReDow
Recommend lcy

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

源链接: HDU-3752

最后修改于 2020-10-25T23:06:40+00:00 由爬虫自动更新

共提交 0

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