poj 1430 第二类斯特林数

 1 #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

int get2(long long n){
    if(n==0)
        return 0;
    int cnt =0;
    while(n){
        cnt += n/2;
        n = n/2;
    }
    return cnt;
}
int main(){

    int t;
    cin>>t;
    long long n,m;
    while(t--){
        cin>>n>>m;
        long long z = n-(m+2)/2;
        long long w = (m-1)/2;
        if(get2(z)-get2(w)-get2(z-w)>0){
            cout<<0<<endl;
        }else{
            cout<<1<<endl;
        }
    }
    return 0;
}