VC Is All You Need

VC Is All You Need

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 2033    Accepted Submission(s): 845

 

Problem Description

 

 

Three points example.
 

Four points example.

In this picture you can draw a line to seperate these 3 points in the two dimensional plane to keep points with the same color lie in the same side no matter how to color each point using either blue or red.

But in k dimensional real Euclidean space Rk, can you find n points satisfying that there always exsit a k−1 dimensional hyperplane to seperate them in any one of 2n coloring schemes?

 

Input

The first line contains only one integer T(1≤T≤105) denoting the number of test cases.

Each of next T lines contains two integers n,k∈[2,1018] seperated by a space.

 

Output

Print Yes if you can find one solution, or print No if you cannot.

 

Sample Input

3

2 2

3 2

4 2

 

Sample Output

Yes 
Yes 
No

#include<iostream>
using namespace std;
int main()
{
    long long k,n;
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>k;
        if(n-k<=1)
        cout<<"Yes"<<endl;
        else 
        cout<<"No"<<endl;
    }
}

官方给的证明也看不懂啊。

不过也贴一下