FZU 2221—— RunningMan——————【线性规划】
Accept: 17 Submit: 52
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
ZB loves watching RunningMan! There's a game in RunningMan called 100 vs 100.
There are two teams, each of many people. There are 3 rounds of fighting, in each round the two teams send some people to fight. In each round, whichever team sends more people wins, and if the two teams send the same amount of people, RunningMan team wins. Each person can be sent out to only one round. The team wins 2 rounds win the whole game. Note, the arrangement of the fighter in three rounds must be decided before the whole game starts.
We know that there are N people on the RunningMan team, and that there are M people on the opposite team. Now zb wants to know whether there exists an arrangement of people for the RunningMan team so that they can always win, no matter how the opposite team arrange their people.
Input
The first line contains an integer T, meaning the number of the cases. 1 <= T <= 50.
For each test case, there's one line consists of two integers N and M. (1 <= N, M <= 10^9).
Output
For each test case, Output "Yes" if there exists an arrangement of people so that the RunningMan team can always win. "No" if there isn't such an arrangement. (Without the quotation marks.)
Sample Input
Sample Output
Hint
In the second example, the RunningMan team can arrange 60, 60, 80 people for the three rounds. No matter how the opposite team arrange their 100 people, they cannot win.
Source
第六届福建省大学生程序设计竞赛-重现赛(感谢承办方华侨大学)
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main(){
int T,n,m;
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
if(n >= 1.5*(m-1)){
puts("Yes");
}else{
puts("No");
}
}
return 0;
}
最新文章
- centos 7 安装音乐播放器(亲测可用)(转载)
- jquery weibo 留言
- java中String的一些方法
- topcoder SRM 625 DIV2 IncrementingSequence
- Memcached 笔记与总结(7)增加虚拟节点
- MYSQL例题合集
- Spring源码下载地址
- Redis 和 Memcached 的区别详解
- 【Oracle】RAC添加新节点
- Android 开发 AirPlay Server
- Effective C++笔记05:实现
- calc()
- webapi 自定义缓存实现
- Docker attach
- HDU 6103 17多校6 Kirinriki(双指针维护)
- centos7-vmware克隆后的配置
- mysql数据库配置优化(占cpu过高问题)
- 使用 urllib 进行身份验证
- WebGL学习笔记二
- Netty简单使用