FZU - 2221 RunningMan

最新推荐文章于 2019-11-27 11:42:11 发布

古宇hhhh

最新推荐文章于 2019-11-27 11:42:11 发布

阅读量271

点赞数

分类专栏：规律

本文链接：https://blog.csdn.net/qq_30591245/article/details/71052343

版权

规律专栏收录该内容

32 篇文章 0 订阅

订阅专栏

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

2
100 100
200 100

Sample Output

No
Yes

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.

跑男团想要三场赢或者平两场

第一场派出 m/2

第二场派出 m/2

第三场派出 m/2-1

想要赢其中一个其他的两组肯定是小于等与跑男团

///比赛的时候卡了最后一个-1

#include<stdio.h>
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        if(n>m*3/2-1)
            printf("Yes\n");
        else printf("No\n");
    }
}