#441. Segment Tree with Pruning
Segment Tree with Pruning
Description
Chenjb is struggling with data stucture now. He is trying to solve a problem using segment tree. Chenjb is a freshman in programming contest, and he wrote down the following C/C++ code and ran '''' to build a standard segment tree on range :
Node* build(long long l, long long r) {
Node* x = new(Node);
if (l == r) return x;
long long mid = (l + r) / 2;
x -> lchild = build(l, mid);
x -> rchild = build(mid + 1, r);
return x;
}
Chenjb submitted his code, but unfortunately, got MLE (Memory Limit Exceeded). Soon Chenjb realized that his program will new a large quantity of nodes, and he decided to reduce the number of nodes by pruning:
Node* build(long long l, long long r) {
Node* x = new(Node);
if (r - l + 1 <= k) return x;
long long mid = (l + r) / 2;
x -> lchild = build(l, mid);
x -> rchild = build(mid + 1, r);
return x;
}
You know, Chenjb is a freshman, so he will try different values of to find the optimal one. You will be given the values of and , please tell him the number of nodes that will be generated by his new program.
Format
Input
The first line contains a single integer (), the number of test cases. For each test case:
The only line contains two integers and (), denoting a query.
Output
For each query, print a single line containing an integer, denoting the number of segment tree nodes.
Samples
3
100000 1
100000 50
1000000000000000000 1
199999
4095
1999999999999999999