cf 768 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，求将他转换成01序列后，区间l到r范围内有多少个1；

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
typedef long long LL;
LL getlen(LL k)
{
    if(k==0||k==1) return 1;
    return getlen(k/2)*2+1;
}
LL solve(LL rt,LL L, LL R,LL l,LL r)
{
    if(r<L||R<l||rt==0) return 0;
    if(rt==1) return 1;
    LL mid=l+getlen(rt/2);
    return solve(rt/2,L,R,l,mid-1)+solve(rt%2,L,R,mid,mid)+solve(rt/2,L,R,mid+1,r);
}
int main()
{
    LL n, l, r;
    scanf("%lld %lld %lld", &n, &l, &r);
    LL cnt=getlen(n);
    printf("%lld\n",solve(n,l,r,1,cnt));
    return 0;
}