New Year and Old Property CodeForces - 611B

最新推荐文章于 2019-04-10 20:41:26 发布

白黑菜

最新推荐文章于 2019-04-10 20:41:26 发布

阅读量218

点赞数

分类专栏： ACM大一文章标签： DFS codeforces

本文链接：https://blog.csdn.net/qq_36556340/article/details/74892302

版权

ACM大一专栏收录该内容

79 篇文章 1 订阅

订阅专栏

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 and b (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.

Example

Input

5 10

Output

Input

2015 2015

Output

Input

100 105

Output

Input

72057594000000000 72057595000000000

Output

Note

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

DFS，我是真的菜啊。

具体规律：

1：因为一个数的二进制是唯一的，所以不会产生重复。

2：对于任意一个数x,x*2+1的二进制中零的个数与x相同。

3：如果一个数x的二进制不含0，那么2*x的二进制会比x多一个0.

上代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstring>
using  namespace std;
long long l,r;
long long ans;
void dfs(long long x,int flag)
{
    if(x>r)return;
    if(x<=r && x>=l && flag==1)
        ans++;
    if(flag==0)dfs(2*x,1);
    dfs(2*x+1,flag);
    return;
}
int  main()
{

    while(scanf("%lld %lld", &l,&r) != EOF)
    {
        ans = 0;
        dfs(1,0);
        cout << ans << endl;
    }
    return 0;
}

水波。