B. Code For 1----思维题

B. Code For 1

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon's place as maester of Castle Black. Jon agrees to Sam's proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility.

Initially Sam has a list with a single element n. Then he has to perform certain operations on this list. In each operation Sam must remove any element x, such that x > 1, from the list and insert at the same position , ,  sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.

Now the masters want the total number of 1s in the range l to r (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?

Input

The first line contains three integers n, l, r (0 ≤ n < 250, 0 ≤ r - l ≤ 105, r ≥ 1, l ≥ 1) – initial element and the range l to r.

It is guaranteed that r is not greater than the length of the final list.

Output

Output the total number of 1s in the range l to r in the final sequence.

Examples

input

7 2 5

output

4

input

10 3 10

output

5

Note

Consider first example:

Elements on positions from 2-nd to 5-th in list is [1, 1, 1, 1]. The number of ones is 4.

For the second example:

Elements on positions from 3-rd to 10-th in list is [1, 1, 1, 0, 1, 0, 1, 0]. The number of ones is 5.

题目链接：http://codeforces.com/contest/768/problem/B

这个题的意思是给你一个数，一直除以2会形成一个序列，求l到r区间内的总和。

想了个dfs，两个多小时没有弄好。。。

今天看了大牛的题解，我找到对称这个规律了，但是怎么也没有想到还可以这样做，我还是太菜了，这场cf打得我很不高兴，静不下心来打，该好好反思一下了。

大牛链接：

http://blog.csdn.net/qq_33362864/article/details/56280548

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <map>
#define LL long long
using namespace std;
map<LL,int> num;
void Init(LL n){//求2的倍数的位置n应该是什么值
    LL cnt=log2(n);
    cnt=pow(2,cnt+1);
    cnt/=2;
    while(cnt){
        num[cnt]=n&1;
        n>>=1;
        cnt>>=1;
    }
    return ;
}
LL Find_pos(LL x){//求对称位置，好神奇，还可以这么求，涨姿势了
    if(x&1){//很容易就能发现奇数位置都是第一个位置对称过去的，而第一个位置肯定是1
        return 1;
    }
    LL p=2;
    while(x%p==0){//仔细想想，是对的，求是在哪个点对称过去的
        if(x==p)
            return x;
        p<<=1;
    }
    p>>=1;
    return p;
}
int main(){
    LL n,l,r;
    cin>>n>>l>>r;
    Init(n);
    LL ans=0;
    for(LL i=l;i<=r;i++){
        ans+=num[Find_pos(i)];
    }
    cout<<ans<<endl;
    return 0;
}