POJ 3219 Binomial Coefficients G++

#include <iostream>
using namespace std;
//思路2   思路3背诵 
long long fun(long long x)
{
	long long js=0;
	long long ba=2;
	while(x>=ba)
	{
		js=js+x/ba;
		ba=ba*2;
	}
	return js;
}
int main()
{
	//cout<<fun(15)<<endl;
	long long n,k;
	while(cin>>n>>k)
	{
		if(n==1 && k==1)
		{
			cout<<1<<endl;
			continue;
		}
		if(n>0 && k==0)
		{
			cout<<1<<endl;
			continue;
		}
		long long a=fun(n)-fun(n-k);
		long long b=fun(k);
		if(a>b)
		{
			cout<<0<<endl;
		}else
		{
			cout<<1<<endl;
		}
	}
	return 0;
}