| Submit | All submissions | Best solutions | Back to list |
|
Problem hidden
BINDEC - Odd Numbers |
Lucy has many dominoes which are numbering with only 0 and 1.He likes to arranged the dominoes as the conversion of a decimal number which is known to him.Because he is not
expert in converting unknown decimal number into binary.His frnd Lisa also likes this task.But she wants to make some change in this arrangement and also she is curious to know
the decimal representation of this new arrangement of dominoes.But Lucy is unable to answer her and it is also prestigious for lucy.
So you have to write a programme so that Lucy can answer Lisa after changing the representation of dominoes.
You are given two number.Your task is to count total odd numbers between them.
Input
The first line will contain T(1<=T<=10^5), number of test case.
The next line will contain n and m(1<=n<=m<=10^17) , Two numbers.
Output
Print total odd numbers.
Example
Input: 3
1 5
4 8
3 10
Output: 3
2
4
| Added by: | Ruhul |
| Date: | 2019-10-17 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
RSS