Codeforces768B 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.

—————————————————————————————————————

题目的意思是把大于1的数拆成a/2，a%2，a/2三个数，求拆完后的给定区间和

求出区间端点的前缀和相减，拆分的个数符合f(n)=2*f(n-1)+1，而n拆后的区间和一定是n，所以用二分找出端点位置即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <string>
#include <set>
#include <map>
using namespace std;



long long n;
long long l,r;
long long f(long long x)
{
    if(x==1)
        return 1;
    return 2*f(x/2)+1;
}

long long query(long long x)
{
    long long m=n;
    long long ans=0;
    while(x>0)
    {
        if(m==1)
         {
             ans+=1;
            break;
         }
        if(x>=f(m>>1))
        {
            ans+=m/2;
            x-=f(m/2);
            if(x>0)
            {
                if(m%2)
                    ans++;
                x-=1;
            }

        }
        m>>=1;
    }
    return ans;


}

int main()
{
    while(~scanf("%I64d%I64d%I64d",&n,&l,&r))
    {
        if(n==0)
            printf("0\n");
        else if(n==1)
            printf("1\n");
        else
        {
              long long ans1=query(l-1);
        long long ans2=query(r);
        printf("%I64d\n",ans2-ans1);
        }

    }
    return 0;
}