Codeforces Good Bye 2015 B. New Year and Old Property （DFS）

B. New Year and Old Property

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The year 2015 is almost over.

Limak is a little polar bear. He has recently learnt about the binary system. He noticed that the passing year has exactly one zero in its representation in the binary system —2015₁₀ = 11111011111₂. Note that he doesn't care about the number of zeros in the decimal representation.

Limak chose some interval of years. He is going to count all years from this interval that have exactly one zero in the binary representation. Can you do it faster?

Assume that all positive integers are always written without leading zeros.

Input

The only line of the input contains two integers a andb (1 ≤ a ≤ b ≤ 10¹⁸) — the first year and the last year in Limak's interval respectively.

Output

Print one integer – the number of years Limak will count in his chosen interval.

Sample test(s)

Input

5 10

Output

2

Input

2015 2015

Output

1

Input

100 105

Output

0

Input

72057594000000000 72057595000000000

Output

26

Note

In the first sample Limak's interval contains numbers 5₁₀ = 101₂,6₁₀ = 110₂,7₁₀ = 111₂,8₁₀ = 1000₂,9₁₀ = 1001₂ and10₁₀ = 1010₂. Two of them (101₂ and110₂) have the described property.

题意：求a到b之间转换为二进制之后的数中含有1个0的数的个数

思路：DFS

总结：刚开始写还害怕TLE，最后没想到没超

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 60001
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
using namespace std;
ll n,m;
ll ans;
void dfs(ll x,ll bz)
{
	if(x>m)
	return;
	if(x>=n&&x<=m&&bz)
	ans++;
	if(bz==0)
	dfs(x*2,1);
	dfs(x*2+1,bz);
}
int main()
{
	
	while(scanf("%I64d%I64d",&n,&m)!=EOF)
	{
		ans=0;
		dfs(1,0);
		printf("%I64d\n",ans);
	}
	return 0;
}