CodeForces - 768B Code For 1 (线段树思想 二分)

Code For 1

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 , 可以拆分成  n / 2 (向下取整), n % 2, n / 2,  3部分，题目要求将一个数 n 拆成最后只有 0 或者 1，然后给出l 和 r ，问 l 到 r 之间 1 的个数。

思路：从大佬处得知，这个题完全类似于线段树的查询函数，因为每一个数的区间都是可以确定的。     对于拆分得到的一个数可以确定其所在的区间位置， 而且一个数 x 完全拆分后，一定有 x 个 1，其余的都是 0， 所以如果一个数的区间在查询区间内，那么可以直接返回这个数的值。   之后就是确定是否往 mid 的两边查询、 mid 所带的值就是   n % 2.

下面是我抄袭的AC代码：

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define LL long long
#define INT(t) int t; scanf("%d",&t)
#define LLI(t) LL t; scanf("%I64d",&t)

using namespace std;

LL query(LL l,LL r,LL ql,LL qr,LL i){
    if(ql <= l && r <= qr)
        return i;
    LL mid = (l + r) >> 1;
    LL ans = 0;
    if(ql < mid) ans += query(l,mid - 1,ql,qr,i / 2);
    if(qr > mid) ans += query(mid + 1,r,ql,qr,i / 2);
    if(ql <= mid && qr >= mid) ans += query(mid,mid,ql,qr,i % 2);
    return ans;
}

int main()
{
    LL n;
    while(~scanf("%I64d",&n)){
        LLI(l); LLI(r);
        LL len = 1;
        LL copn = n;
        while(n > 1){
            n = n / 2;
            len = len * 2 + 1;
        }
        printf("%I64d\n",query(1,len,l,r,copn));
    }
    return 0;
}