768B - 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.

题目大意： 给你一个数n和一个区间【l, r】，让这个数按n/2, n%2,n/2展开，展开过程中如果有大于1的数，按同样方法展开。

 展开过程有很高的对称性，并且发现奇数位全为1，所以找到右边的一半。

#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
using namespace std;
const int N = 100005;
const int inf = 0x7fffffff;
map<long long, int>m;
long long cnt;
void init(long long n)
{
    cnt = log2(n) + 1;
    cnt = pow(2, cnt);
    cnt>>=1;//求出一半数的个数
    while(cnt)
    {
        m[cnt] = n&1;
        n>>=1;
        cnt>>=1;
    }//然后对一半中偶数位的数求出来
}
int Find(long long x)
{
    if(x&1)
        return 1;//奇数的情况
    long long p = 2;
    while(x%p==0)
    {
        if(x==p) return x;对于上面已经求出来的
        p<<=1;//同时记录了对称轴的次数
    }
    return p>>1;
}


int main()
{
    long long n, l, r;

    scanf("%I64d%I64d%I64d", &n, &l, &r);
    init(n);
    long long ans = 0;
    for(long long i = l; i <= r; ++i)
    {
        ans += m[Find(i)];
    }
    printf("%I64d\n", ans);
    return 0;
}